<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ojapps</journal-id>
      <journal-title-group>
        <journal-title>Open Journal of Applied Sciences</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2165-3925</issn>
      <issn pub-type="ppub">2165-3917</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ojapps.2026.1610221</article-id>
      <article-id pub-id-type="publisher-id">ojapps-154851</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Biomedical</subject>
          <subject>Life Sciences</subject>
          <subject>Chemistry</subject>
          <subject>Materials Science</subject>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
          <subject>Engineering</subject>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>ARX-IoT: A Closed-Loop Framework for Resolving Explainability Conflicts and Enabling Actionable IoT Botnet Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid">0009-0003-6435-3294</contrib-id>
          <name name-style="western">
            <surname>Tché</surname>
            <given-names>Edja Olivier</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Atta</surname>
            <given-names>Amanvon Ferdinand</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Kamagaté</surname>
            <given-names>Beman Hamidja</given-names>
          </name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Oumtanaga</surname>
            <given-names>Souleymane</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Unité Mixte de Recherche et d’Innovation en Mathématiques et Sciences du Numérique (MSN), Institut National Polytechnique Félix Houphouët-Boigny (INP-HB), Yamoussoukro, Côte d’Ivoire </aff>
      <aff id="aff2"><label>2</label> Unité de Recherche et d’Expertise Numérique, Université Virtuelle de Côte d’Ivoire (UVCI), Abidjan, Côte d’Ivoire </aff>
      <aff id="aff3"><label>3</label> Laboratoire des Sciences et Technologies de l’Information et de la Communication (LASTIC), École Supérieure Africaine des Technologies de l’Information et de la Communication (ESATIC), Abidjan, Côte d’Ivoire </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>08</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>10</issue>
      <fpage>3981</fpage>
      <lpage>4023</lpage>
      <history>
        <date date-type="received">
          <day>06</day>
          <month>09</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>24</day>
          <month>10</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>27</day>
          <month>10</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ojapps.2026.1610221">https://doi.org/10.4236/ojapps.2026.1610221</self-uri>
      <abstract>
        <p>Botnets are spreading fast across the Internet of Things, and that has pushed defenders toward intrusion detection systems built on deep learning. These models detect attacks well, but they work as black boxes, which makes it hard to automate a response in settings where a wrong move is costly. Explainable AI was supposed to solve the transparency problem, yet it introduced one of its own: the explanations don’t agree with each other. Run SHAP and Anchors on the same prediction and you can get two different stories about why the model flagged it. For an operator who has to act on that prediction, this is not a minor inconsistency; it is a real source of doubt. ARX-IoT (Adaptive Resolved XAI) was designed to close the gap between an explanation that merely describes and a decision that has to be made. Rather than treating disagreement between explanations as noise to be smoothed over, the framework reads it as a signal and feeds it back into a control loop. To do this, it puts two very different kinds of explanation on the same footing: TimeSHAP, which assigns each feature a real-valued weight, and Anchors, which produces a binary yes/no mask. Both are mapped into a shared probabilistic space, so they can actually be compared. From there, the framework computes an actionability score that folds together three things: how stable the explanation is over time, how confident the model is, and a probabilistic veto factor. That veto is the safeguard: when the two explanations contradict each other badly, it steps in and pulls back the system’s autonomy instead of letting it act on shaky ground. A feedback loop tunes how sensitive the system is to conflict, adjusting via gradient descent, so that the effect of intervening stays close to a chosen target. We tested ARX-IoT with an attention-based LSTM detector and ran it 103 times on two datasets, CICIoT2023 and TON_IoT. Detection held up throughout, with accuracy above 0.96 on both (see <bold>Table 1</bold> for the full per-metric breakdown). The explanations, meanwhile, diverged in a consistent, structural way: the total variation distance reached 0.5382 on CICIoT2023. The ablation study is where the veto earns its place: switching it on cut the risk of a wrong mitigation decision by 26.7% on CICIoT2023 and 10.8% on TON_IoT compared with a system left unregulated, and the size of that improvement tracked how close the observed conflict sat to the critical veto threshold. In short, ARX-IoT works as a transparent safety filter: it catches the risky calls without touching the detection performance the underlying model already delivers.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Actionability</kwd>
        <kwd>Causally-Inspired Veto</kwd>
        <kwd>Closed-Loop Control</kwd>
        <kwd>Explainable Artificial Intelligence</kwd>
        <kwd>Explanatory Conflicts</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>The rapid expansion of the Internet of Things (IoT) has reshaped the cybersecurity threat landscape, placing botnets at the center of many modern attack strategies. Faced with this growing complexity, Deep Learning-based Intrusion Detection Systems (IDSs) have become essential tools for identifying sophisticated attack patterns [<xref ref-type="bibr" rid="B1">1</xref>]. However, their black-box nature [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>] limits their adoption in critical environments, where every security decision must be explainable, traceable, and defensible.</p>
      <p>Against this backdrop, Explainable Artificial Intelligence (XAI) has helped make machine learning models more transparent. This progress has, however, revealed a deeper problem: explanation methods often disagree with one another. Recent work highlights the inherent instability of explanations produced by XAI algorithms. Kumar and Thing [<xref ref-type="bibr" rid="B3">3</xref>] found that XAI explanations conflict across most of the IoT NIDS models they examined, confirming that widely used methods such as SHAP and LIME can yield divergent interpretations of the same instance. Such disagreement creates substantial uncertainty for security operators who must act on the resulting predictions.</p>
      <p>This instability is more than a theoretical concern; it can become a systemic weakness. An inconsistent explanation may reduce a system’s overall robustness against adversarial attacks [<xref ref-type="bibr" rid="B1">1</xref>]. Moreover, a lack of temporal consistency, which is particularly important in high-velocity IoT traffic, can trigger unstable defensive responses and undermine the reliability of protection mechanisms [<xref ref-type="bibr" rid="B4">4</xref>].</p>
      <p>Several lines of research have therefore attempted to reduce the gaps between explanation methods. A first group aims to establish explanatory consensus. EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>] selects, a priori, the models whose explanations best align with a given stakeholder through Stakeholder-Machine Agreement, whereas Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>] combines explanations from several XAI methods using fidelity-based weights. Although these approaches improve overall consistency, they act mainly before or after explanation generation and leave the operational decision-making process unchanged.</p>
      <p>A second group seeks to transform explanations into concrete actions. An explanation becomes genuinely useful when it is actionable, that is, when it can drive a reliable, consistent, and deterministic response [<xref ref-type="bibr" rid="B7">7</xref>]. In this direction, XAI4C [<xref ref-type="bibr" rid="B8">8</xref>] uses SHAP values to identify operational conflicts in O-RAN networks, while the framework proposed by Morrison <italic>et al</italic>. [<xref ref-type="bibr" rid="B9">9</xref>] incorporates XAI explanations into the cybersecurity decision-making process. These studies demonstrate the value of linking explanations to actions; nevertheless, they generally assume that the explanations are consistent and do not account for disagreements among multiple explanation methods.</p>
      <p>The literature thus reveals a persistent gap between theoretical explainability and operational actionability in IoT intrusion detection. The explanatory conflicts observed in IoT NIDSs [<xref ref-type="bibr" rid="B3">3</xref>], together with recent critical evaluations of XAI methods [<xref ref-type="bibr" rid="B10">10</xref>][<xref ref-type="bibr" rid="B11">11</xref>], suggest that current approaches still lack sufficient stability, consistency, and regulatory control. In this work, we refer to this phenomenon as <italic>explanatory</italic><italic>conflict</italic> and treat it as a major source of uncertainty in automated decision-making.</p>
      <p>More specifically, existing approaches do not simultaneously provide: 1) a formal method for quantifying conflict across multiple XAI methods, 2) an online decision-regulation mechanism driven by that conflict, and 3) decisions that adapt to the temporal evolution of IoT traffic. To address these limitations, we propose ARX-IoT, a decision-regulation framework built around explanatory conflict analysis. Unlike prior work, ARX-IoT neither selects a single explanation nor forces a simple consensus. Instead, it treats explanatory conflict as a decision signal and incorporates it into an adaptive closed-loop feedback mechanism.</p>
      <p>The main contributions of this work are threefold:</p>
      <p>1) ARX-IoT formally quantifies the conflict between TimeSHAP [<xref ref-type="bibr" rid="B12">12</xref>] and Anchors [<xref ref-type="bibr" rid="B13">13</xref>] using the total variation distance <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , rather than relying only on the global agreement or correlation measures used by EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>] and Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>].</p>
      <p>2) ARX-IoT introduces an online decision-regulation mechanism based on a closed-loop architecture. Rather than selecting a model a priori, as EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>] does, or aggregating explanations a posteriori, as in Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>], ARX-IoT applies a regulation factor <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and continuously adjusts the sensitivity parameter <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> according to the conflict observed at each time step. This mechanism enables the system to adapt to changes in IoT traffic, whereas earlier approaches remain largely static.</p>
      <p>3) The framework is experimentally validated for IoT cybersecurity on the TON_IoT and CICIoT2023 datasets. The results show that explicitly accounting for explanatory conflict reduces the risk of inappropriate mitigation decisions while strengthening the robustness of the overall decision-making process. </p>
      <p>In summary, EXAGREE transforms disagreement into a model-selection criterion, Consensus Importance uses it as an aggregation mechanism, and XAI4C applies XAI to operational conflict detection. By contrast, ARX-IoT treats explanatory conflict as a decision-regulation signal that dynamically adjusts the system’s level of automation according to explanatory uncertainty, without requiring prior model selection or continuous human intervention.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Work</title>
      <sec id="sec2dot1">
        <title>2.1. Conflicts among Explainability Methods: An Emerging Problem</title>
        <p>The adoption of Explainable Artificial Intelligence (XAI) in Intrusion Detection Systems (IDSs) has grown substantially to improve the transparency of deep learning models used in cybersecurity. Recent literature reviews show that XAI methods are increasingly integrated into IDSs to improve decision interpretability, strengthen analysts’ trust, and facilitate the validation of security alerts [<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B15">15</xref>]. Widely used methods, including SHAP, LIME, and Anchors, provide local or global explanations that help identify the features influencing model decisions.</p>
        <p>However, several recent studies show that different XAI methods can produce substantially different explanations for the same prediction, thereby raising concerns about the reliability of the resulting interpretations [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B16">16</xref>][<xref ref-type="bibr" rid="B17">17</xref>]. In particular, Kumar and Thing [<xref ref-type="bibr" rid="B3">3</xref>] show that leading explainability methods used in deep learning-based IDSs frequently disagree and may produce conflicting explanations for the same network attack.</p>
        <p>This phenomenon, commonly referred to as <italic>disagreement among XAI metho</italic><italic>ds</italic>, arises primarily from fundamental differences between explanation paradigms. Attribution-based methods, such as SHAP, estimate the contribution of each feature to a model decision, whereas rule-based methods, such as Anchors, identify sufficient logical conditions that locally explain a prediction. Because these approaches rely on different explanatory principles, they may naturally produce divergent interpretations, particularly in intrusion detection systems characterized by highly nonlinear relationships among features [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B11">11</xref>][<xref ref-type="bibr" rid="B17">17</xref>].</p>
        <p>Beyond being an interpretability issue, this divergence may reduce confidence in automated decisions, complicate the validation of security alerts, and directly affect the quality of decisions made by human operators [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B9">9</xref>][<xref ref-type="bibr" rid="B17">17</xref>].</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. State of the Art in Conflict-Resolution Approaches</title>
        <p>In response to this problem, several families of approaches have been proposed to reduce or characterize conflicts among explainability methods.</p>
        <p>A first family seeks to measure or establish consensus among multiple XAI methods. EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>] selects models whose explanations exhibit the highest agreement with stakeholder expectations, whereas Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>] provides a global agreement measure across multiple explainability methods by aggregating their contributions according to their fidelity. Similarly, Stow [<xref ref-type="bibr" rid="B17">17</xref>] proposes a measure of disagreement between SHAP and LIME, while Dib and Capus [<xref ref-type="bibr" rid="B11">11</xref>] clarify the conceptual distinctions among different families of XAI methods. Although these approaches improve the analysis and characterization of explanatory divergence, they remain primarily focused on measuring or aggregating explanations and do not directly intervene in the decision-making process.</p>
        <p>A second family of studies aims to make explanations more actionable. Singh <italic>et al</italic>. [<xref ref-type="bibr" rid="B7">7</xref>] show that an explanation acquires practical value when it can guide a concrete and usable decision. In this context, XAI4C [<xref ref-type="bibr" rid="B8">8</xref>] uses SHAP values to identify operational conflicts in O-RAN networks, while Morrison <italic>et al</italic>. [<xref ref-type="bibr" rid="B9">9</xref>] demonstrate that imperfections in XAI explanations can directly affect the quality of human decisions.</p>
        <p>In parallel, several XAI frameworks have been developed for IDSs and IoT environments. Wang <italic>et al</italic>. [<xref ref-type="bibr" rid="B18">18</xref>] were among the first to integrate SHAP into an explainable intrusion detection system. Subsequently, Arreche <italic>et al</italic>. [<xref ref-type="bibr" rid="B15">15</xref>] proposed a comprehensive framework for comparing multiple XAI methods applied to IDSs, while Sharma <italic>et al</italic>. [<xref ref-type="bibr" rid="B2">2</xref>] and Saied and Guirguis [<xref ref-type="bibr" rid="B19">19</xref>] demonstrated the value of explainable approaches for understanding IoT attacks and botnets. More recently, Kumar and Thing [<xref ref-type="bibr" rid="B3">3</xref>] confirmed that disagreement among XAI methods has become a significant challenge for deep learning-based IDSs.</p>
        <p>Another line of research uses rule extraction to transform model explanations into directly actionable knowledge. Studies by Uccello <italic>et al</italic>. [<xref ref-type="bibr" rid="B20">20</xref>][<xref ref-type="bibr" rid="B21">21</xref>], Li <italic>et al</italic>. [<xref ref-type="bibr" rid="B22">22</xref>], and Ables <italic>et al</italic>. [<xref ref-type="bibr" rid="B23">23</xref>] show that rules derived from machine learning models can be integrated into IDSs or Security Information and Event Management (SIEM) platforms to improve interpretability and facilitate the operational deployment of detection systems.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Identified Research Gaps</title>
        <p>The literature still leaves several gaps unresolved.</p>
        <p>First, although disagreement among XAI methods is increasingly recognized [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B17">17</xref>], existing studies mainly focus on comparison metrics or explanation aggregation. To the best of our knowledge, no existing approach specifically quantifies the conflict between a temporal attribution method such as TimeSHAP and a rule-based method such as Anchors within a unified decision-oriented framework.</p>
        <p>Second, current frameworks generally treat explanations as an endpoint of the interpretability process. Information produced by XAI methods is primarily used to interpret model decisions rather than as a decision-regulation signal capable of automatically adapting system behavior to explanatory uncertainty [<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>][<xref ref-type="bibr" rid="B15">15</xref>].</p>
        <p>Third, most existing approaches remain essentially static. They do not explicitly account for the dynamic nature of IoT traffic, which is characterized by substantial temporal variability, nor for the evolution of explanatory conflict over time [<xref ref-type="bibr" rid="B19">19</xref>][<xref ref-type="bibr" rid="B24">24</xref>].</p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. Positioning of ARX-IoT</title>
        <p>To address these limitations, we propose ARX-IoT, a decision-regulation framework based on explanatory conflict analysis.</p>
        <p>Unlike existing approaches, ARX-IoT neither seeks to select a single explanation nor attempts to construct a simple consensus among multiple methods. Instead, the framework treats explanatory conflict as decision-relevant information that is incorporated into an adaptive feedback loop.</p>
        <p>More specifically, ARX-IoT provides three main contributions: 1) a formal quantification of divergences between TimeSHAP and Anchors using a distance-based measure and a conflict coefficient; 2) a dynamic regulation mechanism based on a veto factor and continuous adaptation of system sensitivity according to the observed conflicts; and 3) an experimental validation on the CICIoT2023 and TON_IoT datasets, showing that explicitly exploiting explanatory conflicts improves the robustness of the decision-making process and reduces the risk of inappropriate responses.</p>
        <p>Thus, whereas EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>] seeks to select the most consensual models, Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>] aggregates multiple explanations, and XAI4C [<xref ref-type="bibr" rid="B8">8</xref>] detects operational conflicts, ARX-IoT transforms explanatory conflict itself into a decision-regulation signal capable of dynamically adjusting the automation level of an IDS according to explanatory uncertainty.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Methodology</title>
      <p>Let <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> be a vector of network features observed at time <inline-formula><mml:math><mml:mi> t </mml:mi></mml:math></inline-formula> , and let <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be the target variable representing normal traffic and a cyber-attack, respectively. An intrusion detection model (IDS) learns a prediction function such that:</p>
      <disp-formula id="FD1">
        <label>(1)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>P</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Y</mml:mi>
                  <mml:mi>t</mml:mi>
                </mml:msub>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
                <mml:mo>|</mml:mo>
                <mml:msub>
                  <mml:mi>X</mml:mi>
                  <mml:mi>t</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>f</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>X</mml:mi>
                  <mml:mi>t</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>.</mml:mo>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>To locally explain the model’s decisions when facing streaming data, two complementary post-hoc explainability methods are executed in parallel:</p>
      <p>An additive method (of the SHAP type), producing a signed attribution vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ϕ </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> d </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> .A local rule-based method (of the Anchors type), generating a set of local activation predicates <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . </p>
      <p>The objective is to project these heterogeneous descriptors into a common probabilistic representation space in order to quantify their structural disagreement, evaluate their joint temporal stability, and use this diagnostic signal as a control variable for regulating cyber mitigation policies.</p>
      <sec id="sec3dot1">
        <title>3.1. Probabilistic Representation and Alignment of Explanations</title>
        <p>To enable the auditing and alignment of explanatory outputs of different natures, the additive attributions and local rules are transformed into normalized weight vectors within the probabilistic simplex. This process measures the alignment of the distribution of relative feature importance, independently of their full semantic fidelity (such as sign or intrinsic entropy).</p>
        <p><bold>Additive vector (weights</bold><inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> ω </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> ϕ </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><bold>).</bold> To isolate the local importance mass allocated to each variable, we project the absolute value of the additive contributions. This transformation abstracts away from the directional sign of the impact to focus on the raw structural importance:</p>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>ω</mml:mi>
                <mml:mi>i</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>ϕ</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>ϕ</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>j</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mi>d</mml:mi>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>ϕ</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mi>ϵ</mml:mi>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> ε </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> is a regularization constant preventing any division by zero.</p>
        <p>Predicate-enriched local rule (weights <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> ω </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> ϕ </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ). To avoid semantic compression whereby each variable in the rule would receive an identical mass, we decompose the quality of the rule at the level of each local condition. Let <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> p </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be the continuous importance score of feature <inline-formula><mml:math display="inline"><mml:mi> i </mml:mi></mml:math></inline-formula> . If <inline-formula><mml:math display="inline"><mml:mi> i </mml:mi></mml:math></inline-formula> is engaged in a predicate of rule <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , its contribution integrates the overall precision of the rule <inline-formula><mml:math><mml:mrow><mml:mtext> Prec </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , its coverage <inline-formula><mml:math><mml:mrow><mml:mtext> Cov </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , as well as a local confidence factor <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> c </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> specific to the variable’s activation interval:</p>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>p</mml:mi>
                <mml:mi>i</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>A</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi mathvariant="double-struck">I</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>∈</mml:mo>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>w</mml:mi>
                    <mml:mrow>
                      <mml:mtext>Prec</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>⋅</mml:mo>
                  <mml:mtext>Prec</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>A</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>w</mml:mi>
                    <mml:mrow>
                      <mml:mtext>Cov</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>⋅</mml:mo>
                  <mml:mtext>Cov</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>A</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:msub>
                <mml:mi>c</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi mathvariant="double-struck"> I </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the membership indicator function, and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:mtext> Prec </mml:mtext></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:mtext> Cov </mml:mtext></mml:mrow></mml:msub><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are the arbitration weights for the rule properties. These enriched scores are then projected into the simplex:</p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>ω</mml:mi>
                <mml:mi>i</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>A</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>p</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>j</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mi>d</mml:mi>
                  </mml:msubsup>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:msubsup>
                    <mml:mi>p</mml:mi>
                    <mml:mi>j</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mi>ϵ</mml:mi>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The arbitration weights are set to <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:mtext> Prec </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:mtext> Cov </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.3 </mml:mn></mml:mrow></mml:math></inline-formula> , emphasizing the local reliability of an activated predicate over its breadth of coverage, consistent with the risk-averse use of the actionability score in a security context. Rules are generated by Anchors [<xref ref-type="bibr" rid="B13">13</xref>] under a minimum precision constraint <inline-formula><mml:math><mml:mrow><mml:mtext> Prec </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> τ </mml:mi><mml:mrow><mml:mtext> Anchor </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mrow><mml:mtext> Anchor </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.95 </mml:mn></mml:mrow></mml:math></inline-formula> , estimated via perturbation sampling with a beam width of 5 and a per-candidate sample budget of 500 perturbed instances. The local confidence factor <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> c </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is defined as a decreasing function of the relative width of the activation interval of variable <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> within the predicate of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD5">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>c</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>range of predicate</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mi>i</mml:mi>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>in</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>empirical range of variable</mml:mtext>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mi>i</mml:mi>
                  <mml:mtext>
                     
                  </mml:mtext>
                  <mml:mtext>in the training partition</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>so that narrower, more discriminative activation intervals receive higher confidence. When Anchors fails to produce a rule satisfying <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mrow><mml:mtext> Anchor </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> within the sampling budget, <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> p </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> for all variables (<italic>i.e.</italic>, <inline-formula><mml:math><mml:mrow><mml:mi mathvariant="double-struck"> I </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> i </mml:mi><mml:mo> ∈ </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> ), which, after normalization via Equation (4), reduces to a uniform distribution regularized by <inline-formula><mml:math><mml:mi> ε </mml:mi></mml:math></inline-formula> . The frequency of this fallback is reported in Section 4.3.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Quantification of Inter-Explanation Conflict</title>
        <p>The inter-explanatory disagreement is treated here as a diagnostic signal of operational caution rather than mere modeling noise. We capture how far apart the two importance distributions sit, mass-wise, using the Total Variation Distance (TVD), which we picked for staying bounded and offering a clear geometric reading:</p>
        <disp-formula id="FD6">
          <label>(5)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>D</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mn>2</mml:mn>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>d</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mo>|</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>ω</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>ϕ</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:msubsup>
                    <mml:mi>ω</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>|</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The distance <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> captures the largest gap in probability the two methods assign to any feature. To translate this divergence into a nonlinear indicator highly sensitive to strong structural oppositions, we formulate the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD7">
          <label>(6)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>C</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mtext>exp</mml:mtext>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>β</mml:mi>
                    <mml:mrow>
                      <mml:mtext>sens</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>⋅</mml:mo>
                  <mml:mi>D</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the dynamically updated sensitivity parameter (see Section 3.9).</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Conflict-Based Regulation Mechanism</title>
        <p>To moderate the system’s autonomy in the presence of highly contradictory explanations, a regulation factor <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is introduced:</p>
        <disp-formula id="FD8">
          <label>(7)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>Γ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mtext>e</mml:mtext>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mi>λ</mml:mi>
                  <mml:mi>C</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> is a scale parameter that controls the strength of the exponential penalty applied to explanatory conflict. This factor decreases exponentially as explanatory conflict increases. Rather than being tuned independently for each dataset, <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> is treated as a fixed hyperparameter of the framework: an independent grid search conducted on each dataset (Section 4.4) converges to the same optimal value, <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> , on both CICIoT2023 and TON_IoT, which is retained as the single operating value throughout this study.</p>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Joint Temporal Stability of Explanations</title>
        <p>The robustness of a streaming IDS system depends on the temporal coherence of the attribution-rule pair. We therefore measure stability not solely on the average amplitude of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ϕ </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , but on the joint semantic continuity through a dual metric over a sliding window <inline-formula><mml:math><mml:mi> τ </mml:mi></mml:math></inline-formula> :</p>
        <p>The directional stability of additive attributions via the temporal cosine distance: </p>
        <disp-formula id="FD9">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>d</mml:mi>
                <mml:mrow>
                  <mml:mtext>cos</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>ϕ</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>ϕ</mml:mi>
                    <mml:mrow>
                      <mml:mi>t</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>ϕ</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                  <mml:mo>⋅</mml:mo>
                  <mml:msub>
                    <mml:mi>ϕ</mml:mi>
                    <mml:mrow>
                      <mml:mi>t</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>‖</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>ϕ</mml:mi>
                            <mml:mi>t</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>‖</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>‖</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>ϕ</mml:mi>
                            <mml:mrow>
                              <mml:mi>t</mml:mi>
                              <mml:mo>−</mml:mo>
                              <mml:mn>1</mml:mn>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>‖</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The stability of the disagreement profile via the sliding variance of the <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> time series. </p>
        <p>The overall structural temporal stability <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is then the product of these two regularity components:</p>
        <disp-formula id="FD10">
          <label>(9)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>S</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mrow>
                      <mml:mn>1</mml:mn>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mrow>
                          <mml:mtext>Var</mml:mtext>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>∈</mml:mo>
                          <mml:mrow>
                            <mml:mo>[</mml:mo>
                            <mml:mrow>
                              <mml:mi>t</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mo>−</mml:mo>
                              <mml:mi>τ</mml:mi>
                              <mml:mi>t</mml:mi>
                            </mml:mrow>
                            <mml:mo>]</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>d</mml:mi>
                            <mml:mrow>
                              <mml:mtext>cos</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:msub>
                                <mml:mi>ϕ</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:msub>
                              <mml:mo>,</mml:mo>
                              <mml:msub>
                                <mml:mi>ϕ</mml:mi>
                                <mml:mrow>
                                  <mml:mi>k</mml:mi>
                                  <mml:mo>−</mml:mo>
                                  <mml:mn>1</mml:mn>
                                </mml:mrow>
                              </mml:msub>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>×</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mrow>
                      <mml:mn>1</mml:mn>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mrow>
                          <mml:mtext>Var</mml:mtext>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>∈</mml:mo>
                          <mml:mrow>
                            <mml:mo>[</mml:mo>
                            <mml:mrow>
                              <mml:mi>t</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mo>−</mml:mo>
                              <mml:mi>τ</mml:mi>
                              <mml:mi>t</mml:mi>
                            </mml:mrow>
                            <mml:mo>]</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>D</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>k</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Local Agreement Score</title>
        <p>The degree of immediate convergence between the additive method and the rule-based method is quantified by the local agreement score <inline-formula><mml:math><mml:mrow><mml:mi> G </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , the direct complement of the total variation distance:</p>
        <disp-formula id="FD11">
          <label>(10)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>G</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mi>D</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec3dot6">
        <title>3.6. Augmented Actionability Score</title>
        <p>The augmented actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is defined as a composite operational decision score. It synthesizes the overall confidence granted to the system state and is empirically calibrated on a validation set. Unlike the local agreement score <inline-formula><mml:math><mml:mrow><mml:mi> G </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (Equation (10)), which captures instantaneous convergence between the two explanation methods, <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> integrates the model’s own predictive confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , defined as the mean of the maximum softmax probability assigned by the LSTM classifier over the evaluation window. This choice reflects the fact that actionability should also reward high classifier certainty, not solely inter-explanation convergence:</p>
        <disp-formula id="FD12">
          <label>(11)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>A</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>w</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mi>S</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>w</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mi>Γ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>w</mml:mi>
                <mml:mn>3</mml:mn>
              </mml:msub>
              <mml:mtext>Co</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>under the standard convex combination constraints:</p>
        <disp-formula id="FD13">
          <mml:math>
            <mml:mrow>
              <mml:mstyle displaystyle="true">
                <mml:msubsup>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>m</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mn>3</mml:mn>
                </mml:msubsup>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>w</mml:mi>
                    <mml:mi>m</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>A grid search over <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> was conducted independently on each dataset (Section 4.4); both searches identify <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.8 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as the statistically optimal configuration. To keep the contributions of temporal stability, conflict regulation, and model confidence balanced and easy to read, and to hold on to a single operating point that doesn’t depend on the dataset, we keep the setting <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> throughout the framework, applying it the same way to both datasets.</p>
      </sec>
      <sec id="sec3dot7">
        <title>3.7. Sequential and Graduated Decision Policy</title>
        <p>Given the demands of IoT network management, where human intervention needs to be kept to what is strictly necessary, the composite score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> feeds into a three-level graduated decision policy:</p>
        <disp-formula id="FD14">
          <mml:math>
            <mml:mrow>
              <mml:mi>π</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>A</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mtable columnalign="left">
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>Automatic mitigation</mml:mtext>
                          <mml:mo>,</mml:mo>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>if</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>≥</mml:mo>
                          <mml:msub>
                            <mml:mi>τ</mml:mi>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mtext>and</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>&lt;</mml:mo>
                          <mml:msub>
                            <mml:mi>C</mml:mi>
                            <mml:mrow>
                              <mml:mtext>max</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>Alert</mml:mtext>
                          <mml:mo>&amp;</mml:mo>
                          <mml:mtext>human inspection</mml:mtext>
                          <mml:mo>,</mml:mo>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>if</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:msub>
                            <mml:mi>τ</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                          <mml:mo>≤</mml:mo>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>&lt;</mml:mo>
                          <mml:msub>
                            <mml:mi>τ</mml:mi>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mtext>and</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>&lt;</mml:mo>
                          <mml:msub>
                            <mml:mi>C</mml:mi>
                            <mml:mrow>
                              <mml:mtext>max</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>Veto/suspension of action</mml:mtext>
                          <mml:mo>,</mml:mo>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>if</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>&lt;</mml:mo>
                          <mml:msub>
                            <mml:mi>τ</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mtext>or</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                          <mml:mo>≥</mml:mo>
                          <mml:msub>
                            <mml:mi>C</mml:mi>
                            <mml:mrow>
                              <mml:mtext>max</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> are the operational actionability thresholds set to match the security administrator’s appetite for risk, and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> marks the hard critical-conflict ceiling past which any automated action is blocked outright, no matter what <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> says.</p>
      </sec>
      <sec id="sec3dot8">
        <title>3.8. Causal Regulation Framework under Uncertainty and Interventional Heuristic</title>
        <p>In industrial IoT environments, a complete and verifiable Structural Causal Model (SCM) is generally unavailable during real-time operation. Consequently, intervention effects cannot be formally identified using Pearl’s do-calculus. In ARX-IoT, the causal formalism is therefore used as a conceptual framework for interventional reasoning under diagnostic uncertainty rather than as a strict causal identification model.</p>
        <p>The impact of a mitigation action <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> π </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is not modeled as a pure causal effect, but as an operational heuristic for risk reduction indexed on the level of XAI conflict. Let <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> γ </mml:mi><mml:mi> a </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> be the historical nominal effectiveness of automatic action <italic>a</italic>. The expected mitigation effect <inline-formula><mml:math><mml:mrow><mml:mi> Δ </mml:mi><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is weighted by explanatory uncertainty:</p>
        <disp-formula id="FD15">
          <label>(12)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>Δ</mml:mi>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≈</mml:mo>
              <mml:msub>
                <mml:mi>γ</mml:mi>
                <mml:mi>a</mml:mi>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:mi>C</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Consequently, the post-intervention residual risk probability is estimated for algorithmic decision steering as:</p>
        <disp-formula id="FD16">
          <label>(13)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>P</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mrow>
                  <mml:mi>p</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>s</mml:mi>
                  <mml:mi>t</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                  <mml:mo>|</mml:mo>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                  <mml:mi>d</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>π</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>f</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>γ</mml:mi>
                <mml:mi>a</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:mi>C</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This formulation establishes a direct relationship between the actuator’s risk tolerance and the clarity of the underlying explanations. Higher explanatory conflict reduces the expected effectiveness of automatic mitigation, whereas greater explanatory agreement increases confidence in autonomous intervention decisions.</p>
      </sec>
      <sec id="sec3dot9">
        <title>3.9. Online Adaptation of the Conflict Parameter</title>
        <p>To dynamically adapt the system’s sensitivity to fluctuations in streaming IoT data, ARX-IoT updates the conflict sensitivity parameter online through a differentiable optimization process. We define an online loss function <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ℒ </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> that quantifies the instantaneous regulation objective.</p>
        <p>To guarantee the strict positivity of the sensitivity parameter <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and improve optimization stability, we introduce an unconstrained latent control variable <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . The parameter <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is obtained through a Softplus transformation of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD17">
          <label>(14)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mrow>
                  <mml:mtext>sens</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>ln</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>+</mml:mo>
                  <mml:msup>
                    <mml:mtext>e</mml:mtext>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>u</mml:mi>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>softplus</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>u</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This parametrization ensures that <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> for all optimization steps while avoiding numerical instabilities associated with constrained optimization.</p>
        <p>The latent variable is updated at each time step using a gradient descent rule:</p>
        <disp-formula id="FD18">
          <label>(15)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>u</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>u</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:mi>η</mml:mi>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>ℒ</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>u</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Applying the chain rule yields the gradient in the unconstrained optimization space</p>
        <disp-formula id="FD19">
          <label>(16)</label>
          <mml:math>
            <mml:mrow>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>ℒ</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>u</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>ℒ</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>β</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>⋅</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>u</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the sigmoid function. This parametrization guarantees the absolute positivity of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> while improving the numerical stability of online adaptation. The convergence and dynamic regret properties remain subject to the choice of <inline-formula><mml:math><mml:mi> η </mml:mi></mml:math></inline-formula> , the regularity of the loss function <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ℒ </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as well as the local stationarity of data drift.</p>
        <p>The online loss function is a quadratic tracking objective, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> Δ </mml:mtext><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:mi> θ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> , where <inline-formula><mml:math><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.02 </mml:mn></mml:mrow></mml:math></inline-formula> is the target causal effect of mitigation actions (previously shown only graphically in the feedback-loop convergence plots of Section 4.7). The controller uses a learning rate <inline-formula><mml:math><mml:mi> η </mml:mi></mml:math></inline-formula> (0.01), with the latent sensitivity variable initialized so that <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mn> 0 </mml:mn><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 1.0 </mml:mn></mml:mrow></mml:math></inline-formula> on TON_IoT and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mn> 0 </mml:mn><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 1.5 </mml:mn></mml:mrow></mml:math></inline-formula> on CICIoT2023, reflecting dataset-specific prior calibration of conflict sensitivity. The update rule of Equation (15) is applied once per evaluation round (<italic>i.e.</italic>, once per sliding-window batch processed by the feedback loop), producing 30-iteration convergence trajectories that are analyzed later in Section 4.7. All controller parameters (<inline-formula><mml:math><mml:mi> η </mml:mi></mml:math></inline-formula> , <inline-formula><mml:math><mml:mi> θ </mml:mi></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mn> 0 </mml:mn><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ), the actionability weights (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> ), and the regulation scale <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> were selected exclusively on the validation partition and frozen before test-set evaluation, with no further adjustment.</p>
      </sec>
      <sec id="sec3dot10">
        <title>3.10. Overall System Objective</title>
        <p>The framework aims to maximize the effective mitigation of network threats in a streaming setting, under an explicit constraint of explanatory coherence and clarity, where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the critical conflict threshold beyond which no automation is tolerated by the security policy.</p>
      </sec>
      <sec id="sec3dot11">
        <title>3.11. Experimental Setup</title>
        <p>The experimental protocol was designed to validate the fundamental hypotheses of the ARX-IoT framework presented in the previous section. The main objective is to demonstrate that the proposed framework not only enables the production of robust decisions but also explicitly accounts for disagreements between explainability methods in heterogeneous IoT environments. In this context, four complementary objectives are defined.</p>
        <p><bold>(O1) Qua</bold><bold>ntification of Explanatory Divergences.</bold> Inter-explanatory divergences between XAI methods must be explicitly measured in order to characterize their level of disagreement and assess their impact on the decision-making process. This objective constitutes the foundation of the ARX-IoT framework, insofar as the quantification of explanatory conflict represents the central mechanism upon which decision regulation is based.</p>
        <p><bold>(O2) S</bold><bold>uperiority of Joint Optimization.</bold> The simultaneous optimization of temporal stability, explanatory coherence, and model confidence, through the actionability score <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , must lead to more robust and reliable decisions than optimization based on a single criterion. This objective aims to demonstrate the relevance of the multi-dimensional integration of explanatory signals within a unified framework.</p>
        <p><bold>(O3</bold><bold>) Generalization of Conflict-Based Regulation.</bold> The benefits provided by the regulation mechanism <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and the dynamic adaptation of the parameter <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> sens </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> must be maintained from the validation set to the test set, across heterogeneous datasets. This objective verifies the framework’s ability to generalize its behavior under unseen conditions, while adapting to varied traffic environments.</p>
        <p><bold>(O4) O</bold><bold>ptimality and Stability of Regulation Parameters.</bold> The regulation hyperparameters (<inline-formula><mml:math><mml:mi> p </mml:mi></mml:math></inline-formula> , <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> ) are respectively identical to the regulation scale parameter <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> of Equation (7) and the conflict sensitivity <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> of Equation (6), so that <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> ≡ </mml:mo><mml:mi> λ </mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> k </mml:mi><mml:mo> ≡ </mml:mo><mml:mi> β </mml:mi></mml:mrow></mml:math></inline-formula> , as well as the weights of the actionability score <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , must admit optimal values that maximize <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , while maintaining a satisfactory level of local precision. These optima also need to hold steady as traffic conditions shift, which is what keeps the framework robust in dynamic IoT environments.</p>
      </sec>
      <sec id="sec3dot12">
        <title>3.12. Experimental Datasets and Protocol</title>
        <p><bold>TON_IoT</bold><bold>.</bold> The TON_IoT [<xref ref-type="bibr" rid="B25">25</xref>] dataset is one of the richest benchmarks around for evaluating intrusion detection systems in IoT settings. It pulls together several different sources (network flows, system logs, IoT sensor readings) and covers a broad mix of attacks: botnets (Mirai, Gafgyt), denial of service, scanning, and injection. Its high temporal variability makes it a solid basis for studying how stable explanations are. That said, it comes with built-in noise, imbalanced classes, and some missing values, which is exactly what you’d expect from conditions close to a real operational environment.</p>
        <p><bold>CICIoT20</bold><bold>23.</bold> The CICIoT2023 [<xref ref-type="bibr" rid="B26">26</xref>] dataset, put together by the Canadian Institute for Cybersecurity, gives you a more controlled but still realistic environment, and it brings in the main families of today’s botnets. It stands out for its stable temporal structure, carefully labelled attack classes, strong compatibility with deep learning pipelines, and enough data to support robust statistical evaluation.</p>
        <p>There are still a few caveats to keep in mind, chiefly some redundancy between classes and the fairly controlled nature of the traffic, which doesn’t fully capture real adversarial conditions. These aspects are incorporated into the comparative interpretation of the results.</p>
        <p><bold>Protocol.</bold> For both datasets, raw network flows were transformed into session-level time sequences in order to preserve the intrinsic dynamics of IoT traffic. Non-generalizable identifiers (IP addresses, ports, timestamps, and protocol fields) were removed. Missing values were imputed by the median (numerical variables) and by the mode (categorical variables). Categorical variables were encoded via one-hot encoding, and continuous variables were normalized using a StandardScaler; all these estimators were fitted exclusively on the training partition in order to prevent any data leakage. To prevent temporal leakage between partitions, the train/validation/test split is now performed prior to sliding-window construction, rather than by direct random stratification over already-constructed, overlapping windows. The raw traffic for each dataset is first partitioned into non-overlapping chronological blocks (session-level groups for TON_IoT, given its heterogeneous multi-source structure, and capture-ordered chronological segments for CICIoT2023). These blocks are assigned to the training (60%), validation (20%), and test (20%) partitions, with stratification by attack class applied within each partition rather than across partition boundaries. Sliding windows of size <inline-formula><mml:math><mml:mrow><mml:mi> w </mml:mi><mml:mo> = </mml:mo><mml:mn> 10 </mml:mn></mml:mrow></mml:math></inline-formula> are then constructed independently within each block, ensuring that no individual flow is shared between a training window and a test window. This eliminates the risk, inherent to post-hoc stratification of overlapping sliding windows, of placing near-identical sequences on both sides of the train/test boundary. Class imbalance within each partition continues to be addressed through class-weighted learning as previously described. All 103 independent runs will be re-executed under this corrected protocol, with the same random seeds (42) for NumPy, TensorFlow, and the Anchors sampling procedure, and the updated results (<bold>Tables 1-6</bold>) will replace those currently reported, together with an explicit discussion of the magnitude of the correction relative to the original protocol. Beyond this stratified partitioning, class imbalance was further addressed during model training through class-weighted learning. Specifically, on both datasets we trained the Random Forest baseline with scikit-learn’s balanced class-weight heuristic, which sets weights inversely to how often each class shows up in the training set. In the same spirit, for the LSTM model we fed balanced class weights derived from the training partition into the optimization through TensorFlow’s class_weight mechanism, again for both CICIoT2023 and TON_IoT. Keeping the training protocol the same this way means class imbalance is handled consistently across the two datasets, all while we hold on to the stratified train/validation/test split.</p>
        <p>We repeated each experimental configuration 103 times, each with an independent random initialization of the LSTM weights and the Anchors sampling procedure, fixing the random seeds at 42 for NumPy, TensorFlow, and the sampling routines. We didn’t pick this number of repetitions up front; it came out of the experiments: early trials showed non-negligible run-to-run swings in the actionability score, driven by the random weight initialization and the sampling-based nature of Anchors, so we kept adding independent runs until the running mean and standard deviation of the actionability score settled down—that is, until extra runs no longer moved these statistics in any meaningful way. The figures reported in <bold>Table 4</bold> and <bold>Table 5</bold> are the averages over those 103 runs.</p>
        <p>The ARX-IoT framework is evaluated on the CICIoT2023 and TON_IoT datasets using a two-layer LSTM detection model with an attention mechanism, compared against two baseline models (Random Forest and logistic regression). Explanations are generated jointly by TimeSHAP (additive method, vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ϕ </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) and Anchors (binary mask <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ), in accordance with the probabilistic representation introduced in Section 3.1.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Results and Discussion</title>
      <sec id="sec4dot1">
        <title>4.1. Detection Performance</title>
        <p><bold>Table 1</bold> reports the classification performance of the three evaluated models on both datasets.</p>
        <p><bold>Table 1</bold><bold>.</bold> Detection performance on CICIoT2023 and TON_IoT.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Dataset</bold>
                </td>
                <td>
                  <bold>Model</bold>
                </td>
                <td>
                  <bold>Accuracy</bold>
                </td>
                <td>
                  <bold>Precision</bold>
                </td>
                <td>
                  <bold>Recall</bold>
                </td>
                <td>
                  <bold>F1-Score</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
              </tr>
              <tr>
                <td rowspan="3">
                  <bold>CICIoT2023</bold>
                </td>
                <td>LSTM</td>
                <td>0.978 ± 0.004</td>
                <td>0.975 ± 0.005</td>
                <td>0.981 ± 0.004</td>
                <td>0.978 ± 0.004</td>
                <td>0.991 ± 0.003</td>
              </tr>
              <tr>
                <td>Random Forest</td>
                <td>0.982 ± 0.003</td>
                <td>0.979 ± 0.004</td>
                <td>0.985 ± 0.003</td>
                <td>0.982 ± 0.003</td>
                <td>0.994 ± 0.002</td>
              </tr>
              <tr>
                <td>Logistic Regression</td>
                <td>0.924 ± 0.007</td>
                <td>0.918 ± 0.008</td>
                <td>0.929 ± 0.006</td>
                <td>0.923 ± 0.007</td>
                <td>0.958 ± 0.005</td>
              </tr>
              <tr>
                <td rowspan="3">
                  <bold>TON_IoT</bold>
                </td>
                <td>LSTM</td>
                <td>0.961 ± 0.006</td>
                <td>0.957 ± 0.007</td>
                <td>0.965 ± 0.005</td>
                <td>0.961 ± 0.006</td>
                <td>0.983 ± 0.004</td>
              </tr>
              <tr>
                <td>Random Forest</td>
                <td>0.965 ± 0.005</td>
                <td>0.961 ± 0.006</td>
                <td>0.968 ± 0.005</td>
                <td>0.964 ± 0.005</td>
                <td>0.986 ± 0.003</td>
              </tr>
              <tr>
                <td>Logistic Regression</td>
                <td>0.908 ± 0.008</td>
                <td>0.899 ± 0.009</td>
                <td>0.915 ± 0.008</td>
                <td>0.907 ± 0.008</td>
                <td>0.942 ± 0.006</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The LSTM and Random Forest models achieve close detection performance in absolute terms, both markedly higher than logistic regression, whose linear nature limits its ability to model the complex behavior of IoT botnets. However, given the low standard deviations obtained over 103 independent runs, this proximity should not be read as statistical equivalence: on every metric and on both datasets, the 95% confidence intervals (<inline-formula><mml:math><mml:mrow><mml:mtext> mean </mml:mtext><mml:mo> ± </mml:mo><mml:mn> 1.96 </mml:mn><mml:mrow><mml:mrow><mml:mtext> SD </mml:mtext></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:msqrt><mml:mrow><mml:mn> 103 </mml:mn></mml:mrow></mml:msqrt></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> ) of Random Forest and LSTM do not overlap (e.g., accuracy on CICIoT2023: LSTM [0.9772, 0.9788] vs. RF [0.9814, 0.9826]), so that Random Forest is statistically significantly better than the LSTM on raw detection performance on both datasets. This difference is nonetheless small in absolute terms (≤0.4 percentage points on accuracy).</p>
        <p>Despite Random Forest’s small but statistically significant edge in raw detection performance, the LSTM was retained as the reference model for the ARX-IoT framework. This choice isn’t about raw detection accuracy; it comes down to architecture. The LSTM’s knack for capturing the temporal dependencies in network flows is what lets us pick up on the sequential behavior of botnets and, just as importantly, produce the temporal, sequence-level explanations that TimeSHAP needs something a static model like Random Forest simply can’t deliver.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Learning Convergence</title>
        <p>To build statistical confidence and rein in the sampling variability running through the experimental pipeline, we measured the baseline performance over 103 independent Monte Carlo sub-sampling runs, each with a different random seed. <bold>Table 1</bold> gives the empirical mean and standard deviation (Mean ± SD) for three representative classifiers that span traditional linear modeling, tree-based ensembles, and a recurrent deep learning architecture: Logistic Regression, Random Forest, and LSTM. On both datasets, the standard deviations stay low (<inline-formula><mml:math><mml:mrow><mml:mtext> SD </mml:mtext><mml:mo> ≤ </mml:mo><mml:mn> 0.009 </mml:mn></mml:mrow></mml:math></inline-formula> ), which confirms how stable the baseline predictions are before we bring in the explanatory frameworks.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId249.jpeg?20261027032110" />
        </fig>
        <p>(a)</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId250.jpeg?20261027032109" />
        </fig>
        <p>(b)</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId251.jpeg?20261027032109" />
        </fig>
        <p>(c)</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId252.jpeg?20261027032109" />
        </fig>
        <p>(d)</p>
        <p><bold>Figure 1.</bold> (a) LSTM loss on CICIoT2023. (b) LSTM accuracy on CICIoT2023. (c) LSTM accuracy on TON_IoT. (d) LSTM loss on TON_IoT.</p>
        <p>In particular, the accuracy and loss curves of the LSTM model (<xref ref-type="fig" rid="fig1">Figure 1</xref>) show stable convergence with no marked sign of overfitting, the validation curves closely track the training curves up to the early-stopping criterion. This behavior validates the robustness of the deep learning architecture’s internal representations across iterations. </p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Probabilistic Representation of Explanations</title>
        <p>In accordance with the formulation introduced in Section 3.1, the contributions of TimeSHAP (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> ϕ </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) and the Anchors rules (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> b </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) are projected onto a common space of normalized weights. <xref ref-type="fig" rid="fig2">Figure 2</xref> illustrates this representation for a representative instance of the CICIoT2023 test set: the feature IAT (Inter-Arrival Time) dominates the importance assigned by TimeSHAP (≈0<italic>.</italic>19), whereas Anchors distributes its binary mask almost uniformly across a structurally different subset of features (including syn_count, urg_count, and ICMP, which are absent from TimeSHAP’s priorities). This flagrant structural divergence between the two representations constitutes the empirical basis of the quantified conflict <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> , </mml:mo><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> presented in the following subsection.</p>
        <p><xref ref-type="fig" rid="fig2">Figures 2(c)-(d)</xref> reproduce this analysis for the TON_IoT dataset. A similar structure is observed: type_normal concentrates nearly all of the TimeSHAP importance (≈0<italic>.</italic>60), whereas Anchors distributes its mask almost uniformly across the available features, notably including the source-address variables (src_ip_192.168.1.x) and attack-type variables (type_ddos, type_dos, type_injection). This convergence of behavior across the two datasets confirms that the structural divergence between additive and symbolic methods is a general property of the framework, independent of the dataset.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId259.jpeg?20261027032111" />
        </fig>
        <p>(a)</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId260.jpeg?20261027032112" />
        </fig>
        <p>(b)</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId261.jpeg?20261027032112" />
        </fig>
        <p>(c)</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId262.jpeg?20261027032112" />
        </fig>
        <p>(d)</p>
        <p><bold>Figure 2</bold><bold>.</bold> (a) TimeSHAP feature-importance distribution on CICIoT2023. (b) Anchors feature-importance distribution on CICIoT2023. (c) TimeSHAP feature-importance distribution on TON_IoT. (d) Anchors feature-importance distribution on TON_IoT.</p>
      </sec>
      <sec id="sec4dot4">
        <title>4.4. Hyperparameter Selection</title>
        <p>Hyperparameter selection is a critical step of the ARX-IoT framework, since the parameters governing the regulation mechanism directly influence the system’s ability to identify, weight, and process the divergences between TimeSHAP and Anchors explanations.</p>
        <p>The optimized parameters are defined by the weight vector <inline-formula><mml:math><mml:mrow><mml:mi> Θ </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> of Equation (11), subject to <inline-formula><mml:math display="inline"><mml:mrow><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∑ </mml:mo><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:mstyle><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . This grid search is conducted independently of the regulation scale parameter <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> introduced in Equation (7). An independent grid search over <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> (Section 4.4, below) converges to the same value, <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> , on both CICIoT2023 and TON_IoT; this value is retained as fixed rather than re-tuned jointly with <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , which reduces the dimensionality of the hyperparameter search and facilitates a direct and interpretable comparison of the weighting configurations. <bold>Table 2</bold> lists the five best configurations of <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> that came out of the grid search, which we ran separately for each dataset.</p>
        <p>To pin down the best configuration, we pair an exhaustive grid search with a sensitivity analysis. We judge each candidate configuration <inline-formula><mml:math><mml:mi> Θ </mml:mi></mml:math></inline-formula> against a criterion that blends the overall quality of the explanatory decisions with how stable they stay under experimental variation. The optimization problem takes the form of the following objective function:</p>
        <disp-formula id="FD20">
          <mml:math>
            <mml:mrow>
              <mml:munder>
                <mml:mrow>
                  <mml:mtext>max</mml:mtext>
                </mml:mrow>
                <mml:mi>P</mml:mi>
              </mml:munder>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mrow>
                      <mml:mtext>mean</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mi>β</mml:mi>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mrow>
                      <mml:mtext>std</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> P </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the mean value of the actionability score obtained for configuration <inline-formula><mml:math><mml:mi> P </mml:mi></mml:math></inline-formula> , while <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> P </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> measures the dispersion (standard deviation) of this score across evaluations.</p>
        <p>The coefficient <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> controls the trade-off between maximizing actionability and reducing instability. In this study, we set:</p>
        <disp-formula id="FD21">
          <mml:math>
            <mml:mrow>
              <mml:mi>β</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mn>0.5.</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>which corresponds to a moderate variance penalty, chosen to avoid selecting configurations with high mean actionability that nonetheless exhibit unstable or highly data-sensitive explanatory behavior.</p>
        <p>The retained optimal configuration <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> P </mml:mi><mml:mtext> * </mml:mtext></mml:msup><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msubsup><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn><mml:mtext> * </mml:mtext></mml:msubsup><mml:mo> , </mml:mo><mml:msubsup><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn><mml:mtext> * </mml:mtext></mml:msubsup><mml:mo> , </mml:mo><mml:msubsup><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn><mml:mtext> * </mml:mtext></mml:msubsup></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (with <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> fixed, see Equation (7)) is therefore the one satisfying:</p>
        <disp-formula id="FD22">
          <label>(17)</label>
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>P</mml:mi>
                <mml:mtext>*</mml:mtext>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mtext>arg</mml:mtext>
              <mml:munder>
                <mml:mrow>
                  <mml:mtext>max</mml:mtext>
                </mml:mrow>
                <mml:mi>P</mml:mi>
              </mml:munder>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mrow>
                      <mml:mtext>mean</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.5</mml:mn>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mrow>
                      <mml:mtext>std</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The five best configurations obtained under this criterion are reported in <bold>Table 2</bold>, separately for each dataset. Both grid searches converge to the same optimum, <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.8 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ; for the reasons discussed above, the framework nonetheless retains <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as a single dataset-independent configuration. Comparing the top-5 configurations also makes it possible to assess the sensitivity of the framework to variations in <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , further reinforcing the experimental validation of the proposed approach.</p>
        <p>The global optimum, <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.8 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , is identical for both datasets under the Score criterion of Equation (17). It is not adopted as the deployed configuration; <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is retained instead as a design choice (Section 4.4), prioritizing <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> over raw <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . This configuration isn’t part of <bold>Table 2</bold> grid, so it can’t be lined up against its top-5 ranking; its own <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mtext> Score </mml:mtext></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> values appear in the corrected table note below.</p>
        <p>To quantify the actionability trade-off, the statistically optimal configuration <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.8 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> achieves <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.9230 </mml:mn></mml:mrow></mml:math></inline-formula> on CICIoT2023 and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.9602 </mml:mn></mml:mrow></mml:math></inline-formula> on TON_IoT. The retained configuration <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> achieves <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.9334 </mml:mn></mml:mrow></mml:math></inline-formula> on CICIoT2023 and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.9029 </mml:mn></mml:mrow></mml:math></inline-formula> on TON_IoT. So, the configuration we kept buys a +0.0104 gain on CICIoT2023 while costing 0.0573 on TON_IoT (around 6.0% in relative terms). We took this lopsided trade-off on purpose, in return for a single, interpretable, dataset-independent configuration that we can apply the same way across datasets.</p>
        <p><bold>Table 2</bold><bold>.</bold> Top-5 <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> configurations by grid search, per dataset.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Dataset</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>w</mml:mi>
                          <mml:mn>1</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>w</mml:mi>
                          <mml:mn>2</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>w</mml:mi>
                          <mml:mn>3</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mtext>mean</mml:mtext>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mtext>std</mml:mtext>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>Score</bold>
                </td>
              </tr>
              <tr>
                <td rowspan="5">CICIoT2023</td>
                <td>
                  <bold>0.8</bold>
                </td>
                <td>
                  <bold>0.1</bold>
                </td>
                <td>
                  <bold>0.1</bold>
                </td>
                <td>
                  <bold>0.9230</bold>
                </td>
                <td>
                  <bold>0.0112</bold>
                </td>
                <td>
                  <bold>0.9174</bold>
                </td>
              </tr>
              <tr>
                <td>0.7</td>
                <td>0.1</td>
                <td>0.2</td>
                <td>0.9211</td>
                <td>0.0106</td>
                <td>0.9158</td>
              </tr>
              <tr>
                <td>0.6</td>
                <td>0.1</td>
                <td>0.3</td>
                <td>0.9193</td>
                <td>0.0105</td>
                <td>0.9141</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>0.1</td>
                <td>0.4</td>
                <td>0.9175</td>
                <td>0.0108</td>
                <td>0.9121</td>
              </tr>
              <tr>
                <td>0.4</td>
                <td>0.1</td>
                <td>0.5</td>
                <td>0.9157</td>
                <td>0.0115</td>
                <td>0.9099</td>
              </tr>
              <tr>
                <td rowspan="5">TON_IoT</td>
                <td>
                  <bold>0.8</bold>
                </td>
                <td>
                  <bold>0.1</bold>
                </td>
                <td>
                  <bold>0.1</bold>
                </td>
                <td>
                  <bold>0.9602</bold>
                </td>
                <td>
                  <bold>0.0081</bold>
                </td>
                <td>
                  <bold>0.9561</bold>
                </td>
              </tr>
              <tr>
                <td>0.7</td>
                <td>0.1</td>
                <td>0.2</td>
                <td>0.9547</td>
                <td>0.0083</td>
                <td>0.9505</td>
              </tr>
              <tr>
                <td>0.6</td>
                <td>0.1</td>
                <td>0.3</td>
                <td>0.9492</td>
                <td>0.0091</td>
                <td>0.9447</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>0.1</td>
                <td>0.4</td>
                <td>0.9437</td>
                <td>0.0103</td>
                <td>0.9385</td>
              </tr>
              <tr>
                <td>0.4</td>
                <td>0.1</td>
                <td>0.5</td>
                <td>0.9382</td>
                <td>0.0119</td>
                <td>0.9323</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The configuration <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , retained for deployment on CICIoT2023, achieves <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.9334 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mo> ≤ </mml:mo><mml:mn> 0.023 </mml:mn></mml:mrow></mml:math></inline-formula> , giving <inline-formula><mml:math><mml:mrow><mml:mtext> Score </mml:mtext><mml:mo> = </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mo> − </mml:mo><mml:mn> 0.5 </mml:mn><mml:mo> ⋅ </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mo> ≥ </mml:mo><mml:mn> 0.9219 </mml:mn></mml:mrow></mml:math></inline-formula> —above the tabulated top-1 Score of 0.9174. This configuration doesn’t belong to <bold>Table 2</bold> grid search: it’s a fixed design choice (Section 4.4), not a candidate we ranked, so lining it up directly against the top-5 entries above wouldn’t be fair.</p>
        <p>The sensitivity analysis shown for the CICIoT2023 and TON_IoT datasets through the search-space heatmaps (<xref ref-type="fig" rid="fig3">Figure 3</xref>), the look at how things vary around the optimum, and the ranking of the best configurations confirms that the temporal-stability component carries the most weight. Around the grid-search optimum (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.8 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> , <bold>Table 2</bold>), a progressive reduction of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> produces the sharpest decrease in the mean actionability score <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , indicating that the ability of the ARX-IoT framework to maximize <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is dominated by the temporal stability component <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . This trend is consistent across the two datasets, CICIoT2023 and TON_IoT, for which the grid search converges to the same optimum. The framework nonetheless retains the configuration <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> rather than this statistical optimum, so as to weight model confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and conflict regulation <inline-formula><mml:math><mml:mrow><mml:mtext> Γ </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> more heavily relative to raw temporal stability, and to preserve a single, dataset-independent operating point (Section 4.4). Finally, the low variability observed across scenarios in the grid search (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mo> ≤ </mml:mo><mml:mn> 0.023 </mml:mn></mml:mrow></mml:math></inline-formula> ) indicates good stability of the framework’s behavior across application domains.</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId369.jpeg?20261027032115" />
        </fig>
        <p>(a)</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId370.jpeg?20261027032114" />
        </fig>
        <p>(b)</p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId371.jpeg?20261027032114" />
        </fig>
        <p>(c)</p>
        <fig id="fig12">
          <label>Figure 12</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId372.jpeg?20261027032114" />
        </fig>
        <p>(d)</p>
        <fig id="fig13">
          <label>Figure 13</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId373.jpeg?20261027032114" />
        </fig>
        <p>(e)</p>
        <fig id="fig14">
          <label>Figure 14</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId374.jpeg?20261027032114" />
        </fig>
        <p>(f)</p>
        <p><bold>Figure 3</bold><bold>.</bold> (a) Hyperparameter grid search on CICIoT2023. (b) Sensitivity analysis around the CICIoT2023 optimum. (c) Ranking of the best CICIoT2023 configurations. (d) Hyperparameter grid search on TON_IoT. (e) Sensitivity analysis around the TON_IoT optimum. (f) Ranking of the best TON_IoT configurations.</p>
        <p>To select the optimal values of the regulation hyperparameters <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> ≡ </mml:mo><mml:mi> λ </mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> k </mml:mi><mml:mo> ≡ </mml:mo><mml:mi> β </mml:mi></mml:mrow></mml:math></inline-formula> , a second, distinct composite score <inline-formula><mml:math><mml:mi> S </mml:mi></mml:math></inline-formula> is defined to jointly evaluate predictive performance and explanation quality—separate from the criterion <inline-formula><mml:math><mml:mrow><mml:mtext> Score </mml:mtext><mml:mo> = </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> mean </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> P </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:mn> 0.5 </mml:mn><mml:msub><mml:mi> A </mml:mi><mml:mrow><mml:mtext> std </mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> P </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> used above to select <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD23">
          <label>(18)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>S</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>A</mml:mi>
                <mml:mrow>
                  <mml:mtext>mean</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:mn>0.3</mml:mn>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mrow>
                  <mml:mtext>std</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:mn>0.2</mml:mn>
              <mml:msub>
                <mml:mi>A</mml:mi>
                <mml:mrow>
                  <mml:mtext>std</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The coefficients 0.3 and 0.2 jointly penalize dispersion in the conflict coefficient and in the actionability score, consistent with the objective of favoring stable, low-variance explanatory behavior.</p>
        <p>Unlike <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , the composite score <italic>S</italic> isn’t inherently confined to [0, 1], because it’s defined as an aggregate criterion that blends several normalized components with potentially different scaling and dispersion. Normalizing the individual terms doesn’t mean their weighted sum has to stay inside the unit interval. So, a value just above one, such as <italic>S</italic> = 1.004, is mathematically fine and shouldn’t be read as a normalization error. Rather, it tells us that the configuration in question reaches a combined performance a touch above the reference level set by the normalization and aggregation scheme we adopted. This reading fits what S is for, namely ranking configurations by their relative overall quality rather than standing for an absolute probability or proportion. An exhaustive grid search resting solely on the mean agreement precision <italic>A</italic><sub>mean</sub> (<xref ref-type="fig" rid="fig4">Figure 4(a)</xref>) would flag the configuration (<italic>p</italic> = 0.5, <italic>k</italic> = 0.5) as best, at a value of 0.986. But once we fold in stability and robustness through the composite score <italic>S</italic> (<xref ref-type="fig" rid="fig4">Figure 4(b)</xref>), the ranking of the evaluated configurations shifts. The response-surface analysis shows that the highest composite score (<italic>S</italic> = 1.004) lands on the configuration (<italic>p</italic> = 0.5, <italic>k</italic> = 1.0) (<xref ref-type="fig" rid="fig4">Figure 4(b)</xref>), which strikes the best balance between agreement precision, explanation stability, and overall robustness. On that basis, the configuration (<italic>p</italic> = 0.5, <italic>k</italic> = 1.0) was kept as a single, dataset-independent operating point for all experiments reported in this article.</p>
        <p><bold>Table 3</bold><bold>.</bold> Top-5 (<italic>p</italic>, <italic>k</italic>) configurations by grid search, per dataset, including <italic>C</italic><sub>std</sub> (Equation (18)).</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Dataset</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>p</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:mo>=</mml:mo>
                            <mml:mi>λ</mml:mi>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>k</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:mo>=</mml:mo>
                            <mml:mi>β</mml:mi>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mtext>std</mml:mtext>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mtext>mean</mml:mtext>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>A</mml:mi>
                          <mml:mrow>
                            <mml:mtext>std</mml:mtext>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>
                    <bold>S</bold>
                  </italic>
                </td>
              </tr>
              <tr>
                <td rowspan="5">CICIoT2023</td>
                <td>
                  <bold>0.5</bold>
                </td>
                <td>
                  <bold>1.0</bold>
                </td>
                <td>
                  <bold>0.0889</bold>
                </td>
                <td>
                  <bold>0.9780</bold>
                </td>
                <td>
                  <bold>0.0036</bold>
                </td>
                <td>
                  <bold>1.0040</bold>
                </td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>1.5</td>
                <td>0.1027</td>
                <td>0.9728</td>
                <td>0.0039</td>
                <td>1.0028</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>0.5</td>
                <td>0.0582</td>
                <td>0.9855</td>
                <td>0.0026</td>
                <td>1.0025</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>2.0</td>
                <td>0.1061</td>
                <td>0.9691</td>
                <td>0.0039</td>
                <td>1.0001</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>2.5</td>
                <td>0.1035</td>
                <td>0.9663</td>
                <td>0.0037</td>
                <td>0.9966</td>
              </tr>
              <tr>
                <td rowspan="5">TON_IoT</td>
                <td>
                  <bold>0.5</bold>
                </td>
                <td>
                  <bold>0.5</bold>
                </td>
                <td>
                  <bold>0.0273</bold>
                </td>
                <td>
                  <bold>0.9765</bold>
                </td>
                <td>
                  <bold>0.0011</bold>
                </td>
                <td>
                  <bold>0.9844</bold>
                </td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>1.0</td>
                <td>0.0354</td>
                <td>0.9673</td>
                <td>0.0013</td>
                <td>0.9777</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>1.5</td>
                <td>0.0345</td>
                <td>0.9621</td>
                <td>0.0012</td>
                <td>0.9722</td>
              </tr>
              <tr>
                <td>1.0</td>
                <td>0.5</td>
                <td>0.0273</td>
                <td>0.9624</td>
                <td>0.0019</td>
                <td>0.9702</td>
              </tr>
              <tr>
                <td>0.5</td>
                <td>2.0</td>
                <td>0.0300</td>
                <td>0.9590</td>
                <td>0.0010</td>
                <td>0.9678</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <fig id="fig15">
          <label>Figure 15</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId401.jpeg?20261027032114" />
        </fig>
        <p>(a)</p>
        <fig id="fig16">
          <label>Figure 16</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId402.jpeg?20261027032113" />
        </fig>
        <p>(b)</p>
        <p><bold>Figure 4</bold><bold>.</bold> (a) Composite-score optimization surface using the mean-agreement criterion. (b) Composite-score optimization surface using the composite criterion.</p>
        <p>This grid search is conducted independently on each dataset (<bold>Table 3</bold>): the same values, <italic>p</italic> = 0.5 and <italic>k</italic> = 1.0, correspond to the composite-score optimum on CICIoT2023 (<italic>A</italic><sub>mean</sub> = 0.9780, <italic>C</italic><sub>std</sub> = 0.0889, <italic>S</italic> = 1.0040), whereas the composite-score optimum on TON_IoT is reached at <italic>p</italic> = 0.5, <italic>k</italic> = 0.5 (<italic>A</italic><sub>mean</sub> = 0.9765, <italic>C</italic><sub>std</sub> = 0.0273, <italic>S</italic> = 0.9844). As with (<italic>w</italic><sub>1</sub>, <italic>w</italic><sub>2</sub>, <italic>w</italic><sub>3</sub>), the configuration (<italic>p</italic> = 0.5, <italic>k</italic> = 1.0) is retained across both datasets for consistency, rather than re-tuning <italic>k</italic> per dataset.</p>
      </sec>
      <sec id="sec4dot5">
        <title>4.5. Quantification of Explanatory Conflict</title>
        <p>The probabilistic representation lets us put a number on the disagreement between TimeSHAP and Anchors through the total variation distance <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . On CICIoT2023, this gives <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.538 </mml:mn></mml:mrow></mml:math></inline-formula> , which maps to a conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.554 </mml:mn></mml:mrow></mml:math></inline-formula> at the adapted sensitivity <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> ≈ </mml:mo><mml:mn> 1.5 </mml:mn></mml:mrow></mml:math></inline-formula> that the online feedback loop settles on (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> next </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 1.4999 </mml:mn></mml:mrow></mml:math></inline-formula> , <bold>Table 6</bold>), rather than the starting value <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p>On both datasets, the online feedback loop reliably converges to a sensitivity value inside the range <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1.5 </mml:mn></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> next </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 1.0001 </mml:mn></mml:mrow></mml:math></inline-formula> on TON_IoT and 1.4999 on CICIoT2023), which tells us this interval is the effective operating range of the adaptive mechanism for the traffic patterns we look at in this study. As <xref ref-type="fig" rid="fig5">Figure 5(a)</xref> shows, this conflict is driven mainly by the IAT variable, whose own contribution reaches <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:msub><mml:mi> ϕ </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> − </mml:mo><mml:msub><mml:mi> b </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> | </mml:mo></mml:mrow><mml:mo> ≈ </mml:mo><mml:mn> 0.123 </mml:mn></mml:mrow></mml:math></inline-formula> , more than five times the average divergence seen for the other features. <xref ref-type="fig" rid="fig5">Figure 5(b)</xref> goes further, showing that the divergence comes both from disagreement over which variables the two methods pick and from disagreement over the relative importance they place on them.</p>
        <fig id="fig17">
          <label>Figure 17</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId423.jpeg?20261027032115" />
        </fig>
        <p>(a)</p>
        <fig id="fig18">
          <label>Figure 18</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId424.jpeg?20261027032115" />
        </fig>
        <p>(b)</p>
        <p><bold>Figure 5</bold><bold>.</bold> (a) Per-feature divergence between TimeSHAP and Anchors on CICIoT2023. (b) Selected-feature agreement between TimeSHAP and Anchors on CICIoT2023.</p>
        <p>In contrast, on TON_IoT, while both methods highlight system-level identifiers such as type_normal, TimeSHAP concentrates a major part of its attribution on this single feature (≈0.50), whereas Anchors distributes its activation conditions across a broader set of features (including source addresses and attack-type variables). This structural difference in feature coverage leads to a total variation distance <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.9822 </mml:mn></mml:mrow></mml:math></inline-formula> , corresponding to a conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.6255 </mml:mn></mml:mrow></mml:math></inline-formula> (for <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 1.0001 </mml:mn></mml:mrow></mml:math></inline-formula> ). As synthesized in <xref ref-type="fig" rid="fig6">Figure 6</xref> and <bold>Table 6</bold>, <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> clearly differentiates the conflict profile of CICIoT2023 (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.5539 </mml:mn></mml:mrow></mml:math></inline-formula> ) from that of TON_IoT (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.6255 </mml:mn></mml:mrow></mml:math></inline-formula> ), confirming the ability of ARX-IoT to objectively quantify inter-method explanatory disagreements across varied IoT traffic conditions.</p>
        <p>We define an erroneous mitigation decision on an observable, test-set basis. For a given test-set window, a mitigation decision is recorded whenever the graduated policy <inline-formula><mml:math><mml:mrow><mml:mi> π </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (Section 3.7) would trigger or suspend an action. An error occurs if an action is triggered during a normal traffic window (false positive) or if no action is triggered during an attack window (false negative). The mitigation-risk values below are therefore an estimated proxy grounded in the observable outcomes defined above, not a causally identified empirical reduction in the strict sense.</p>
        <p><xref ref-type="fig" rid="fig6">Figure 6</xref> also synthesizes these two scenarios by presenting the main ARX-IoT metrics, including the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , the actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , and their associated indicators. The results show that <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> clearly distinguishes </p>
        <fig id="fig19">
          <label>Figure 19</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId445.jpeg?20261027032115" />
        </fig>
        <p>(a)</p>
        <fig id="fig20">
          <label>Figure 20</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId446.jpeg?20261027032115" />
        </fig>
        <p>(b)</p>
        <p><bold>Figure 6</bold><bold>.</bold> (a) Quantitative evaluation of ARX-IoT key metrics on CICIoT2023. (b) Quantitative evaluation of ARX-IoT key metrics on TON_IoT.</p>
        <p>a moderate-conflict situation on CICIoT2023 (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.554 </mml:mn></mml:mrow></mml:math></inline-formula> ) from a high-conflict situation on TON_IoT (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.626 </mml:mn></mml:mrow></mml:math></inline-formula> ). In particular, the conflict level on TON_IoT exceeds the critical threshold of 0.60, thereby activating the veto mechanism and shifting the decision policy toward human review. These results confirm the ability of ARX-IoT to objectively quantify inter-method explanatory disagreement and adapt the level of automation accordingly.</p>
      </sec>
      <sec id="sec4dot6">
        <title>4.6. Veto Mechanism and Decision Policy</title>
        <p>To properly evaluate the risk reduction provided by the veto mechanism <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , it is essential to distinguish between nominal classification risk and operational mitigation risk under explanatory uncertainty:</p>
        <p><bold>Nomina</bold><bold>l Baseline Risk (0.150):</bold> Represents the intrinsic classification error rate of the unmonitored IDS model operating under standard, non-conflicting traffic conditions without XAI verification. <bold>Unregul</bold><bold>ated Risk under Conflict (0.427):</bold> When explanatory conflicts arise between TimeSHAP and Anchors, hidden decision uncertainty increases sharply. If the system continues to execute automated mitigations without ARX-IoT regulation, the risk of triggering inappropriate countermeasures reaches 0.427. <bold>ARX-I</bold><bold>oT Regulated Risk (0.313):</bold> By applying the probabilistic veto factor <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , ARX-IoT detects severe explanatory contradictions and suspends automated decisions. This regulatory filter reduces the mitigation risk under conflict from 0.427 down to 0.313 on CICIoT2023, a 26.7% relative reduction in erroneous mitigation decisions compared with the unregulated system under conflict. On TON_IoT, the same mechanism reduces the mitigation risk from 0.463 to 0.413, a 10.8% relative reduction. While the absolute mitigation risk remains non-zero due to intrinsic dataset noise and feature-attribution variance, the 10.8% - 26.7% range is more representative of the mechanism’s effect across heterogeneous IoT traffic. </p>
        <p>While the regulated risk (0.313) remains above the ideal baseline (0.150) due to the inherent noise and ambiguity of conflicting traffic instances, the veto mechanism successfully acts as a safety barrier that prevents catastrophic automated actions during periods of high XAI disagreement.</p>
        <p>The decision policy <inline-formula><mml:math><mml:mrow><mml:mi> π </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , defined in Section 3.9, partitions the decision space into three operational zones bounded by <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> (<xref ref-type="fig" rid="fig7">Figure 7</xref> and <xref ref-type="fig" rid="fig8">Figure 8</xref>).</p>
        <p><bold>On C</bold><bold>ICIoT2023:</bold> With an actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.933 </mml:mn></mml:mrow></mml:math></inline-formula> and a moderate conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.554 </mml:mn><mml:mo> &lt; </mml:mo><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , the system operates in the Automatic Mitigation zone, consistently with the decision rule <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> &lt; </mml:mo><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . <bold>On</bold><bold>TON_IoT</bold><bold>:</bold> Although the actionability score is high (<inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.903 </mml:mn><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> ), the severe explanatory conflict <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.626 </mml:mn></mml:mrow></mml:math></inline-formula> exceeds <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> . This conflict override forces the policy into the Veto/Human Review regime, successfully preventing automated mitigation under high explanatory contradiction. </p>
        <p>These results confirm that the decision thresholds defined in ARX-IoT allow the degree of automation to be adapted to the level of conflict observed between explainability methods.</p>
        <fig id="fig21">
          <label>Figure 21</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId477.jpeg?20261027032119" />
        </fig>
        <p>(a)</p>
        <fig id="fig22">
          <label>Figure 22</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId478.jpeg?20261027032118" />
        </fig>
        <p>(b)</p>
        <p><bold>Figure 7</bold><bold>.</bold> (a) Decision zones of ARX-IoT on CICIoT2023. (b) Regulation dynamics of ARX-IoT on CICIoT2023.</p>
        <fig id="fig23">
          <label>Figure 23</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId479.jpeg?20261027032118" />
        </fig>
        <p>(a)</p>
        <fig id="fig24">
          <label>Figure 24</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId480.jpeg?20261027032118" />
        </fig>
        <p>(b)</p>
        <p><bold>Figure 8</bold><bold>.</bold> (a) Decision zones of ARX-IoT on TON_IoT. (b) Regulation dynamics of ARX-IoT on TON_IoT.</p>
        <p><xref ref-type="fig" rid="fig8">Figure 8</xref> presents the corresponding decision zones and regulation dynamics for TON_IoT.</p>
      </sec>
      <sec id="sec4dot7">
        <title>4.7. Temporal Dynamics of the Feedback Loop</title>
        <p><xref ref-type="fig" rid="fig9">Figure 9</xref> and <xref ref-type="fig" rid="fig10">Figure 10</xref> illustrate the dynamic behavior of the ARX-IoT adaptive mechanism over 30 iterations, evaluated respectively on the TON_IoT and CICIoT2023 datasets. On TON_IoT (<xref ref-type="fig" rid="fig9">Figure 9</xref>), the parameter <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> climbs gradually from its starting value of 1.000 and settles around <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> ≈ </mml:mo><mml:mn> 1.0022 </mml:mn></mml:mrow></mml:math></inline-formula> . This shift reflects the system tuning its own sensitivity to make up for drops in the observed causal effect <inline-formula><mml:math><mml:mrow><mml:mtext> Δ </mml:mtext><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as it drifts away from the target threshold <inline-formula><mml:math><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.02 </mml:mn></mml:mrow></mml:math></inline-formula> . On CICIoT2023 (<xref ref-type="fig" rid="fig10">Figure 10</xref>), by contrast, <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> eases steadily down from its starting value of 1.500 to <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> ≈ </mml:mo><mml:mn> 1.497 </mml:mn></mml:mrow></mml:math></inline-formula> , which reflects a gradual dialing-back of sensitivity while the causal effect stays stubbornly above the target.</p>
        <fig id="fig25">
          <label>Figure 25</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId493.jpeg?20261027032121" />
        </fig>
        <p>(a)</p>
        <fig id="fig26">
          <label>Figure 26</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId494.jpeg?20261027032121" />
        </fig>
        <p>(b)</p>
        <fig id="fig27">
          <label>Figure 27</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId495.jpeg?20261027032121" />
        </fig>
        <p>(c)</p>
        <fig id="fig28">
          <label>Figure 28</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId496.jpeg?20261027032121" />
        </fig>
        <p>(d)</p>
        <p><bold>Figure 9</bold><bold>.</bold> (a) Evolution of the sensitivity parameter on TON_IoT. (b) Regulation factor and actionability score on TON_IoT. (c) Evolution of the conflict coefficient on TON_IoT. (d) Causal effect of actions on TON_IoT.</p>
        <p>At the same time, the other internal metrics stay remarkably steady, which speaks to the robustness of the feedback loop. On TON_IoT, the conflict level <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> stays high, around 0.626, consistently topping the alert threshold set at 0.60, while the regulation factor <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and the actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> hold steady at roughly 0.730 and 0.903. On CICIoT2023, the conflict stays more moderate, around 0.554, with regulation and actionability settling at about 0.758 and 0.933. In both cases, even though the causal effect <inline-formula><mml:math><mml:mrow><mml:mtext> Δ </mml:mtext><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> moves within the intervals <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 0.0126 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.0227 </mml:mn></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 0.0177 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.0265 </mml:mn></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , respectively, it stays broadly centered on the target <inline-formula><mml:math><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.02 </mml:mn></mml:mrow></mml:math></inline-formula> . Taken together, these observations confirm that the adaptive model tunes its internal sensitivity well enough to keep its decision outputs stable, whatever the underlying dynamics of IoT attacks happen to be.</p>
        <fig id="fig29">
          <label>Figure 29</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId511.jpeg?20261027032121" />
        </fig>
        <p>(a)</p>
        <fig id="fig30">
          <label>Figure 30</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId512.jpeg?20261027032121" />
        </fig>
        <p>(b)</p>
        <fig id="fig31">
          <label>Figure 31</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId513.jpeg?20261027032121" />
        </fig>
        <p>(c)</p>
        <fig id="fig32">
          <label>Figure 32</label>
          <graphic xlink:href="https://html.scirp.org/file/2314004-rId514.jpeg?20261027032121" />
        </fig>
        <p>(d)</p>
        <p><bold>Figure 10</bold><bold>.</bold>(a) Evolution of the sensitivity parameter on CICIoT2023. (b) Regulation factor and actionability score on CICIoT2023. (c) Evolution of the conflict coefficient on CICIoT2023. (d) Causal effect of actions on CICIoT2023.</p>
      </sec>
      <sec id="sec4dot8">
        <title>4.8. Ablation Study</title>
        <p><bold>Table 4</bold> and <bold>Table 5</bold> present the results of the ablation study conducted on TON_IoT and CICIoT2023, respectively. For each dataset, the veto (<inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ), the stability (<inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ), the model confidence (<inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ), and the adaptive feedback (<inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ) are successively removed to evaluate the individual contribution of each component of the ARX-IoT framework. The rightmost column of <bold>Table 4</bold> and <bold>Table 5</bold>, labeled Inter-Method Confidence (<inline-formula><mml:math><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ), reports a distinct quantity from the model confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ablated in the “Without model confidence” row: <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the LSTM’s own predictive confidence (Equation (11)), whereas <inline-formula><mml:math><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> reflects the complementary agreement level between TimeSHAP and Anchors (Section 3.5) and is therefore unaffected by the <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> ablation, changing only when the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> itself changes (<italic>i.e.</italic>, in the “Without feedback <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> ” row).</p>
        <p>Overall, disabling the regulation factor (<inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ) leads to an artificial increase in the actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , demonstrating that the veto mechanism is essential to penalize severe inter-method disagreements.</p>
        <p>On TON_IoT, removing stability (<inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ) or the adaptive feedback (<inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> ) yields identical results to the complete ARX-IoT configuration (<inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.903 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.626 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.731 </mml:mn></mml:mrow></mml:math></inline-formula> ). This behavior isn’t an experimental artifact; it reflects two structural properties of the framework on this dataset:</p>
        <p><bold>Temporal Stability Near Unity:</bold> The intrinsic stability measured on TON_IoT is already near-perfect (<inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.9995 </mml:mn></mml:mrow></mml:math></inline-formula> , reported as 0.999 in <bold>Table 4</bold>). Forcing <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 1.000 </mml:mn></mml:mrow></mml:math></inline-formula> shifts things by less than 0.05%, which is mathematically negligible in the computation of <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> .<bold>Natural Equili</bold><bold>brium of Sensitivity</bold><inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula><bold>:</bold> As <bold>Table 5</bold> shows, the online gradient descent naturally converges to <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> next </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 1.0001 </mml:mn></mml:mrow></mml:math></inline-formula> on TON_IoT. Because the adaptive parameter lines up almost exactly with the default baseline (<inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mo> = </mml:mo><mml:mn> 1.0 </mml:mn></mml:mrow></mml:math></inline-formula> ), switching off the feedback loop leaves no measurable offset on <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . </p>
        <p><bold>Table 4</bold><bold>.</bold> Ablation study of ARX-IoT components on TON_IoT.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Configuration</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>A</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>C</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>Γ</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>S</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>1</mml:mn>
                        <mml:mo>−</mml:mo>
                        <mml:mi>C</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>ARX</bold>
                  <bold>-</bold>
                  <bold>IoT (complete)</bold>
                </td>
                <td>0.903</td>
                <td>0.626</td>
                <td>0.731</td>
                <td>0.999</td>
                <td>0.374</td>
              </tr>
              <tr>
                <td>
                  Without veto (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>Γ</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.957</td>
                <td>0.626</td>
                <td>1.000</td>
                <td>0.999</td>
                <td>0.374</td>
              </tr>
              <tr>
                <td>
                  Without stability (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>S</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.903</td>
                <td>0.626</td>
                <td>0.731</td>
                <td>1.000</td>
                <td>0.374</td>
              </tr>
              <tr>
                <td>
                  Without model confidence (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mtext>Co</mml:mtext>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.946</td>
                <td>0.626</td>
                <td>0.731</td>
                <td>0.999</td>
                <td>0.374</td>
              </tr>
              <tr>
                <td>
                  Without feedback
                  <inline-formula>
                    <mml:math>
                      <mml:mi>β</mml:mi>
                    </mml:math>
                  </inline-formula>
                  (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>β</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.903</td>
                <td>0.626</td>
                <td>0.731</td>
                <td>0.999</td>
                <td>0.374</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 5</bold><bold>.</bold> Ablation study of ARX-IoT components on CICIoT2023.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Configuration</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>A</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>C</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>Γ</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>S</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>1</mml:mn>
                        <mml:mo>−</mml:mo>
                        <mml:mi>C</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>ARX</bold>
                  <bold>-</bold>
                  <bold>IoT (complete)</bold>
                </td>
                <td>0.933</td>
                <td>0.554</td>
                <td>0.758</td>
                <td>0.999</td>
                <td>0.446</td>
              </tr>
              <tr>
                <td>
                  Without veto (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>Γ</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.982</td>
                <td>0.554</td>
                <td>1.000</td>
                <td>0.999</td>
                <td>0.446</td>
              </tr>
              <tr>
                <td>
                  Without stability (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>S</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.933</td>
                <td>0.554</td>
                <td>0.758</td>
                <td>1.000</td>
                <td>0.446</td>
              </tr>
              <tr>
                <td>
                  Without model confidence (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mtext>Co</mml:mtext>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.952</td>
                <td>0.554</td>
                <td>0.758</td>
                <td>0.999</td>
                <td>0.446</td>
              </tr>
              <tr>
                <td>
                  Without feedback
                  <inline-formula>
                    <mml:math>
                      <mml:mi>β</mml:mi>
                    </mml:math>
                  </inline-formula>
                  (
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>β</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  )
                </td>
                <td>0.944</td>
                <td>0.416</td>
                <td>0.812</td>
                <td>0.999</td>
                <td>0.584</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>On CICIoT2023, by contrast, where <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> moves from 1.0 to 1.5, turning off feedback causes a sharp drop in conflict detection (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> falls from 0.554 to 0.416), showing that the feedback loop works as a dynamic auto-calibration mechanism that steps in only when traffic variability calls for it.</p>
        <p>Although <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> doesn’t enter the formulation of the model confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> directly, taking away its feedback mechanism still reshapes the framework’s downstream decision dynamics. This indirect effect leads to an observed rise in <inline-formula><mml:math><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , from 0.446 to 0.584, under the ablation setting considered here.</p>
        <p>Removing the veto produces the biggest swings, which confirms it as the main decision-regulation mechanism. On CICIoT2023, actionability <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> climbs from 0.933 to 0.982, a 5.2% rise. That jump comes down to the moderate conflict level on this dataset (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.554 </mml:mn></mml:mrow></mml:math></inline-formula> ): by imposing a regulatory filter, the veto reins in actionability to keep things safe. On TON_IoT, where the conflict level runs higher, the veto’s direct effect on the actionability score stays in the same ballpark, with <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> moving from 0.903 to 0.957 (+6.0%). This tells us the veto works not just through the size of the actionability penalty but also through the decision policy, where the conflict threshold flatly overrides automated mitigation.</p>
        <p>Removing the adaptive feedback <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> reveals a complementary picture. On CICIoT2023, it only barely touches actionability (0.933 → 0.944) but sharply cuts the system’s ability to detect conflict (0.554 → 0.416), a 24.9% drop. On TON_IoT, by contrast, removing <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> brings no notable change in either <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , which stay at 0.903 and 0.626. What these observations tell us is that the feedback mechanism isn’t meant to improve the decision directly, but to tune the system’s sensitivity to explanatory divergence. It therefore plays a fine-tuning role in conflict measurement, especially handy in the trickiest scenarios.</p>
        <p>Finally, removing stability <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and model confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> moves things only slightly across all metrics. Their contribution thus looks confined to a fine-calibration role rather than serving as a central regulation lever. All in all, these results back up the architecture of the framework, in which the veto and the adaptive feedback handle the critical work, while stability and confidence chip in on the fine-grained adjustment of decisions.</p>
      </sec>
      <sec id="sec4dot9">
        <title>4.9. Synthesis of Key Metrics</title>
        <p><bold>Table 6</bold> synthesizes the final ARX-IoT metrics for both datasets, allowing a direct comparison of the decision regimes.</p>
        <p><bold>Table 6</bold><bold>.</bold> Synthesis of key ARX-IoT metrics.</p>
        <table-wrap id="tbl6">
          <label>Table 6</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Metric</bold>
                </td>
                <td>
                  <bold>CICIoT2023</bold>
                </td>
                <td>
                  <bold>TON_IoT</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>D</mml:mi>
                          <mml:mi>t</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(TVD)</bold>
                </td>
                <td>0.5382</td>
                <td>0.9822</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mi>t</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(Conflict)</bold>
                </td>
                <td>0.5539</td>
                <td>0.6255</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>Γ</mml:mi>
                          <mml:mi>t</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(Regulation)</bold>
                </td>
                <td>0.7581</td>
                <td>0.7314</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>t</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(Stability)</bold>
                </td>
                <td>0.9991</td>
                <td>0.9995</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <table-wrap id="tbl7">
          <label>Table 7</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>A</mml:mi>
                          <mml:mi>t</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(Actionability)</bold>
                </td>
                <td>0.9334</td>
                <td>0.9029</td>
              </tr>
              <tr>
                <td>
                  <bold>Decision</bold>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>π</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>Automatic mitigation</td>
                <td>Veto-human review</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>β</mml:mi>
                          <mml:mrow>
                            <mml:mi>n</mml:mi>
                            <mml:mi>e</mml:mi>
                            <mml:mi>x</mml:mi>
                            <mml:mi>t</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>1.4999</td>
                <td>1.0001</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>Δ</mml:mi>
                        <mml:mi>P</mml:mi>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  <bold>(</bold>
                  <bold>Causal</bold>
                  <bold>)</bold>
                </td>
                <td>0.0223</td>
                <td>0.0187</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Contrast of decision regimes</bold><inline-formula><mml:math><mml:mrow><mml:mi> π </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><bold>.</bold> The conflict levels stay fairly close (<inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.554 </mml:mn></mml:mrow></mml:math></inline-formula> versus 0.626), yet that small gap is what decides the regime: only TON_IoT’s <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> tops the veto threshold <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> . Actionability runs high on both datasets (<inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.933 </mml:mn></mml:mrow></mml:math></inline-formula> on CICIoT2023, 0.903 on TON_IoT), which confirms that, in this framework, it’s the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> rather than the actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> that mainly settles the choice between the Automatic Mitigation and Veto regimes. On CICIoT2023, with the corrected <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.9334 </mml:mn></mml:mrow></mml:math></inline-formula> , the system stays in the Automatic Mitigation zone, since <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.5539 </mml:mn><mml:mo> &lt; </mml:mo><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.60 </mml:mn></mml:mrow></mml:math></inline-formula> . On TON_IoT, the conflict crossing <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> forces a veto policy with human review, no matter how comparably high the actionability score is. This contrast holds together: the framework brings in human oversight whenever explanatory ambiguity crosses the critical threshold, however confident and exploitable the underlying model may otherwise look.</p>
        <p><bold>Regulatio</bold><bold>n and trade-off</bold><inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><bold>.</bold> With a single fixed value of <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> across both datasets (Equation (7)), the regulation coefficient <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> comes out similar in size on TON_IoT (0.731) and CICIoT2023 (0.758), tracking the similarly moderate conflict levels <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> on both datasets (0.626 and 0.554, respectively). This consistency confirms that a single, dataset-independent regulation strength is enough to produce an appropriately calibrated penalty: the veto mechanism doesn’t need re-tuning per dataset to stay effective, and the different decision outcomes (Automatic Migration on CICIoT2023, Veto on TON_IoT) come down to the conflict coefficient <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> relative to the threshold <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , not to any difference in regulation strength.</p>
        <p><bold>Adaptive feedback</bold><inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> next </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula><bold>.</bold> How <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mrow><mml:mtext> next </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> evolves also differs across datasets. On TON_IoT, it stays practically flat (1.0001), a sign that the initial calibration already fits well. On CICIoT2023, it climbs to 1.4999, reflecting a deliberate tweak of conflict sensitivity to better anticipate future shifts in this dataset.</p>
        <p><bold>Causal impact</bold><inline-formula><mml:math><mml:mrow><mml:mi> Δ </mml:mi><mml:mi> P </mml:mi></mml:mrow></mml:math></inline-formula><bold>.</bold> The causal variations stay small (0.0223 and 0.0187), confirming that the regulation ARX-IoT performs doesn’t meaningfully alter the distribution of predictions. The framework instead acts as a fine-grained safety filter, nudging the decision at the margin without distorting the behavior of the underlying model.</p>
      </sec>
      <sec id="sec4dot10">
        <title>4.10. Discussion</title>
        <p><bold>1) X</bold><bold>AI divergence as an uncertainty signal (O1).</bold> The experiments confirm the existence of a structural explanatory conflict between additive and symbolic approaches. Where TimeSHAP concentrates its probability mass on a single temporal variable (IAT, ≈0<italic>.</italic>19 for CICIoT2023), Anchors distributes its binary mask across morphological traffic criteria (syn_count, urg_count), ignoring TimeSHAP’s priorities. Measured by a total variation distance <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0.5382 </mml:mn></mml:mrow></mml:math></inline-formula> on CICIoT2023, this divergence demonstrates that a single, isolated XAI method offers a biased view. Unlike the state of the art, which treats such divergence as a failure, ARX-IoT exploits this disagreement as an uncertainty indicator to modulate the system’s conservatism.</p>
        <p><bold>2) Validation of the optimization and impact of the veto (O2, O4).</bold> The sensitivity analysis validates the multi-criteria configuration of the augmented actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> retained for the framework (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.2 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.7 </mml:mn></mml:mrow></mml:math></inline-formula> ), giving priority to model confidence <inline-formula><mml:math><mml:mrow><mml:mtext> Co </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> ), while the independent grid search identifies temporal stability <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as the dominant driver of the statistically optimal configuration (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.8 </mml:mn></mml:mrow></mml:math></inline-formula> , <bold>Table 2</bold>). The ablation study demonstrates the safeguard role of the veto mechanism <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> : its removal raises actionability from 0.933 to 0.982 (+5.2%) on CICIoT2023. The veto therefore effectively curbs automation under strong XAI contradiction, protecting infrastructures against erroneous countermeasures.</p>
        <p><bold>3) Dynamic regulation and causal robustness (O3).</bold> The feedback loop adapts properly to fluctuations: the regulation parameter <inline-formula><mml:math><mml:mrow><mml:mi> β </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> rises on TON_IoT to correct the drift from the target (<inline-formula><mml:math><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.02 </mml:mn></mml:mrow></mml:math></inline-formula> ) and falls on CICIoT2023 once the effect steadies. With the measured causal impact <inline-formula><mml:math><mml:mrow><mml:mtext> Δ </mml:mtext><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> staying marginal (&lt;0.023), ARX-IoT shows its topological neutrality: it leaves the detection performance of the underlying LSTM model untouched and works as a transparent peripheral filter.</p>
        <p><bold>4) Synthesis of decision regimes.</bold> The comparative analysis brings out two distinct decision regimes depending on the traffic environment. On CICIoT2023, the framework meets moderate conflict <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and regulation <inline-formula><mml:math><mml:mrow><mml:mi> Γ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> (0.55 and 0.76). With an actionability score <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> of 0.9334, the system takes an automatic mitigation regime, since <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> τ </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.80 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> &lt; </mml:mo><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> ; this business logic steers clear of the kind of over-cautiousness that would block the network for no good reason. On TON_IoT, conflict is comparable (0.62) but regulation is lower (0.73). Even with strong actionability at 0.9029, the sharp XAI contradiction triggers a veto regime that calls for human arbitration, putting maximum safety first in the face of explanatory ambiguity.</p>
        <p><bold>5) Limitations and perspectives.</bold> For all the results we obtained, this study has its limits. First, the evaluation of ARX-IoT leans on just two explainability methods, TimeSHAP and Anchors. While these two do represent complementary paradigms (additive and rule-based), trying it with other XAI methods, such as Integrated Gradients, DeepSHAP, or Layer-wise Relevance Propagation (LRP), would help gauge how general the framework really is. Second, mixing several explanatory methods carries extra computational cost that could hamper deployment in tightly constrained IoT environments; future work will look at trimming this overhead to keep real-time performance intact. Finally, the experiments ran on two benchmark datasets; validating on real IoT infrastructures and operational scenarios would help confirm how robust and generalizable ARX-IoT is. Beyond these technical extensions, wider adoption of ARX-IoT in operational settings would also gain from lining up its decision-regulation outputs with established practices for XAI-supported security decision-making, as Sahito <italic>et al</italic>. [<xref ref-type="bibr" rid="B27">27</xref>] discussed. Fourth, the experimental evaluation pits ARX-IoT against raw detection baselines (Random Forest, logistic regression) and against internal ablations of its own components, but stops short of a direct empirical comparison with the conflict-resolution frameworks covered in Section 2 (EXAGREE [<xref ref-type="bibr" rid="B5">5</xref>], Consensus Importance [<xref ref-type="bibr" rid="B6">6</xref>], XAI4C [<xref ref-type="bibr" rid="B8">8</xref>]).</p>
        <p>These methods pursue related but distinct objectives. EXAGREE focuses on <italic>a priori</italic> model selection, Consensus Importance performs post-hoc explanation aggregation, and XAI4C addresses operational conflict detection in O-RAN networks. None of these methods produces the continuous, closed-loop decision-regulation signal targeted by ARX-IoT. Consequently, a like-for-like empirical benchmark would require re-implementing each method within the same IoT decision-regulation setting.</p>
        <p>Fifth, the mitigation-risk reduction reported in Section 4.6 relies on an operational definition of “erroneous mitigation decision” grounded in observable test-set outcomes (action condition, ground-truth label mapping, and conflict-conditioned denominator, as specified in the revised Section 4.6). This quantity should be interpreted as an estimated proxy derived from the heuristic interventional model of Section 3.8 (Equations (12) - (13)), rather than as a formally identified causal reduction in the strict do-calculus sense.</p>
        <p>The contribution of ARX-IoT relative to these methods is therefore primarily conceptual and methodological. It is supported by the component ablation study presented in Section 4.8 rather than by a direct empirical benchmark. Establishing such a benchmark, for example, against a Consensus-Importance-style weighted aggregation or a static ensemble threshold using the same datasets and evaluation metrics is left for future work.</p>
        <p>More fundamentally, this study shows that conflict between explainability methods should no longer be regarded as a weakness of XAI techniques, but rather as an exploitable source of information for decision-making. This perspective constitutes a central scientific contribution of ARX-IoT. Whereas existing approaches primarily seek to produce a single explanation or to maximize the fidelity of an isolated method, ARX-IoT transforms disagreement between explanations into an adaptive regulation mechanism that automatically adjusts confidence, the level of automation, and the mitigation strategy.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Conclusions</title>
      <p>By pairing adaptive explainability with the cybersecurity of IoT architectures, this study confirms how useful the ARX-IoT framework is in tackling the limits of traditional XAI approaches. The results we obtained show that the framework meets the objectives we set at the start. On one side, ARX-IoT measures and regulates conflicts between explainers, notably between TimeSHAP and Anchors, by turning their divergence into an uncertainty signal that feeds into the actionability score. On the other hand, its dynamic feedback loop keeps it adapting continuously to traffic fluctuations without hurting the performance of the underlying detection model. Finally, the veto mechanism acts as a safeguard, cutting the risk of erroneous mitigation by 26.7% on CICIoT2023 and 10.8% on TON_IoT, and calling for human arbitration whenever explanatory ambiguity crosses the critical conflict threshold.</p>
      <p>These results open the way to a new approach to IoT cybersecurity, in which conflict between explanations is no longer perceived as a weakness but as a decision-making lever. Future work will focus on reducing the computational cost of the framework and integrating additional explainability methods, such as LIME or counterfactual approaches, to further strengthen the generality and robustness of the framework.</p>
    </sec>
    <sec id="sec6">
      <title>Funding Statement</title>
      <p>This research received no external funding from public, commercial, or not-for-profit funding agencies.</p>
    </sec>
    <sec id="sec7">
      <title>Code and Data Availability Statement</title>
      <p>CICIoT2023 [<xref ref-type="bibr" rid="B26">26</xref>] and TON_IoT [<xref ref-type="bibr" rid="B25">25</xref>] are publicly available benchmark datasets, cited in Section 3.12. The implementation of the ARX-IoT framework, including the data preprocessing pipeline, model training scripts, the conflict-quantification and regulation modules (<italic>D</italic>(<italic>t</italic>), <italic>C</italic>(<italic>t</italic>), Γ(<italic>t</italic>), <italic>A</italic>(<italic>t</italic>)), and the hyperparameter grid search code, will be made available in a public code repository upon acceptance of this manuscript.</p>
    </sec>
    <sec id="sec8">
      <title>Acknowledgements</title>
      <p>The authors thank the Unité Mixte de Recherche et d’Innovation en Mathématiques et Sciences du Numérique (MSN), Institut National Polytechnique Félix Houphouët-Boigny (INP-HB), and the Université Virtuelle de Côte d’Ivoire (UVCI) for their institutional support.</p>
    </sec>
    <sec id="sec9">
      <title>Author Contributions</title>
      <p>Conceptualization, E.O.T. and S.O.; methodology, E.O.T. and A.F.A.; software, E.O.T.; validation, E.O.T., A.F.A. and B.H.K.; formal analysis, E.O.T. and B.H.K.; investigation, E.O.T.; resources, S.O.; data curation, E.O.T.; writing original draft preparation, E.O.T.; writing review and editing, A.F.A., B.H.K. and S.O.; visualization, E.O.T.; supervision, S.O.; project administration, S.O.; funding acquisition, S.O. All authors have read and agreed to the published version of the manuscript.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Arreche, O., Guntur, T.R., Roberts, J.W. and Abdallah, M. (2024) E-XAI: Evaluating Black-Box Explainable AI Frameworks for Network Intrusion Detection. <italic>IEEE Acc</italic><italic>ess</italic>, 12, 23954-23988. https://doi.org/10.1109/access.2024.3365140 <pub-id pub-id-type="doi">10.1109/access.2024.3365140</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2024.3365140">https://doi.org/10.1109/access.2024.3365140</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Arreche, O.</string-name>
              <string-name>Guntur, T.R.</string-name>
              <string-name>Roberts, J.W.</string-name>
              <string-name>Abdallah, M.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>E-XAI: Evaluating Black-Box Explainable AI Frameworks for Network Intrusion Detection</article-title>
            <source>IEEE Access</source>
            <volume>12</volume>
            <pub-id pub-id-type="doi">10.1109/access.2024.3365140</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Sharma, B., Sharma, L., Lal, C. and Roy, S. (2024) Explainable Artificial Intelligence for Intrusion Detection in IoT Networks: A Deep Learning Based Approach. <italic>Expert</italic><italic>Systems with Applications</italic>, 238, Article ID: 121751. https://doi.org/10.1016/j.eswa.2023.121751 <pub-id pub-id-type="doi">10.1016/j.eswa.2023.121751</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2023.121751">https://doi.org/10.1016/j.eswa.2023.121751</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Sharma, B.</string-name>
              <string-name>Sharma, L.</string-name>
              <string-name>Lal, C.</string-name>
              <string-name>Roy, S.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Explainable Artificial Intelligence for Intrusion Detection in IoT Networks: A Deep Learning Based Approach</article-title>
            <source>Expert Systems with Applications</source>
            <volume>238</volume>
            <fpage>121751</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.eswa.2023.121751</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Kumar, A. and Thing, V.L.L. (2024) Evaluating the Explainability of State-of-the-Art Deep Learning-Based Network Intrusion Detection Systems. arXiv: 2408.14040.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Kumar, A.</string-name>
              <string-name>Thing, V.L.L.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Evaluating the Explainability of State-of-the-Art Deep Learning-Based Network Intrusion Detection Systems</article-title>
            <fpage>2408</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Panopoulos, I., Bartsioka, M.A., Nikolaidis, S., Venieris, S.I., Kaklamani, D.I. and Venieris, I.S. (2025) Dynamic Temporal Positional Encodings for Early Intrusion Detection in IoT. 2025 10 <italic>th International Conference on Smart and Sustainable Tec</italic><italic>hnologies</italic> ( <italic>SpliTech</italic>), Bol and Split, 16-20 June 2025, 1-6. https://doi.org/10.23919/splitech65624.2025.11091651 <pub-id pub-id-type="doi">10.23919/splitech65624.2025.11091651</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.23919/splitech65624.2025.11091651">https://doi.org/10.23919/splitech65624.2025.11091651</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Panopoulos, I.</string-name>
              <string-name>Bartsioka, M.A.</string-name>
              <string-name>Nikolaidis, S.</string-name>
              <string-name>Venieris, S.I.</string-name>
              <string-name>Kaklamani, D.I.</string-name>
              <string-name>Venieris, I.S.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Dynamic Temporal Positional Encodings for Early Intrusion Detection in IoT</article-title>
            <source>2025 10th International Conference on Smart and Sustainable Technologies (SpliTech)</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.23919/splitech65624.2025.11091651</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Li, S., Liu, T., Deng, Q. and Barnard, A.S. (2024) EXAGREE: Mitigating Explanatory Disagreements with Stakeholder-Aligned Models. arXiv: 2411.01956.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Li, S.</string-name>
              <string-name>Liu, T.</string-name>
              <string-name>Deng, Q.</string-name>
              <string-name>Barnard, A.S.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>EXAGREE: Mitigating Explanatory Disagreements with Stakeholder-Aligned Models</article-title>
            <fpage>2411</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Parashar, G., Chaudhary, A. and Pandey, D. (2026) Quantifying Overall Agreement between Explanation Methods to Address the Disagreement Problem. <italic>Evolutionary</italic><italic>Intelligence</italic>, 19, Article No. 27. https://doi.org/10.1007/s12065-026-01145-y <pub-id pub-id-type="doi">10.1007/s12065-026-01145-y</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s12065-026-01145-y">https://doi.org/10.1007/s12065-026-01145-y</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Parashar, G.</string-name>
              <string-name>Chaudhary, A.</string-name>
              <string-name>Pandey, D.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Quantifying Overall Agreement between Explanation Methods to Address the Disagreement Problem</article-title>
            <source>Evolutionary Intelligence</source>
            <volume>19</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1007/s12065-026-01145-y</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Singh, R., Miller, T., Lyons, H., Sonenberg, L., Velloso, E., Vetere, F., <italic>et al</italic>. (2023) Directive Explanations for Actionable Explainability in Machine Learning Applications. <italic>ACM Transactions on Interactive Intelligent Systems</italic>, 13, 1-26. https://doi.org/10.1145/3579363 <pub-id pub-id-type="doi">10.1145/3579363</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3579363">https://doi.org/10.1145/3579363</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Singh, R.</string-name>
              <string-name>Miller, T.</string-name>
              <string-name>Lyons, H.</string-name>
              <string-name>Sonenberg, L.</string-name>
              <string-name>Velloso, E.</string-name>
              <string-name>Vetere, F.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Directive Explanations for Actionable Explainability in Machine Learning Applications</article-title>
            <source>ACM Transactions on Interactive Intelligent Systems</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1145/3579363</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Varshney, N., Mungari, F., Puligheddu, C., Badawy, A. and Chiasserini, C.F. (2025) XAI4C: An XAI-Powered Conflict Detection Framework in O-RAN. 2025 <italic>IEEE</italic> 22 <italic>nd Internat</italic><italic>ional Conference on Mobile Ad</italic>- <italic>Hoc and Smart Systems</italic> ( <italic>MASS</italic>), Chicago, 6-8 October 2025, 45-50. https://doi.org/10.1109/mass66014.2025.00020 <pub-id pub-id-type="doi">10.1109/mass66014.2025.00020</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/mass66014.2025.00020">https://doi.org/10.1109/mass66014.2025.00020</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Varshney, N.</string-name>
              <string-name>Mungari, F.</string-name>
              <string-name>Puligheddu, C.</string-name>
              <string-name>Badawy, A.</string-name>
              <string-name>Chiasserini, C.F.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>XAI4C: An XAI-Powered Conflict Detection Framework in O-RAN</article-title>
            <source>2025 IEEE 22nd International Conference on Mobile Ad-Hoc and Smart Systems (MASS)</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/mass66014.2025.00020</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Morrison, K., Spitzer, P., Turri, V., Feng, M., Kühl, N. and Perer, A. (2024) The Impact of Imperfect XAI on Human-AI Decision-Making. <italic>Proceedings of the ACM on</italic><italic>Human</italic>- <italic>Computer Interaction</italic>, 8, 1-39. https://doi.org/10.1145/3641022 <pub-id pub-id-type="doi">10.1145/3641022</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3641022">https://doi.org/10.1145/3641022</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Morrison, K.</string-name>
              <string-name>Spitzer, P.</string-name>
              <string-name>Turri, V.</string-name>
              <string-name>Feng, M.</string-name>
              <string-name>Perer, A.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>The Impact of Imperfect XAI on Human-AI Decision-Making</article-title>
            <source>Proceedings of the ACM on Human-Computer Interaction</source>
            <volume>8</volume>
            <pub-id pub-id-type="doi">10.1145/3641022</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Ogunseyi, T.B., Thiyagarajan, G., He, H., Bist, V. and Du, Z. (2026) Performance Analysis of Explainable Deep Learning-Based Intrusion Detection Systems for IoT Networks: A Systematic Review. <italic>Sensors</italic>, 26, Article 363. https://doi.org/10.3390/s26020363 <pub-id pub-id-type="doi">10.3390/s26020363</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s26020363">https://doi.org/10.3390/s26020363</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Ogunseyi, T.B.</string-name>
              <string-name>Thiyagarajan, G.</string-name>
              <string-name>He, H.</string-name>
              <string-name>Bist, V.</string-name>
              <string-name>Du, Z.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Performance Analysis of Explainable Deep Learning-Based Intrusion Detection Systems for IoT Networks: A Systematic Review</article-title>
            <source>Sensors</source>
            <volume>26</volume>
            <elocation-id>363</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s26020363</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dib, L. and Capus, L. (2025) Classifying XAI Methods to Resolve Conceptual Ambiguity. <italic>Technologies</italic>, 13, Article 390. https://doi.org/10.3390/technologies13090390 <pub-id pub-id-type="doi">10.3390/technologies13090390</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/technologies13090390">https://doi.org/10.3390/technologies13090390</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dib, L.</string-name>
              <string-name>Capus, L.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Classifying XAI Methods to Resolve Conceptual Ambiguity</article-title>
            <source>Technologies</source>
            <volume>13</volume>
            <elocation-id>390</elocation-id>
            <pub-id pub-id-type="doi">10.3390/technologies13090390</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Bento, J., Saleiro, P., Cruz, A.F., Figueiredo, M.A.T. and Bizarro, P. (2021) TimeSHAP: Explaining Recurrent Models through Sequence Perturbations. <italic>Proceedings of the</italic>27 <italic>th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</italic>, 14-18 August 2021, 2565-2573. https://doi.org/10.1145/3447548.3467166 <pub-id pub-id-type="doi">10.1145/3447548.3467166</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3447548.3467166">https://doi.org/10.1145/3447548.3467166</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Bento, J.</string-name>
              <string-name>Saleiro, P.</string-name>
              <string-name>Cruz, A.F.</string-name>
              <string-name>Figueiredo, M.A.T.</string-name>
              <string-name>Bizarro, P.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>TimeSHAP: Explaining Recurrent Models through Sequence Perturbations</article-title>
            <source>Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
            <volume>14</volume>
            <pub-id pub-id-type="doi">10.1145/3447548.3467166</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ribeiro, M.T., Singh, S. and Guestrin, C. (2018) Anchors: High-Precision Model-Agnostic Explanations. <italic>Proceedings of the AAAI Conference on Artificial Int</italic><italic>elligence</italic>, 32, 1527-1535. https://doi.org/10.1609/aaai.v32i1.11491 <pub-id pub-id-type="doi">10.1609/aaai.v32i1.11491</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1609/aaai.v32i1.11491">https://doi.org/10.1609/aaai.v32i1.11491</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ribeiro, M.T.</string-name>
              <string-name>Singh, S.</string-name>
              <string-name>Guestrin, C.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Anchors: High-Precision Model-Agnostic Explanations</article-title>
            <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
            <volume>32</volume>
            <pub-id pub-id-type="doi">10.1609/aaai.v32i1.11491</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, Z., Hamadi, H.A., Damiani, E., Yeun, C.Y. and Taher, F. (2022) Explainable Artificial Intelligence Applications in Cyber Security: State-of-the-Art in Research. <italic>IEEE Access</italic>, 10, 93104-93139. https://doi.org/10.1109/access.2022.3204051 <pub-id pub-id-type="doi">10.1109/access.2022.3204051</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2022.3204051">https://doi.org/10.1109/access.2022.3204051</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, Z.</string-name>
              <string-name>Hamadi, H.A.</string-name>
              <string-name>Damiani, E.</string-name>
              <string-name>Yeun, C.Y.</string-name>
              <string-name>Taher, F.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Explainable Artificial Intelligence Applications in Cyber Security: State-of-the-Art in Research</article-title>
            <source>IEEE Access</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/access.2022.3204051</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Arreche, O., Guntur, T. and Abdallah, M. (2024) XAI-IDS: Toward Proposing an Explainable Artificial Intelligence Framework for Enhancing Network Intrusion Detection Systems. <italic>Applied Sciences</italic>, 14, Article 4170. https://doi.org/10.3390/app14104170 <pub-id pub-id-type="doi">10.3390/app14104170</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app14104170">https://doi.org/10.3390/app14104170</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Arreche, O.</string-name>
              <string-name>Guntur, T.</string-name>
              <string-name>Abdallah, M.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>XAI-IDS: Toward Proposing an Explainable Artificial Intelligence Framework for Enhancing Network Intrusion Detection Systems</article-title>
            <source>Applied Sciences</source>
            <volume>14</volume>
            <elocation-id>4170</elocation-id>
            <pub-id pub-id-type="doi">10.3390/app14104170</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mohale, V.Z. and Obagbuwa, I.C. (2025) A Systematic Review on the Integration of Explainable Artificial Intelligence in Intrusion Detection Systems to Enhancing Transparency and Interpretability in Cybersecurity. <italic>Frontiers in Artificial Intellig</italic><italic>ence</italic>, 8, Article 1526221. https://doi.org/10.3389/frai.2025.1526221 <pub-id pub-id-type="doi">10.3389/frai.2025.1526221</pub-id><pub-id pub-id-type="pmid">40040929</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frai.2025.1526221">https://doi.org/10.3389/frai.2025.1526221</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mohale, V.Z.</string-name>
              <string-name>Obagbuwa, I.C.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>A Systematic Review on the Integration of Explainable Artificial Intelligence in Intrusion Detection Systems to Enhancing Transparency and Interpretability in Cybersecurity</article-title>
            <source>Frontiers in Artificial Intelligence</source>
            <volume>8</volume>
            <elocation-id>1526221</elocation-id>
            <pub-id pub-id-type="doi">10.3389/frai.2025.1526221</pub-id>
            <pub-id pub-id-type="pmid">40040929</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Stow, M. (2026) Quantifying Explanation Disagreement between SHAP and LIME across Tabular Classification Models. <italic>International Journal of Computer Sciences</italic><italic>and Engineering</italic>, 14, 13-21. https://doi.org/10.26438/ijcse.v14i1.7255 <pub-id pub-id-type="doi">10.26438/ijcse.v14i1.7255</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.26438/ijcse.v14i1.7255">https://doi.org/10.26438/ijcse.v14i1.7255</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Stow, M.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Quantifying Explanation Disagreement between SHAP and LIME across Tabular Classification Models</article-title>
            <source>International Journal of Computer Sciences and Engineering</source>
            <volume>14</volume>
            <pub-id pub-id-type="doi">10.26438/ijcse.v14i1.7255</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, M., Zheng, K., Yang, Y. and Wang, X. (2020) An Explainable Machine Learning Framework for Intrusion Detection Systems. <italic>IEEE Access</italic>, 8, 73127-73141. https://doi.org/10.1109/access.2020.2988359 <pub-id pub-id-type="doi">10.1109/access.2020.2988359</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2020.2988359">https://doi.org/10.1109/access.2020.2988359</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, M.</string-name>
              <string-name>Zheng, K.</string-name>
              <string-name>Yang, Y.</string-name>
              <string-name>Wang, X.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>An Explainable Machine Learning Framework for Intrusion Detection Systems</article-title>
            <source>IEEE Access</source>
            <volume>8</volume>
            <pub-id pub-id-type="doi">10.1109/access.2020.2988359</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Saied, M. and Guirguis, S. (2025) Explainable Artificial Intelligence for Botnet Detection in Internet of Things. <italic>Scientific Reports</italic>, 15, Article No. 7632. https://doi.org/10.1038/s41598-025-90420-6 <pub-id pub-id-type="doi">10.1038/s41598-025-90420-6</pub-id><pub-id pub-id-type="pmid">40038372</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-025-90420-6">https://doi.org/10.1038/s41598-025-90420-6</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Saied, M.</string-name>
              <string-name>Guirguis, S.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Explainable Artificial Intelligence for Botnet Detection in Internet of Things</article-title>
            <source>Scientific Reports</source>
            <volume>15</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-025-90420-6</pub-id>
            <pub-id pub-id-type="pmid">40038372</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Uccello, F., Pawlicki, M., D’Antonio, S., Kozik, R. and Choraś, M. (2025) A New Cybersecurity Approach Enhanced by Xai-Derived Rules to Improve Network Intrusion Detection and Siem. <italic>Computers</italic>, <italic>Materials &amp; Continua</italic>, 83, 1607-1621. https://doi.org/10.32604/cmc.2025.062801 <pub-id pub-id-type="doi">10.32604/cmc.2025.062801</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.32604/cmc.2025.062801">https://doi.org/10.32604/cmc.2025.062801</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Uccello, F.</string-name>
              <string-name>Pawlicki, M.</string-name>
              <string-name>Antonio, S.</string-name>
              <string-name>Kozik, R.</string-name>
              <string-name>Computers, M</string-name>
            </person-group>
            <year>2025</year>
            <article-title>A New Cybersecurity Approach Enhanced by Xai-Derived Rules to Improve Network Intrusion Detection and Siem</article-title>
            <source>Computers</source>
            <volume>83</volume>
            <pub-id pub-id-type="doi">10.32604/cmc.2025.062801</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Uccello, F., Pawlicki, M., D’Antonio, S., Kozik, R. and Choraś, M. (2024) A Novel Approach to the Use of Explainability to Mine Network Intrusion Detection Rules. In: Nguyen, N.T., <italic>et al</italic>., Eds., <italic>Intelligent Information and Database Systems</italic>, Springer, 70-81. https://doi.org/10.1007/978-981-97-4982-9_6 <pub-id pub-id-type="doi">10.1007/978-981-97-4982-9_6</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-981-97-4982-9_6">https://doi.org/10.1007/978-981-97-4982-9_6</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Uccello, F.</string-name>
              <string-name>Pawlicki, M.</string-name>
              <string-name>Antonio, S.</string-name>
              <string-name>Kozik, R.</string-name>
              <string-name>Nguyen, N.T.</string-name>
              <string-name>Systems, S</string-name>
            </person-group>
            <year>2024</year>
            <article-title>A Novel Approach to the Use of Explainability to Mine Network Intrusion Detection Rules</article-title>
            <source>In: Nguyen</source>
            <volume>70</volume>
            <pub-id pub-id-type="doi">10.1007/978-981-97-4982-9_6</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Li, W., Ma, D., Li, Z., Bao, H., Wang, S., Jin, H., <italic>et al</italic>. (2024) Poster: Towards Real-Time Intrusion Detection with Explainable AI-Based Detector. <italic>Proceedings of the</italic>2024 <italic>on ACM SIGSAC Conference on Computer and Communications Security</italic>, Salt Lake City, 14-18 October 2024, 4934-4936. https://doi.org/10.1145/3658644.3691410 <pub-id pub-id-type="doi">10.1145/3658644.3691410</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3658644.3691410">https://doi.org/10.1145/3658644.3691410</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Li, W.</string-name>
              <string-name>Ma, D.</string-name>
              <string-name>Li, Z.</string-name>
              <string-name>Bao, H.</string-name>
              <string-name>Wang, S.</string-name>
              <string-name>Jin, H.</string-name>
              <string-name>Security, S</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Poster: Towards Real-Time Intrusion Detection with Explainable AI-Based Detector</article-title>
            <source>Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security</source>
            <volume>14</volume>
            <pub-id pub-id-type="doi">10.1145/3658644.3691410</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Ables, J., Childers, N., Anderson, W., Mittal, S., Rahimi, S., Banicescu, I. and Seale, M. (2024) Eclectic Rule Extraction for Explainability of Deep Neural Network Based Intrusion Detection Systems. arXiv: 2401.10207.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Ables, J.</string-name>
              <string-name>Childers, N.</string-name>
              <string-name>Anderson, W.</string-name>
              <string-name>Mittal, S.</string-name>
              <string-name>Rahimi, S.</string-name>
              <string-name>Banicescu, I.</string-name>
              <string-name>Seale, M.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Eclectic Rule Extraction for Explainability of Deep Neural Network Based Intrusion Detection Systems</article-title>
            <fpage>2401</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Nascita, A., Aceto, G., Ciuonzo, D., Montieri, A., Persico, V. and Pescapé, A. (2025) A Survey on Explainable Artificial Intelligence for Internet Traffic Classification and Prediction, and Intrusion Detection. <italic>IEEE Communications Surveys &amp; Tutorials</italic>, 27, 3165-3198. https://doi.org/10.1109/comst.2024.3504955 <pub-id pub-id-type="doi">10.1109/comst.2024.3504955</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/comst.2024.3504955">https://doi.org/10.1109/comst.2024.3504955</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Nascita, A.</string-name>
              <string-name>Aceto, G.</string-name>
              <string-name>Ciuonzo, D.</string-name>
              <string-name>Montieri, A.</string-name>
              <string-name>Persico, V.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>A Survey on Explainable Artificial Intelligence for Internet Traffic Classification and Prediction, and Intrusion Detection</article-title>
            <source>IEEE Communications Surveys &amp; Tutorials</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1109/comst.2024.3504955</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Alsaedi, A., Moustafa, N., Tari, Z., Mahmood, A. and Anwar, A. (2020) TON_IoT Telemetry Dataset: A New Generation Dataset of IoT and IIoT for Data-Driven Intrusion Detection Systems. <italic>IEEE Access</italic>, 8, 165130-165150. https://doi.org/10.1109/access.2020.3022862 <pub-id pub-id-type="doi">10.1109/access.2020.3022862</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2020.3022862">https://doi.org/10.1109/access.2020.3022862</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Alsaedi, A.</string-name>
              <string-name>Moustafa, N.</string-name>
              <string-name>Tari, Z.</string-name>
              <string-name>Mahmood, A.</string-name>
              <string-name>Anwar, A.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>TON_IoT Telemetry Dataset: A New Generation Dataset of IoT and IIoT for Data-Driven Intrusion Detection Systems</article-title>
            <source>IEEE Access</source>
            <volume>8</volume>
            <pub-id pub-id-type="doi">10.1109/access.2020.3022862</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Neto, E.C.P., Dadkhah, S., Ferreira, R., Zohourian, A., Lu, R. and Ghorbani, A.A. (2023) CICIoT2023: A Real-Time Dataset and Benchmark for Large-Scale Attacks in IoT Environment. <italic>Sensors</italic>, 23, Article 5941. https://doi.org/10.3390/s23135941 <pub-id pub-id-type="doi">10.3390/s23135941</pub-id><pub-id pub-id-type="pmid">37447792</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s23135941">https://doi.org/10.3390/s23135941</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Neto, E.C.P.</string-name>
              <string-name>Dadkhah, S.</string-name>
              <string-name>Ferreira, R.</string-name>
              <string-name>Zohourian, A.</string-name>
              <string-name>Lu, R.</string-name>
              <string-name>Ghorbani, A.A.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>CICIoT2023: A Real-Time Dataset and Benchmark for Large-Scale Attacks in IoT Environment</article-title>
            <source>Sensors</source>
            <volume>23</volume>
            <elocation-id>5941</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s23135941</pub-id>
            <pub-id pub-id-type="pmid">37447792</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Sahito, S., Zareen, S., Safet, S., Talpur, K.R., Rabby, S.K.M.A.H., Bhutto, A., <italic>et al</italic>. (2025) Explainable AI (XAI) for Security Decisions to Mitigate Cybersecurity Attacks. <italic>Journal of Advanced Research in Applied Sciences and Engineering Technology</italic>, 55, 214-223. https://doi.org/10.37934/araset.55.2.214223 <pub-id pub-id-type="doi">10.37934/araset.55.2.214223</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.37934/araset.55.2.214223">https://doi.org/10.37934/araset.55.2.214223</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Sahito, S.</string-name>
              <string-name>Zareen, S.</string-name>
              <string-name>Safet, S.</string-name>
              <string-name>Talpur, K.R.</string-name>
              <string-name>Rabby, S.K.M.A.H.</string-name>
              <string-name>Bhutto, A.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Explainable AI (XAI) for Security Decisions to Mitigate Cybersecurity Attacks</article-title>
            <source>Journal of Advanced Research in Applied Sciences and Engineering Technology</source>
            <volume>55</volume>
            <pub-id pub-id-type="doi">10.37934/araset.55.2.214223</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>