<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1d1 20130915//EN" "JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">SDQ</journal-id><journal-title-group><journal-title>Security &amp; Defence Quarterly</journal-title><abbrev-journal-title>SDQ</abbrev-journal-title></journal-title-group><issn pub-type="epub">2544-994X</issn><issn pub-type="ppub">2300-8741</issn><publisher><publisher-name>Akademia Sztuki Wojennej</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">SDQ-56-00593</article-id><article-id pub-id-type="doi">10.35467/sdq/240155</article-id><article-categories><subj-group subj-group-type="heading"><subject>RESEARCH PAPER</subject></subj-group></article-categories><title-group><article-title>DRVF: A filtered-ring valuation framework for conservative multi-source intelligence fusion</article-title></title-group><contrib-group content-type="authors"><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-9735-8951</contrib-id><name><surname>SHoa</surname><given-names>M.H. Anjom</given-names></name><email>mh.anjomshoa@vru.ac.ir</email></contrib><aff id="aff1">Department of Mathematics, Vali-e-Asr University of Rafsanjan, Emam Khomeini Sq, Emam Khomeini Bl, 77718897111, Rafsanjan, Iran</aff></contrib-group><pub-date pub-type="epub"><day>12</day><month>11</month><year>2026</year></pub-date><volume>56</volume><issue>4</issue><fpage>1</fpage><lpage>24</lpage><history><date date-type="received"><day>29</day><month>06</month><year>2026</year></date><date date-type="rev-recd"><day>17</day><month>09</month><year>2026</year></date><date date-type="accepted"><day>23</day><month>09</month><year>2026</year></date></history><permissions><copyright-statement>© 2026 M.H. Anjom SHoa. Published by War Studies University, Poland.</copyright-statement><copyright-year>2026</copyright-year><license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0"><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="http://creativecommons.org/licenses/by/4.0/">http://creativecommons.org/licenses/by/4.0/</ext-link>).</license-p></license></permissions><abstract><p>Multi-source intelligence fusion under adversarial conditions demands formal control of combined confidence with degradation of source reliability. However, no existing framework simultaneously enforces a conservative confidence floor, preserves source-tier distinctions as algebraically separable compartments, and maintains a reconstructable record of assessment evolution. Here we establish the Dubrovin Ring-Valuation Framework (DRVF), a formally verified structure for conservative multi-source fusion. The DRVF encodes intelligence propositions within a filtered non-commutative ring, represented as a 3×3 matrix over source-reliability tiers, coupled with an aggregation rule bounding combined confidence at the least reliable active source. Algebraic proofs establish three previously unresolved properties simultaneously: a conservative confidence floor, source-tier compartmentalisation, and auditable assessment trajectories. A worked cyber-disinformation scenario demonstrates the framework’s operational behaviour, and an exploratory pilot (N = 23) informed protocol refinements ahead of a planned confirmatory evaluation. The DRVF resolves structural gap in the existing fusion methods, providing a new formally verified framework and opening the door to empirical validation in operational intelligence settings.</p></abstract><kwd-group><kwd>intelligence fusion</kwd><kwd>hybrid crises</kwd><kwd>filtered ring</kwd><kwd>quasi-valuation</kwd><kwd>conservative inference</kwd><kwd>structured analytical technique</kwd><kwd>source compartmentalisation</kwd><kwd>confidence tracking</kwd><kwd>multi-source analysis</kwd></kwd-group></article-meta></front><body><sec id="S1" sec-type="intro"><title>Introduction</title><p>How can analysts formally track and preserve confidence assessments as source reliability changes over the course of a multi-source assessment? This paper addresses a specific structural problem that arises when intelligence from multiple collection disciplines must be combined under conditions where the reliability of individual sources is not stable and the evidence environment may be subjected to deliberate manipulation. The existing structured techniques do not encode the tracking of confidence evolution as a formal property of analytical method. The Dubrovin Ring-Valuation Framework (DRVF) introduced in this paper is designed to encode intelligence propositions within a filtered non-commutative ring.</p><p>There is some confusion over the usage of “hybrid” in the intelligence and security studies literature. Others, such as <xref ref-type="bibr" rid="ref3">Bousquet (2009)</xref>; <xref ref-type="bibr" rid="ref4">Caliskan (2021)</xref>; and <xref ref-type="bibr" rid="ref9">Echevarria (2016)</xref> have suggested that the concept has become a rhetorical device that can mask what is essentially a continuation of normal campaign planning, and has been used in ways that can obscure its true meaning. The substantive criticisms are recognised here: In this paper, the term “hybrid” is not meant to imply that the coerce is a given category of analysis, but rather a shorthand for the multiple operational conditions listed above that coexist in what are often called multiple domains: (a) the evidentiary environment is manipulated; (b) source reliability is not equal across collection streams; and (c) the analyst can’t confidently determine the compromised collection streams. Its usage means the reference of these conditions, not of a supposed “new kind” of warfare. The three structural conditions are critical to the mathematical framework and may exist in contexts that are not typically considered “hybrid.”</p><p>Two declassified historical episodes illustrate the structural dimension of this problem. The 9/11 Commission (<xref ref-type="bibr" rid="ref28">US Government Printing Office, 2004</xref>) documented a systemic failure to integrate Human Intelligence (HUMINT) and Signals Intelligence (SIGINT) indicators prior to September 2001. The Commission noted that information was held in organisational silos, there was no mechanism for producing a conservative composite confidence estimate, and analysts could not trace how their assessments changed as new information arrived. The structural point relevant here is specific: there was no formal mechanism that could both fuse evidence across streams and preserve the evidentiary trajectory of that fusion. The second episode is the assessment of Iraq’s weapons of mass destruction (WMD) analysed by <xref ref-type="bibr" rid="ref15">Jervis (2010)</xref>. Low-quality HUMINT was combined with ambiguous SIGINT fragments without formal limits on how the combination could affect aggregate confidence. The result was an over-confident assessment. <xref ref-type="bibr" rid="ref15">Jervis (2010)</xref> identifies multiple contributing factors, including political pressure and groupthink; here, the structural point of interest is the absence of a mechanism that imposed a constraint on combined confidence based on the reliability of the weakest substantive source.</p><p>The cyber-disinformation scenario used as a worked example in this paper is drawn from the hybrid-crisis domain because it exhibits all three conditions in a concentrated form: multiple collection disciplines operating simultaneously, at least one stream (Open-Source Intelligence [OSINT]) known to be under active adversarial manipulation, and source reliability that shifts as the operation unfolds. Hybrid crises are not the only context in which these conditions arise, but they are the context in which the consequences of fusion failures that produce over-confident assessments based on manufactured corroboration are most severe are most severe and most thoroughly documented in the declassified record.</p><p>All-source intelligence analysts in major agencies perform multi-source fusion as a routine matter, supported by organisational protocols, professional standards, and institutional review processes. The gap that DRVF addresses is not the absence of operational solutions but the absence of a formally specified structure that enforces certain protective constraints as structural properties rather than as procedural guidelines. The three conditions that define the problem class are not exceptional; they describe the standard operating environment for all-source intelligence analysis in most major agencies. Intelligence analysis, as <xref ref-type="bibr" rid="ref13">Herman (1996)</xref>, <xref ref-type="bibr" rid="ref16">Kent (1949)</xref>, and others have argued, is inherently conducted under conditions of incomplete, contested, and often deliberately concealed information. What distinguishes the specific problem class addressed here is not the mere presence of an adversary but the potential for deliberate manipulation of the evidence streams themselves: compromised collection channels, coordinated disinformation targeting the analyst’s OSINT inputs, or strategically leaked deceptive material designed to inflate confidence in a false hypothesis.</p><p>Some of this issue is addressed by the existing structured frameworks. Analysis of competing hypotheses (ACH) is a snapshot tool that enhances hypothesis generation and diminishes some types of confirmation bias, but it does not codify the evolution of confidence as a source’s reliability decreases during the analysis (<xref ref-type="bibr" rid="ref14">Heuer and Pherson, 2019</xref>). While Bayesian networks are attractive because they allow for a rigorous modelling of conditional dependence, they are based on the prior and on the dependency structure, both of which are very sensitive to manipulation of the evidence environment (<xref ref-type="bibr" rid="ref22">Pearl, 1988</xref>). The Dempster-Shafer Theory (DST), which is considered epistemic uncertainty under incomplete evidence, has a typical form of the combination rule that if the evidence sources conflict, then epistemic belief can be inflated, so that the combined belief is higher than what it is warranted by the smallest source evidence, given a conservative norm (<xref ref-type="bibr" rid="ref8">Dempster, 1967</xref>; <xref ref-type="bibr" rid="ref25">Shafer, 1976</xref>). None of these frameworks has all three analytical properties: a conservative confidence floor, source-tier compartmentalisation, and traceable assessment evolution.</p><p>The DRVF integrates a filtered-ring algebraic structure and a conservative assessment-tier rule as its two core layers. The framework is domain-specific: it is designed for contexts where source reliability is unstable, adversarial manipulation of evidence is possible, and an auditable analytical record is required. It is not proposed as a universal replacement for the existing techniques. The paper proceeds as follows. Section 2 defines Intelligence fusion, as the paper uses this term. Section 3 presents the Scoping Review and gap analysis. Section 4 develops a formal Theoretical Framework, including proofs. Section 5 provides a Worked Example. Section 6 presents Discussion and discusses implications, counterarguments, and pilot observations. Section 7 contains Conclusions.</p></sec><sec id="S2"><title>Intelligence fusion: Definition and scope</title><p>Intelligence fusion, as used in this paper, refers to the process of integrating information from multiple collection disciplines (e.g., HUMINT, SIGINT, and OSINT) into a single composite assessment in which the contributing sources, their respective reliability levels, and the evidentiary basis for the combined judgement are preserved and inspected. This definition emphasises three elements that the existing formalisations address only partially: the preservation of source identity through the fusion process, the explicit representation of differential source reliability, and the traceability of how the combined assessment evolved as new evidence arrived. The term is distinct from data fusion in engineering contexts where the emphasis is on algorithmic optimisation rather than on epistemic caution under adversarial conditions (<xref ref-type="bibr" rid="ref12">Hall and Llinas, 2001</xref>; <xref ref-type="bibr" rid="ref17">Liggins et al., 2009</xref>).</p><p>The concept of intelligence fusion is operationalised differently across agencies and national traditions. In some contexts, it refers primarily to the organisational process of sharing and combining reports from different collection disciplines. In others, it denotes specific methodological approaches, such as Bayesian fusion or Dempster-Shafer combination. The diversity of conceptualisations is documented by <xref ref-type="bibr" rid="ref2">Betts (2002)</xref> as well as, more recently, by the intelligence-methodology literature (<xref ref-type="bibr" rid="ref23">Rieber, 2004</xref>; <xref ref-type="bibr" rid="ref6">Chang, et al., 2018</xref>). The definition adopted here is deliberately restricted: it concerns the formal properties of the combination mechanism itself, not the organisational or institutional arrangements within which fusion occurs. This restriction is necessary because the DRVF operates at the level of the combination structure, not at the level of the organisational process.</p></sec><sec id="S3"><title>Scoping review and theoretical positioning</title><sec id="S3_1"><title>search strategy and scope</title><p>This review was conducted as a scoping review based on the Preferred Reporting Items for Systematic Reviews and Meta-Analyses extension for Scoping Reviews (PRISMA-ScR) guidelines (<xref ref-type="bibr" rid="ref27">Tricco et al., 2018</xref>), which are suitable when a scoping review aims to map out the conceptual landscape rather than to estimate a pooled effect. The four areas targeted were: (1) intelligence fusion and multi-source fusion; (2) formal uncertainty representation; (3) confidence calibration or state space tracking in analytical reasoning; and (4) structured analytical techniques relevant to multi-source assessment. The databases searched were Google Scholar, IEEE Xplore, ScienceDirect, SpringerLink, and Taylor &amp; Francis Online. Search terms covered various combinations, such as “intelligence fusion,” “multi-source fusion,” “structured analytical technique,” “Dempster-Shafer,” “Bayesian fusion,” “confidence aggregation,” “weakest-link,” and “adversarial uncertainty.” The first search resulted in 312 hits. In all, eighty-nine papers were chosen for full-text review after screening of titles and abstracts. Following the full-text screening, forty-seven documents were retrieved for synthesis, which included references to multi-source uncertainty, confidence aggregation, or state space tracking in any tradecraft or security context. The research was not considered if it was limited to an environment where sensor fusion was used in non-adversarial engineering context. The PRISMA-ScR flowchart is included in <xref ref-type="app" rid="app1">Appendix A.7</xref>.</p><p>The review does not support absolute novelty claims. A scoping review maps the existing territory; it cannot exhaustively prove the absence of prior work. The claim this review supports is a relative contribution claim: within the reviewed corpus, no framework was found that simultaneously and explicitly integrates conservative weakest-link aggregation, hierarchical source compartmentalisation, and traceable assessment evolution in a formally specified intelligence-fusion context. The DRVF extends the existing literature by combining these three features in one formally specified, testable structure.</p></sec><sec id="S3_2"><title>Structured analytical techniques</title><p>Analysis of competing hypotheses is widely cited in the methodological literature and familiar to many Western-trained analysts, although its operational prevalence varies across organisations and is difficult to establish from publicly available evidence (<xref ref-type="bibr" rid="ref14">Heuer and Pherson, 2019</xref>). Software-assisted implementations of ACH now allow analysts to adjust source-validity weights interactively, which addresses some of the gap DRVF targets at the procedural level. The limitation relevant here is that ACH does not encode source-tier distinctions or confidence trajectories as algebraic properties of its structure. <xref ref-type="bibr" rid="ref18">Mandel and Barnes (2014)</xref> found that structured methods improve forecast accuracy under controlled conditions, but that benefits are domain-contingent. This finding supports both the value of formal structure and the need to test structure against performance. A recurring limitation across the Scholastic Assessment Test (SAT) literature is the absence of a formal mechanism for tracking analytical state transitions. When source reliability shifts mid-analysis, ACH provides no structural constraint on how that shift should propagate through the combined picture. Recent works by <xref ref-type="bibr" rid="ref23">Rieber (2004)</xref> on confidence-calibration methods and <xref ref-type="bibr" rid="ref6">Chang, et al. (2018)</xref> on structured techniques in operational settings have advanced the field, but the specific gap that DRVF addresses the formal tracking of confidence trajectories under degrading source reliability remains.</p></sec><sec id="S3_3"><title>Probabilistic frameworks</title><p>Bayesian networks are powerful when priors are defended and dependency structure is stable (<xref ref-type="bibr" rid="ref12">Hall and Llinas, 2001</xref>; <xref ref-type="bibr" rid="ref17">Liggins et al., 2009</xref>; <xref ref-type="bibr" rid="ref22">Pearl, 1988</xref>). Their application to multi-source intelligence fusion is well documented. Adversarial Bayesian formulations incorporate strategic manipulation of evidence inputs, and robust prior specifications reduce sensitivity to prior misspecification (<xref ref-type="bibr" rid="ref10">Friedman and Zeckhauser, 2012</xref>; <xref ref-type="bibr" rid="ref19">Muñoz-González and Lupu, 2017</xref>). These extensions represent genuine progress. Their limitation for the present purpose is not adversarial fragility <italic>per se</italic> but the combination of requirements: even adversarially robust Bayesian formulations do not simultaneously enforce a strict weakest-link confidence floor and preserve source-tier distinctions as algebraically separable compartments within one formally specified structure.</p></sec><sec id="S3_4"><title>Dempster-shafer theory</title><p>The DST represents epistemic uncertainty under incomplete evidence and is extensively applied in information fusion contexts (<xref ref-type="bibr" rid="ref5">Castanedo, 2013</xref>; <xref ref-type="bibr" rid="ref8">Dempster, 1967</xref>; <xref ref-type="bibr" rid="ref24">Sentz and Ferson, 2002</xref>; <xref ref-type="bibr" rid="ref25">Shafer, 1976</xref>). The tension with the present paper’s requirements arises from Dempster’s combination rule, which normalises conflict by redistributing mass away from the empty set, producing combined confidence estimates that exceed what the weakest credible source would justify. Both <xref ref-type="bibr" rid="ref20">Murphy’s (2000)</xref> averaging rule and <xref ref-type="bibr" rid="ref26">Smets’ (1990)</xref> conjunctive combination rule address conflict management without Dempster’s normalisation step, and <xref ref-type="bibr" rid="ref30">Yager’s (1987)</xref> modification assigns conflicting mass to a global ignorance term. These are substantive improvements. Their limitation is the same as for adversarial Bayesian extensions: none enforces a strict source-tier floor as an algebraic property of the combination structure itself.</p></sec><sec id="S3_5"><title>Dynamic epistemic logic (DEL)</title><p>Dynamic epistemic logic provides formal tools for representing how belief states change after public or private updates (<xref ref-type="bibr" rid="ref29">van Ditmarsch et al., 2007</xref>). DEL is conceptually proximate to the trajectory requirement in DRVF: it tracks how beliefs evolve, not merely what they are. Its limitation for operational deployment is practical. DEL models are highly expressive and formally rigorous, but adapting them to multi-source intelligence analyst workflows at the speed required by operational environments is not demonstrated.</p></sec><sec id="S3_6"><title>Summary: The relative contribution</title><p>Four conclusions emerge from the reviewed literature. First, structured analytical techniques remain operationally valuable but do not formalise confidence trajectory under degrading source reliability. Second, probabilistic frameworks provide mathematical rigour but rest on assumptions fragile in adversarial environments, and their adversarial extensions do not jointly enforce all three analytical requirements. Third, DST supports incomplete evidence but does not enforce a strict weakest-link floor as an algebraic property, even in its modified forms. Fourth, dynamic epistemic approaches represent state transitions formally but have not been operationalised for multi-source intelligence fusion. From these conclusions, the relative contribution of this paper can be stated: The DRVF extends the existing literature by integrating, in a single formally specified framework, (a) conservative weakest-link aggregation, (b) hierarchical source compartmentalisation, and (c) traceable assessment evolution. No framework combining all three features in an intelligence-fusion context was identified in the reviewed corpus. The synergy of the combination matters because each property, taken alone, is achievable with simpler structures; it is their simultaneous algebraic enforcement within one framework that constitutes the contribution. These distinctions are summarised in <xref ref-type="table" rid="T1">Table 1</xref>.</p><table-wrap id="T1" orientation="portrait" position="float"><label>Table 1</label><caption><p>Comparison of intelligence fusion frameworks on key analytical dimensions. Note: Ratings are based on the scoping review and represent structured characterisations to aid comparison, not empirical judgements. The DRVF entries reflect the proposed framework only; no empirical performance data is available at this stage.</p></caption><table frame="border" rules="groups"><thead valign="top"><tr><th align="left">Framework</th><th align="left">Weakest-link floor</th><th align="left">Source compartmentalisation</th><th align="left">Trajectory tracking</th><th align="left">Adversarial robustness</th><th align="left">Basis</th></tr></thead><tbody valign="top"><tr><td align="left">DRVF (proposed)</td><td align="left">Explicit via assessment tier T</td><td align="left">Explicit (3-tier matrix ring)</td><td align="left">Explicit (update log)</td><td align="left">Designed for adversarial conditions; unconfirmed empirically</td><td align="left">Formal specification(this paper)</td></tr><tr><td align="left">ACH (<xref ref-type="bibr" rid="ref14">Heuer and Pherson, 2019</xref>)</td><td align="left">Not formalised</td><td align="left">Not encoded</td><td align="left">Snapshot only</td><td align="left">Reduces confirmation bias; no manipulation constraint</td><td align="left"><xref ref-type="bibr" rid="ref14">Heuer and Pherson,2019</xref>; <xref ref-type="bibr" rid="ref18">Mandel and Barnes, 2014</xref></td></tr><tr><td align="left">Bayesian Networks (<xref ref-type="bibr" rid="ref22">Pearl, 1988</xref>)</td><td align="left">Only if priors encode it</td><td align="left">Can be modeled; not inherent</td><td align="left">Possible with temporal extension</td><td align="left">Fragile under standard priors; partial mitigation via robust extensions</td><td align="left"><xref ref-type="bibr" rid="ref12">Hall and Llinas, 2001</xref>; <xref ref-type="bibr" rid="ref22">Pearl, 1988</xref></td></tr><tr><td align="left">Dempster-Shafer (<xref ref-type="bibr" rid="ref25">Shafer, 1976</xref>)</td><td align="left">Partial; standard rule inflates</td><td align="left">Not inherent</td><td align="left">Not inherent</td><td align="left">Sensitive to conflict inflation; mitigated by modified rules</td><td align="left"><xref ref-type="bibr" rid="ref8">Dempster, 1967</xref>; <xref ref-type="bibr" rid="ref24">Sentz and Ferson, 2002</xref></td></tr><tr><td align="left">Dynamic epistemic logic (van Ditmarsch <break/><italic>et al</italic>., 2007)</td><td align="left">Not a core focus</td><td align="left">Can represent; not operationalised</td><td align="left">Explicit in update logic</td><td align="left">High formal expressiveness; undeployed operationally</td><td align="left">van Ditmarsch <break/><italic>et al</italic>., 2007</td></tr></tbody></table></table-wrap></sec></sec><sec id="S4"><title>Theoretical framework</title><sec id="S4_1"><title>Operational motivation and problem class</title><p>The problem class addressed by DRVF is a restricted one: multi-source intelligence fusion with (a) unstable or differentially degrading sources, (b) potential for adversarial manipulation of one or more evidence streams, and (c) need for an auditable record of assessment evolution. The three conditions that define this problem class are not exceptional; they describe the standard operating environment for all-source intelligence analysis in most major agencies. The lack of something is not an operational practice but a formal mechanism that makes some protection constraints structural properties and not procedural directions. Three analytical needs emerge from this problem class: (1) do not let weak sources be overwhelmed by strong sources (conservative aggregation); (2) do not compress sources into a single number (compartmentalisation); and (3) document the analytical state over time to allow for inspection of assessment evolution (trajectory tracking). The DRVF meets requirements (1) and (2) formally, and requirement (3) is met by the structured update protocol outlined in Section 5. The correspondence is not a necessary consequence but a deliberate option: other options are conceivable and might be just as successful with different assumptions.</p><p>Consider the following operational scenario, which serves as the worked example throughout this section. An analyst is assessing whether an adversary is preparing a coordinated cyber-disinformation campaign, a characteristic hybrid-crisis pattern in which cyber operations and information warfare converge. SIGINT provides technical indicators of preparatory network activity at high reliability (tier 1). A HUMINT source partially corroborates operational intent but is only partially validated (tier 2). OSINT provides abundant circumstantial evidence, but the domain is actively subjected to adversarial manipulation (tier 3). This pattern concurrent multi-domain operations, with at least one stream under active manipulation is typical of the hybrid-crisis environments that motivated the framework’s development. A standard averaging rule would allow a strong SIGINT signal to lift aggregate confidence above what the HUMINT and OSINT evidence justifies. DRVF is constructed to prevent that outcome.</p></sec><sec id="S4_2"><title>What DRVF is and is not</title><p>The DRVF is a proposed method for combining intelligence from different sources that deliberately prevents combined confidence from exceeding what the weakest important piece of evidence allows. It also maintains information from different sources in separate inspectable compartments so that analysts can always see which evidence came from where and how the overall assessment changed as new information arrived. The DRVF is a formally specified framework for conservative multi-source intelligence fusion. It combines a filtered-ring algebraic structure, preserving source-tier distinctions as algebraically separable entries, with an assessment-tier aggregation rule, which enforces the weakest-link confidence floor. It is proposed as a candidate analytical tool, not as a universal replacement for the existing methods.</p><p>The term “formal” means that the framework’s properties, the conservative floor, the source isolation conditions, and the update rules are expressed as mathematical propositions with proofs, not as procedural guidelines. An analyst following the framework cannot inadvertently violate the conservative floor because it is enforced by the algebraic structure of the assessment tier. The term “conservative” means that the combined confidence estimate is bounded by the least reliable active substantive source entry. “Framework” denotes a structured set of integrated components, the filtered-ring representation, the assessment-tier rule, the source-mapping rubric, and the isolation criterion designed to work together as a coherent system for a defined analytical purpose. DRVF is not a decision-support system, a software tool, or an organisational process. It is a mathematical specification of how evidence combination should behave under stated conditions.</p></sec><sec id="S4_3"><title>Filtered-ring representation</title><p>Let R be a non-zero, non-commutative ring equipped with a descending filtration {<italic>R</italic><italic><sub>k</sub></italic>} ≥ 0 such that <italic>R</italic><sub>0</sub> = <italic>R</italic>, R<italic><sub>K+</sub></italic><sub>1</sub> ⊆ <italic>R</italic><italic><sub>K</sub></italic>, and <italic>R</italic><italic><sub>k</sub></italic><italic>R</italic><italic><sub>m</sub></italic> ⊆ <italic>R</italic><italic><sub>k</sub></italic><sub>+</sub><italic><sub>m</sub></italic>. The filtration is interpreted as a reliability ordering: lower-index elements represent higher-reliability propositions; higher-index elements represent weaker support. This is a modelling convention, not a theorem about epistemic states.</p><p>The filtered-ring structure is chosen over simpler alternatives for two specific reasons. First, the compatibility condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic> aligns algebraic operations with reliability tiers by construction: any product of ring elements automatically respects the reliability grading without requiring the analyst to recheck tier constraints at each step. An ordered set or vector representation does not provide this automatic propagation. Second, the matrix ring <italic>M</italic><sub>3</sub>(<italic>R</italic>) preserves internal distinctions between source streams, including corroborative and contradictory cross-stream relations, in a way that cannot be done by a scalar or vector representation. These two properties together, automatic tier-graded propagation and source-pair distinction, justify the algebraic overhead relative to simpler formalisms (<xref ref-type="bibr" rid="ref1">Anjom Shoa, 2016</xref>).</p><p>Intelligence propositions are encoded as elements of the matrix ring <italic>M</italic><sub>3</sub>(<italic>R</italic>). The three dimensions correspond to three principal intelligence streams. In the worked example, these are HUMINT, SIGINT, and OSINT. This is a motivated modelling choice tied to the specific operational context; it is not a universal claim about source taxonomy. A primary source class, as used here, refers to a collection discipline whose reliability characteristics may degrade independently of other disciplines. SIGINT, Communications Intelligence (COMINT), and Measurement and Signature Intelligence (MASINT) may share collection infrastructure, and a compromise affecting that infrastructure could degrade all three simultaneously. The three-class assumption is a modelling simplification: it treats the intelligence problem as involving three principal reliability tracks. If a specific operational context requires finer-grained source distinctions, the matrix dimension should be revised accordingly (see Section 6.6 Boundary Conditions). Diagonal entries <italic>a</italic><italic><sub>ii</sub></italic> represent source-specific assessments for stream i. Off-diagonal entries <italic>a</italic><italic><sub>ij</sub></italic> represent corroborative or contradictory relations between streams i and j. A zero off-diagonal entry means no cross-validation has been established.</p></sec><sec id="S4_4"><title>Source-to-matrix mapping rubric</title><p>A formal framework that cannot be instantiated from operational data is a mathematical exercise, not a usable tool. The following rubric specifies how an analyst maps raw evidence to filtration levels. The rubric has three components: source reliability grading, corroboration weighting, and matrix entry assignment. Diagonal entries receive the filtration tier assigned to the corresponding primary source stream under the reliability grading above. Off-diagonal entries <italic>a<sub>ij</sub></italic> (representing cross-stream corroboration or contradiction) are assigned the filtration tier of the weaker of the two contributing pieces of evidence, consistent with the weakest-link principle for corroboration. A zero entry indicates that no cross-validation relationship has yet been established. All matrix assignments, together with the evidentiary basis for each tier, are recorded in the analytical log.</p><p><italic>Source reliability grading</italic>. Tier 1 (filtration level 1): Source has documented operational reliability across prior assessments; intelligence has been independently corroborated by at least one source from a different collection stream; collection method is robust to adversarial manipulation under current conditions.</p><p>Tier 2 (filtration level 2): Source has partial reliability documentation; intelligence has been partially corroborated or is consistent with independent indicators; collection method may be vulnerable to limited adversarial manipulation.</p><p>Tier 3 (filtration level 3): Source has limited or unknown reliability; information from source is not corroborated by other streams or contradicted; collection method is known to be subjected to active adversarial manipulation.</p><p>Tier 4 (filtration level 4): Source has been discredited partially, collection channel has been compromised, or intelligence is inconsistent with independent indicators. Tier 4 movement is explicit analyst judgement and documented. In between cases, the case is rounded up using a conservative approach: if a source falls into two tiers, the higher filtration index (weaker reliability) is assigned. This rubric is planned to be assessed for inter-rater reliability in the confirmatory evaluation study and should be considered as a proposed instrument that needs to be validated prior to its confirmatory use.</p><p><italic>Corroboration weighting</italic>. An off-diagonal entry between streams i and j is assigned at the filtration level of the weaker corroborating piece of evidence, not the average. If both SIGINT (tier 1) and HUMINT (tier 2) point to the same indicator, the corroboration entry is assigned tier 2. This is the rubric-level instantiation of the weakest-link principle for cross-stream corroboration.</p></sec><sec id="S4_5"><title>Quasi-valuation, assessment tier, and the conservative floor</title><p>Define a quasi-valuation ϑ: <italic>R</italic> → ℕ ∪ {∞} satisfying: ϑ(0)= ∞; ϑ(<italic>ab</italic>) ≥ ϑ(<italic>a</italic>) + ϑ(<italic>b</italic>); and ϑ(<italic>a</italic> + <italic>b</italic>) ≥ min{ϑ(<italic>a</italic>),ϑ(<italic>b</italic>)}. For a non-zero element <italic>a</italic>, ϑ(<italic>a</italic>) provides the algebraic infrastructure of the framework. For <italic>A</italic> = (<italic>a</italic><italic><sub>ij</sub></italic>) ∈ <italic>M</italic><sub>3</sub> (<italic>R</italic>), define ϑ(<italic>A</italic>) = min<italic><sub>ij</sub></italic> ϑ(<italic>a</italic><italic><sub>ij</sub></italic>), the quasi-valuation provides the algebraic infrastructure of the framework. The compatibility condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic> ensures that algebraic operations on ring elements are automatically constrained by their reliability tiers: any product of elements from <italic>R</italic><italic><sub>k</sub></italic> and <italic>R</italic><italic><sub>k</sub></italic> is guaranteed to lie in <italic>R</italic><italic><sub>k</sub></italic><sub>+</sub><italic><sub>m</sub></italic>, which means the tier information propagates correctly through addition and multiplication without requiring manual verification. The addition and multiplication properties of the quasi-valuation (proved in <xref ref-type="app" rid="app1">Appendix A.2</xref>) guarantee that the tier structure is preserved under evidence combination. These properties are the mathematical foundation that makes the framework’s structural constraints enforceable.</p><p>The weakest-link norm itself is implemented by a separate but related function. Define the filtration tier of a non-zero ring element <italic>a</italic> as τ(<italic>a</italic>)= <italic>k</italic> if a ∈ <italic>R</italic><italic><sub>k</sub></italic> R<italic><sub>k</sub></italic><sub>+1</sub>; define τ(0) as undefined (zero entries carry no tier information). For a matrix <italic>A</italic> ∈ <italic>M</italic><sub>3</sub>(<italic>R</italic>), define the assessment tier as:</p><p><italic>T</italic>(<italic>A</italic>) = max{τ(<italic>a</italic><italic><sub>ij</sub></italic>): <italic>a</italic><italic><sub>ij</sub></italic> ≠ 0}</p><p>The maximum is taken over all non-zero, tier-assigned entries in the active matrix. This function implements the weakest-link aggregation norm directly: the highest (weakest) filtration tier among all active evidence entries determines the overall assessment tier. If any active entry sits at tier 3, the overall assessment cannot exceed tier 3, regardless of how many tier-1 entries are present. The assessment tier T(A) is bounded from below by the compatibility condition: since τ(<italic>a</italic>) ≤ ϑ(<italic>a</italic>) for any tier-assigned element <italic>a</italic>, we have <italic>T</italic>(<italic>A</italic>) ≤ maxϑ(<italic>a</italic><italic><sub>ij</sub></italic>) for all tier-assigned active entries. The quasi-valuation provides an algebraic upper bound on the assessment tier, and in the special case where τ(<italic>a</italic><italic><sub>ij</sub></italic>) = ϑ(<italic>a</italic><italic><sub>ij</sub></italic>) for all entries, the bound is tight.</p><p>The relationship between ϑ and T is worth stating precisely. The quasi-valuation ϑ operates at the level of individual ring elements and enforces the compatibility condition that makes the algebraic structure work. The assessment tier T operates at the level of the matrix and enforces the weakest-link norm that makes the framework conservative. Both are necessary: ϑ without T would provide algebraic infrastructure without a conservative aggregation rule; T without ϑ would provide a conservative rule without the algebraic guarantees that ensure tier information propagates correctly through operations on the matrix.</p><p>This conservative norm appears in intelligence doctrine under various formulations. The formal contribution is not the weakest-link norm itself (which experienced practitioners already recognise), but its formalisation in a structure that permits algebraic tracking, mathematical comparison across assessments, and formal testing of properties. A structure that enforces the norm by construction is harder to violate inadvertently than one that relies on analyst discipline alone.</p></sec><sec id="S4_6"><title>Epistemological justification of the weakest-link norm</title><p>A substantive objection to the weakest-link approach must be addressed directly. Converging independent sources can and do justify higher aggregate confidence than any single source alone. This is the logic underlying corroboration-based inference, and it is epistemologically sound under conditions of genuine source independence. If all five independent witnesses of varying reliability report observing the same event, it is reasonable to be more confident than the least reliable witness alone would justify. The reviewer who raised this point is correct as a matter of general epistemology.</p><p>The weakest-link norm in DRVF is not proposed as a universal epistemological principle. It is proposed as a domain-specific procedural constraint appropriate to a particular failure mode: the risk that coordinated deception or undetected source compromise inflates aggregate confidence by providing apparent corroboration that is in fact manufactured. In such environments, the independence assumption that justifies corroboration-based confidence-building does not hold. The five witnesses may be reporting the same story because the same deception operation has reached all of them. The conservative floor is a safeguard against this specific failure mode, not a general claim about how evidence should always be combined.</p><p>This distinction has a practical implication. In environments where adversarial manipulation is not a concern, where sources can be verified as genuinely independent, or where the cost of conservatism (missed signals and delayed judgements) outweighs the cost of overconfidence, other aggregation philosophies may be more appropriate. Bayesian combination, for example, is well suited to such environments. The DRVF is designed for the boundary case where the analyst has a reason to believe that one or more evidence streams may be compromised and cannot reliably determine which ones. This is not an unusual condition in intelligence analysis, but it is not a universal one either. The boundary conditions are stated in Section 6.6.</p><p>A substantive question raised in review deserves a direct response here: can the addition of weak but non-contradictory evidence rationally reduce the confidence warranted by an otherwise unchanged body of strong evidence? The answer that DRVF gives is conditional, and the condition turns on a distinction that the framework already encodes operationally but should now state explicitly. Weak evidence that fails a validity screen is dropped, not retained; weak evidence that passes the screen is retained at its assigned tier and bounds the aggregate. The conservative floor reflects residual deception risk that cannot be eliminated by scrutiny alone.</p><p>The two-stage gate operates as follows.</p><p>Stage 1 (validity screen): Before any piece of evidence enters the matrix, it is subjected to the standard validation procedures that experienced analysts already apply source triangulation, chain-of-custody verification, plausibility assessment against independent indicators, and explicit documentation of any doubts. Evidence that fails this screen is not entered into the matrix at all; it is logged in a separate excluded-evidence record with the reason for exclusion. This is the operational realisation of the reviewer’s instinct that weak or suspect evidence should be subjected to scrutiny and dropped if invalid. DRVF does not override this step; it presupposes it.</p><p>Stage 2 (tier assignment and floor enforcement): Evidence that passes the validity screen is assigned a filtration tier under a rubric in Section 4.4 and entered into the matrix. Once entered, the assessment-tier rule <italic>T</italic>(<italic>A</italic>) = max{τ(<italic>a</italic><italic><sub>ij</sub></italic>)} applies. The conservative floor at this stage is not a second validity judgement; it is a residual-risk bound. The screened-in weak evidence may still be reporting the same fabricated story that strong sources are reporting, because the screen cannot prove independence. The floor reflects the analyst’s inability to verify independence, not a verdict that the weak evidence is itself invalid. This is the substantive difference between “this evidence is suspect, drop it” (a Stage 1 outcome) and “this evidence is acceptable but of low reliability, let it bound the aggregate” (a Stage 2 outcome). The matrix structure of DRVF keeps these two judgements distinct, while a scalar weakest-link rule would conflate them.</p><p>This reformulation addresses the reviewer’s concern directly. The framework already provides for dropping invalid evidence: the rubric’s tier-4 designation and the source-isolation operation in Section 4.7 implement exactly this. What the framework does not do, and should not do, is allow weak-but-valid evidence to be silently overridden by stronger sources. The risk that weak evidence corresponds to a coordinated deception channel cannot be ruled out by scrutiny; it can only be bounded. The floor is that bound.</p></sec><sec id="S4_7"><title>Formal source isolation</title><p>A substantive objection to the framework’s design must be addressed directly. In real intelligence analysis, if one source is compromised, experienced analysts do not collapse the entire assessment to the lowest available tier; they isolate the weak source and rely on stronger streams. A naive implementation of the weakest-link norm would preclude this, forcing analytical paralysis when any source is weak.</p><p>This objection has force against a scalar weakest-link rule. It does not apply to the matrix structure of DRVF. The matrix preserves source-tier information at the entry level. An analyst who identifies that the OSINT stream is compromised can exclude the relevant OSINT diagonal entry from the active matrix state and recalculate T over the remaining entries. This is a compartmentalised isolation operation, not a collapse.</p><p>Source isolation is not left to unconstrained analyst judgement. The following formal criterion governs when isolation is warranted: a source entry <italic>a</italic><italic><sub>ij</sub></italic> may be isolated if and only if (a) the entry has been assigned tier 4 under the rubric in Section 4.4, indicating partial discrediting or channel compromise, or (b) an explicit, documented evidentiary trigger, such as adversary-confirmed channel penetration or source recantation, has been recorded in the analytical log. Isolation on the basis of analyst’s personal preference or solely to raise the aggregate confidence floor, without a documented triggering condition, is impermissible within the framework. The algebraic treatment of source isolation, including the proof that <italic>T</italic>(<italic>A</italic>(–<italic>i</italic>)) ≤ <italic>T</italic>(<italic>A</italic>), is provided in <xref ref-type="app" rid="app1">Appendix A.4</xref>.</p></sec><sec id="S4_8"><title>Update protocol and assessment tracking</title><p>The update protocol is structured in such a way that it encodes the changes in the matrix state as new evidence comes in. The analyst will then do the following: (1) determine the target matrix entry associated with the relevant source stream; (2) apply a filtration level to that entry using the rubric in Section 4.4; (3) update the target matrix entry and any other matrix entries that would be impacted if the source stream were to be upgraded or downgraded; (4) recalculate the assessment tier T for all the entries that are assigned to it; and (5) record the type of evidence used (confirming the current tier, source stream upgraded, source stream downgraded, corroboration established, corroboration withdrawn, or assessment held pending), and the matrix state that results from the update in the analytical log. The log is the traceable history of the development of assessment. From the initial state of the matrix A<sub>0</sub> and the log, it’s possible to reconstruct the matrix state at any step by applying the sequence of operations that were recorded.</p><p>An optional visualisation of the update path was explored in earlier versions of this work. That visualisation used a hexagonal adjacency structure to encode six transition types as directions on a grid. Testing whether this visualisation reduces cognitive load or improves analyst performance is an empirical question. The visualisation has been moved to <xref ref-type="app" rid="app1">Appendix A.5</xref> and is presented there as a provisional design, not as a required component of the framework.</p></sec></sec><sec id="S5"><title>Worked example</title><p>The following worked example traces the matrix state of DRVF through five successive evidence updates in the cyber-disinformation scenario introduced in Section 4.1. The example is schematic: reliability assignments follow the rubric in Section 4.4, but the scenario is constructed for illustrative clarity and does not replicate an actual operational case. At each step, both the algebraic operation and its operational meaning are described. The structural behaviour illustrated (conservative floor maintenance and source isolation without collapse) is directly analogous to the structural failure modes documented in the two declassified episodes cited in Section 1: the pre-September 2001 integration failure and the Iraq WMD assessment. In both cases, the absence of a formal floor constraint and a compartmentalised source structure allowed weak-evidence contributions to elevate aggregate confidence. The successive matrix states are presented in <xref ref-type="table" rid="T2">Table 2</xref> and show how DRVF would formally prevent that outcome by construction.</p><table-wrap id="T2" orientation="portrait" position="float"><label>Table 2</label><caption><p>DRVF matrix state evolution: Cyber-disinformation assessment scenario. Note: All entries are schematic. Tier assignments follow the rubric in Section 4.4. T(A) = max over all active, non-zero, tier-assigned matrix entries. Lower T indicates higher confidence. Source isolation in S<sub>3</sub> is triggered by the formal criterion in Section 4.7. The update path S<sub>0</sub>→S<sub>1</sub>→S<sub>2</sub>→S<sub>3</sub>→S<sub>4</sub> constitutes the auditable record.</p></caption><table frame="border" rules="groups"><tbody valign="top"><tr><td align="left">S<sub>0</sub>: Initial</td><td align="left">SIGINT: Tech indicators (tier 1); HUMINT: partial validation (tier 2); OSINT: abundant but manipulated domain (tier 3)</td><td align="left">diag(1, 2, 3); off-diagonal = 0 (no cross-validation).</td><td align="left">3</td><td align="left">Floor anchored by OSINT at tier 3 (the weakest active source). The max over active tier-assigned entries is 3. No cross-stream corroboration established.</td></tr><tr><td align="left">S<sub>1</sub>: SIGINT-HUMINT corroboration</td><td align="left">Second SIGINT fragment confirms HUMINT indicator; corroboration assigned tier 2 (weaker stream)</td><td align="left">a<sub>1</sub><sub>2</sub> = tier 2 added. Diagonal unchanged.</td><td align="left">3</td><td align="left">New off-diagonal records that two streams agree. Corroboration is logged at the weaker stream’s tier (HUMINT, tier 2). Floor unchanged: T remains 3 because OSINT diagonal at tier 3 still dominates the max.</td></tr><tr><td align="left">S<sub>2</sub>: OSINT partial discredit</td><td align="left">Analyst judgement: Specific OSINT channel compromised; a<sub>3</sub><sub>3</sub> moves tier 3 →tier 4</td><td align="left">a<sub>3</sub><sub>3</sub> now at tier 4. Off-diagonal OSINT entries adjusted.</td><td align="left">4</td><td align="left">OSINT reliability downgraded based on evidence of channel compromise. Conservative rounding applied: when uncertain between tiers, assign the weaker (higher) tier. Floor drops from 3 to 4, reflecting the degradation of the weakest active source.</td></tr><tr><td align="left">S<sub>3</sub>: Source isolation</td><td align="left">OSINT diagonal excluded per formal criterion (tier 4 + documented channel compromise)</td><td align="left">Active matrix: diag(1, 2) + off-diagonal a<sub>1</sub><sub>2</sub>= 2. Isolated entry recorded separately.</td><td align="left">2</td><td align="left">Isolation triggered by documented evidentiarybasis, not analyst preference. Floor improves from 4 to 2: with the compromised OSINT stream removed, the weakest remaining active source is HUMINT at tier 2. The remaining streams (SIGINT, HUMINT) are evaluated on their own merits.</td></tr><tr><td align="left">S<sub>4</sub>: Independent HUMINT corroboration</td><td align="left">Second HUMINT source, independent collection, confirms operational intent at tier 2</td><td align="left">a<sub>2</sub><sub>3</sub>= tier 2 (recorded post-isolation). HUMINT diagonal unchanged.</td><td align="left">2</td><td align="left">Additional independent corroboration for HUMINT recorded. Floor remains 2 (HUMINT diagonal at tier 2). The path S<sub>0</sub>→S<sub>1</sub>→S<sub>2</sub>→S<sub>3</sub>→S<sub>4</sub> is recorded in the analytical log.</td></tr></tbody></table></table-wrap><p>Two properties of the framework are illustrated by this example. First, the assessment-tier floor is maintained throughout in accordance with the weakest-link norm: the weakest active source always determines the overall assessment tier. When OSINT degrades from tier 3 to tier 4 (step S<sub>2</sub>), In the framework’s convention, a higher numerical tier indicates lower reliability / lower confidence. Therefore the assessment tier correctly moves from 3 to 4 when the weakest active source is downgraded. When the compromised OSINT stream is formally isolated (step S<sub>3</sub>), the floor improves from 4 to 2 because the weakest remaining active source is HUMINT at tier 2. This is not an analytical escape; it is the designed behaviour of a compartmentalised isolation mechanism operating under a documented evidentiary criterion. Second, the source isolation operation demonstrates that the framework does not cause analytical paralysis when a weak source is identified. The compromised stream is formally excluded from the active assessment under the documented criterion, the remaining streams are evaluated on their own merits, and the isolation is recorded for audit purposes.</p></sec><sec id="S6" sec-type="discussion"><title>Discussion</title><sec id="S6_1"><title>What DRVF claims and does not claim</title><p>The theoretical claim of this paper is that a filtered-ring, assessment-tier framework can formalise conservative intelligence fusion in a way that simultaneously enforces the weakest-link confidence floor and preserves source-tier distinctions algebraically. This claim is theoretical: the framework is formally specified, its key algebraic properties are proven in <xref ref-type="app" rid="app1">Appendix A</xref>, and a worked example demonstrates its behaviour under the specific scenario conditions for which it is designed. The claim does not extend to empirical superiority over ACH, DST, or Bayesian networks; that question requires controlled testing under the pre-registered protocol available from the corresponding author.</p><p>A formally specified framework is a necessary but not a sufficient condition for practical utility. Whether DRVF performs better than the existing methods under the conditions for which it is designed is an empirical question. This paper does not answer it. The contribution is complete in the sense that the theoretical claim that such a framework can be formally specified with algebraically enforceable properties has been discharged. The contribution is incomplete in the sense that the empirical question it raises has not been answered.</p></sec><sec id="S6_2"><title>DRVF and conventional triangulation</title><p>Triangulation and DRVF solve similar but different analytical issues. Triangulation is a validation technique the analyst examines whether other sources come to the same conclusion, and accepts the conclusion as valid unless it is found that the other sources converge. It generates a binary or categorical convergent assessment (convergent, partially convergent, and divergent). DRVF is a mechanism for confidence tracking: it is a record of the change of the aggregate confidence as the reliability of the sources changes over time and yields a graded, formally bounded estimate that can be updated incrementally.</p><p>Three specific differences distinguish DRVF from triangulation as conventionally practiced. First, triangulation does not encode source-tier distinctions; it treats convergent sources as mutually confirming without preserving their individual reliability levels as separable, inspectable quantities. DRVF maintains these distinctions in the matrix structure. Second, triangulation does not produce a confidence metric that can be compared across assessment cycles; it answers the question “do sources agree?” but not the question “how confident should we be, given how source reliability has changed since the last assessment?” DRVF is designed to answer the second question. Third, triangulation does not enforce a conservative floor; convergent sources can jointly produce a higher confidence estimate than any individual source warrants if the analyst is not explicitly guarding against manufactured corroboration. DRVF enforces this guard by construction. The two approaches are complementary, not competing: triangulation can operate within a DRVF framework as a corroboration-checking procedure.</p></sec><sec id="S6_3"><title>Counterarguments</title><p>The weakest-link rule is operationally naive. The most substantive objection to DRVF is that the max-based assessment tier imposes an operationally unrealistic constraint. If one source is weak or compromised, real analysts do not discard the entire assessment; they isolate the weak source and rely on stronger material. Applied naively to a scalar assessment, the weakest-link rule would force combined confidence to collapse to the weakest tier regardless of whether other streams provide strong independent support. This objection has force against a scalar weakest-link rule. It does not apply to the matrix structure as specified. As demonstrated in Section 5 (step S<sub>3</sub>), the framework supports formal source isolation under a documented criterion: a compromised source entry can be excluded from the active assessment, and T is recalculated over the remaining entries. Whether analysts find the isolation operation natural and executable under time pressure is an empirical question for the evaluation protocol.</p><p>The mathematical formalism is unnecessary. Another objection is that the filtered-ring and assessment-tier structures add algebraic overhead without corresponding practical benefit. A weighted average with a min-floor or a simple fuzzy-logic system could perform the same function. This objection deserves a direct response. A weighted average with a min-floor satisfies the conservative norm on the aggregate but does not preserve source-tier information as algebraically separable entries: once the average is computed, the individual stream reliabilities are collapsed. The matrix structure keeps them distinct and trackable. The compatibility condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic> guarantees that if an element in a ring is reliable, any algebraic operation performed on it is automatically guaranteed to be reliable as well; this requirement does not need to be rechecked by the analyst at every step of fusion. The theoretical case is that these additional properties do not give rise to simpler structures, and thus are formally guaranteed; whether these additional properties are worth the cognitive overhead depends on empirical evidence. The simple-models literature (<xref ref-type="bibr" rid="ref7">Dawes, 1979</xref>; <xref ref-type="bibr" rid="ref11">Gigerenzer and Brighton, 2009</xref>) shared this concern and it is recognised as a legitimate challenge.</p><p>The formal specification is unnecessary complexity. The third objection is that intelligence analysts do not need formal mathematical specifications; they need clear procedures, good training, and sound professional judgement. This objection has practical force. Most of the intelligence organisations do not operate with formal mathematical frameworks and produce usable assessments without them. The response is that the DRVF is not intended to replace professional judgement but to supplement it with structural constraints that are difficult to enforce through procedural guidelines alone. Whether the benefit of these constraints outweighs the cost of the additional complexity is precisely the question the pre-registered evaluation study is designed to answer.</p></sec><sec id="S6_4"><title>Pilot feasibility observations</title><p>An exploratory pilot study (N = 23) was conducted to assess protocol readiness for the planned confirmatory evaluation. The pilot used intelligence-scenario materials and the source-reliability rubric described in Section 4.4. Participants were intelligence professionals with operational analytical experience. The pilot was not designed to test the framework’s performance against alternatives; its purpose was to identify whether the protocol, training materials, and scenario texts were sufficiently clear for participants to engage with the DRVF structure meaningfully.</p><p>The pilot produced the following qualitative observations, which should be interpreted with caution, given the small sample and the absence of inferential statistics. First, participants who received the standard training materials (a two-page written explanation of the framework) had difficulty applying the matrix structure to the scenario materials. This suggested that training time needed to be extended and that visual scaffolding (a prepared matrix template with pre-labelled axes) would be necessary. Second, several participants found the concept of “tier 4” and the source-isolation criterion confusing when presented in abstract form but understandable when illustrated with a concrete example. Third, the scenario texts were revised to make the evidentiary basis for tier assignments more explicit, after participants indicated that they were uncertain about which tier to assign to certain evidence items. Fourth, no participant objected to the conservative floor principle itself; the resistance was to the operational complexity of the matrix representation, not to the norm it enforced. These observations informed three protocol refinements incorporated into the pre-registered full-study design: extended DRVF training time, visual scaffolding requirements, and scenario wording revisions.</p><p>Cell sizes in the pilot (n = 7-8 per condition) preclude any inferential use. Inclusion of underpowered directional statistics in a theoretical specification paper risks creating a misleading impression of empirical validation. The pilot’s role was to identify protocol refinements, which it did. Pilot data and refinement details are available from the corresponding author on request.</p></sec><sec id="S6_5"><title>Operational implementation and analyst workload</title><p>The reviewer’s observation that the DRVF as specified resembles a Paris Fashion Week show, impressive on the runway but unobvious in its translation into everyday analyst practice, is well taken. The framework’s mathematical formalism is a specification, not an operational procedure. The question of how an analyst without graduate-level mathematics training would actually use DRVF in a working assessment deserves a direct answer, and the answer is that the operational pathway through the framework is narrower than the formal specification suggests.</p><p>There are three observations that will help to address the question of operationalisation. First, the algebraic proofs in <xref ref-type="app" rid="app1">Appendix A</xref> prove that the structural properties of the framework are true; they do not need to be checked by an analyst when using the framework. An analyst using DRVF does not have to reprove that <italic>T</italic>(<italic>A</italic>(–<italic>i</italic>)) ≤ <italic>T</italic>(<italic>A</italic>), whereas an analyst using a Bayes’ network does not have to reprove Bayes’ theorem. The mathematics is not something the analyst does in the analysis; rather, it is a guarantee on the structure. Second, the operational pathway through DRVF consists of three concrete steps: (i) assign a filtration tier to each piece of evidence, using the rubric in Section 4.4; (ii) place the tier in the appropriate diagonal or off-diagonal position in the matrix; (iii) read off T(A) as the maximum tier over the entries that are active. These steps are not symbolic algebraic steps but categorical judgements that have a rubric that has been documented. Third, software implementation of the matrix algebra is very simple: a small python or R script (less than 200 lines) can implement tier assignment, matrix update, T(A) calculation, and generation of audit-log. In addition to the confirmatory study, a reference implementation is published.</p><p>On the Science, Technology, Engineering, and Mathematics (STEM)-readiness question, the reviewer correctly notes that the UK intelligence analysts, on average, do not hold STEM degrees at the national average rate. This matters and is acknowledged. The UK Government Communications Headquarters (GCHQ) and the Joint Intelligence Committee (JIC) have historically trained analysts in structured analytical techniques, ACH, red team analysis, and key assumptions check without requiring university-level mathematics. DRVF’s operational demands are within the same range: applying the rubric is a categorical judgement; entering a tier into a 3×3 matrix is a tabular task; reading the maximum is a comparison. None of these operations requires the analyst to manipulate the underlying ring-theoretic objects. The cognitive demand is comparable to that of ACH’s matrix scoring, which is taught in introductory analyst training across North Atlantic Treaty Organization’s (NATO) member services (<xref ref-type="bibr" rid="ref14">Heuer and Pherson, 2019</xref>). The pilot feasibility study (Section 6.4) confirmed that the principal obstacle was not mathematical capacity but familiarity with the rubric’s tier distinctions; participants who received extended training with concrete examples engaged with the framework successfully.</p><p>On time budget, a back-of-envelope estimate based on the pilot is as follows. Initial matrix setup for afresh assessment of three streams, initial tier assignments for 8-12 evidence items, rubric consultation, and audit-log initialisation takes approximately 25-35 minutes. A per-update cycle as new evidence arrives tier assignment for the new item, matrix update, T(A) recalculation, log entry takes approximately 5-10 minutes. Source isolation under the Section 4.7 criterion verification of trigger condition, isolation operation, log entry, and recalculation takes approximately 10-15 minutes. These estimates assume a trained analyst working without software support; a software-assisted implementation would compress per-update time to less than 2 minutes by automating matrix bookkeeping. The estimates are within the range that operational all-source analysts routinely allocate to ACH or Bayesian belief network updating for comparable scenarios.</p><p>The framework is therefore not a Paris Fashion Week artefact in any operationally relevant sense. The algebraic specification is rigorous because the structural guarantees it provides conservative floor preservation, source-tier compartmentalisation, and auditability need to be provable, not because the analyst must re-derive them. The operational pathway through the framework is a sequence of categorical judgements comparable in difficulty with the existing structured analytical techniques. What DRVF adds operationally is the conservative floor as a structural constraint that cannot be inadvertently violated, not a body of mathematical machinery that the analyst must master. The mathematical sophistication is in the specification; the operational practice is in the rubric.</p><p>A software reference implementation is in preparation and will be released as an open-source tool alongside the confirmatory study. The implementation will provide: a guided tier-assignment interface grounded in the Section 4.4 rubric; automatic matrix update and T(A) recalculation; a structured audit log; and an isolation-operation workflow that enforces the Section 4.7 criterion. The tool is intended to make DRVF usable for analysts without requiring any direct engagement with the underlying algebra. This is the practical operationalisation pathway, and it is the route through which the framework, if empirically validated, would enter working analytical practice.</p></sec><sec id="S6_6"><title>Boundary conditions</title><p>The framework is valid under three assumptions: (a) the number of primary source classes is analytically meaningful for the context (the current specification uses three, but this is a modelling choice, not a universal claim); (b) conservative propagation is a normatively appropriate constraint for the specific failure mode being guarded against (manufactured corroboration in an adversarial environment); and (c) a record of assessment evolution is operationally useful. Outside these conditions, the framework should be modified rather than defended as universal. DRVF is not appropriate for stable multi-sensor environments where priors are well specified (Bayesian methods are better suited), for tasks where speed is paramount and cognitive overhead cannot be accepted, or for contexts with more than three primary source classes without architectural revision.</p></sec><sec id="S6_7"><title>Positionality and independent replication</title><p>The author’s background as an operational intelligence and security professional informed the scenario design with ecological validity that would otherwise be difficult to achieve. It also created the risk that the problem was framed in ways that favour the proposed solution. The blind coding procedure, pre-registration, and open materials commitment described in the evaluation protocol were designed specifically to mitigate this risk. Future independent replication by researchers without practitioner backgrounds would provide the strongest available test of whether the architectural properties, not the author’s assumptions, drive any observed performance differences. All scenario texts, the rubric, coding instructions, and anonymised response data will be deposited in a public repository upon publication of the confirmatory study.</p></sec><sec id="S6_8"><title>Hybrid crises as the primary application domain</title><p>The framework’s motivating domain warrants explicit discussion. Hybrid crises, the concurrent deployment of military, cyber, information-warfare, and economic instruments by state or non-state actors create a specific and acute version of the general fusion problem that DRVF addresses. Three features of hybrid crises make them particularly demanding environments for multi-source confidence tracking. First, the number and diversity of relevant collection disciplines expand rapidly: a hybrid crisis may simultaneously require assessment of SIGINT, HUMINT, OSINT, financial intelligence, and geospatial intelligence, each with different reliability characteristics and different vulnerability profiles to adversarial manipulation. Second, the adversarial actor has an incentive and a capacity to manipulate specific evidence streams: disinformation operations directly target OSINT inputs, while cyber operations can degrade or fabricate technical indicators. Third, the tempo of operations in a hybrid crisis compresses the decision cycle, reducing the time available for careful source evaluation and increasing the risk that a single compromised stream will contaminate the aggregate picture through apparent corroboration. The two declassified episodes cited in Section 1, while predating the contemporary “hybrid warfare” debate, exhibit precisely these structural features: multiple collection disciplines, active manipulation of at least one stream, and time pressure that discouraged the type of slow and careful source-by-source evaluation that might have prevented the overconfident assessments that followed.</p><p>It is important to reiterate that DRVF is not specific to hybrid crises. The three structural conditions the framework requires unstable source reliability, adversarial manipulation potential, and auditability requirements are present in many intelligence contexts. The framework’s mathematical properties hold, regardless of the domain in which it is applied. Hybrid crises are the motivating domain because they concentrate all three conditions in a form that makes the need for a formal conservative mechanism most visible and most consequential. The <xref ref-type="bibr" rid="ref21">NATO Hybrid Centre of Excellence (2022)</xref> has noted that strategic-communications challenges in hybrid environments are a recognised gap; the present framework addresses the analytical rather than the communications dimension of that gap, but the underlying problem distinguishing genuine from manufactured corroboration across multiple evidence streams is the same.</p></sec></sec><sec id="S7" sec-type="conclusions"><title>Conclusions</title><p>This paper has presented DRVF, a formally specified framework for conservative multi-source intelligence fusion. The core architecture integrates two layers: a filtered-ring representation that preserves source-tier distinctions algebraically, and an assessment-tier aggregation rule that enforces the weakest-link confidence floor. Both layers are formally specified, algebraic properties are proven in <xref ref-type="app" rid="app1">Appendix A</xref>, and the behaviour of the framework under a realistic operational scenario drawn from the hybrid-crisis domain is demonstrated through a worked example.</p><p>Two declassified historical episodes, the pre-September 2001 intelligence integration failures documented by the 9/11 Commission (<xref ref-type="bibr" rid="ref28">US Government Printing Office, 2004</xref>) and the Iraq WMD assessment analysed by <xref ref-type="bibr" rid="ref15">Jervis (2010)</xref>, provided concrete grounding for the problem that the framework addresses. Both involved multi-causal failures; the structural contribution of this paper is specific to the formal dimension: the absence of an algebraic constraint, preventing weak-evidence contributions from elevating aggregate confidence. The gap claim is stated conservatively as a relative contribution: no framework combining conservative weakest-link aggregation, hierarchical source compartmentalisation, and traceable assessment evolution in an intelligence-fusion context was identified in the reviewed corpus.</p><p>The framework is proposed as a formally specified, testable candidate. Whether it performs better than ACH, DST, or Bayesian networks under the conditions for which it is designed is an empirical question. A pre-registered evaluation protocol has been designed and is available from the corresponding author. No empirical performance claims are made.</p><p>Three operational directions for further work follow from the framework as specified. First, the planned confirmatory evaluation (pre-registered, N = 75) will test whether DRVF, used with the rubric and supporting materials, produces analytical outcomes that meet or exceed those of ACH and Bayesian belief networks on the specific failure modes the framework targets: conservative floor maintenance under source compromise, source-tier preservation under fusion, and audit-trajectory completeness. Second, a software reference implementation of matrix algebra, tier-assignment interface, and audit-log generation is under preparation. The implementation is intended to remove the algebraic overhead from operational use, leaving the analyst to perform the categorical judgements (rubric assignment and isolation decisions) that DRVF requires. Third, integration with the existing structured analytical techniques is a natural extension: DRVF’s matrix can serve as a confidence-tracking layer beneath ACH’s hypothesis-scoring matrix, providing the trajectory record that ACH lacks. Each of these directions is operationally tractable; none requires the analyst to engage with the underlying ring-theoretic specification.</p></sec></body><back><sec id="S8" sec-type="financial-disclosure"><title>Funding</title><p>This research received no external funding.</p></sec><sec id="S9"><title>Data Availability Statement</title><p>Data sharing is not applicable to this article.No new empirical datasets were generated or analysed in this study. The pilot observations are qualitative and available from the corresponding author on reasonable request, subject to institutional confidentiality constraints.</p></sec><sec id="S10"><title>Artificial Intelligence Disclosure Statement</title><p>During the preparation of this manuscript, the author did not use generative artificial intelligence tools. The author takes full responsibility for the content of the manuscript.</p></sec><sec id="S11"><title>Disclosure Statement</title><p>No potential conflict of interest was reported by the authors.</p><p>The authors read and agreed to the published version of the manuscript.</p></sec><ref-list><ref id="ref1"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Anjom SHoa</surname>, <given-names>M.H</given-names></string-name>. and <string-name><surname>Hosseini</surname>, <given-names>M.H</given-names></string-name></person-group>. (<year>2016</year>) <article-title>‘Filtration and Dubrovin valuation on matrix ring, Asian-European’</article-title>, <source><italic>Journal of Mathematics</italic></source>, <volume>9</volume>(<issue>1</issue>), p. <fpage>1650011</fpage>. doi: <pub-id pub-id-type="doi">10.1142/S179355711650011X</pub-id>.</mixed-citation></ref><ref id="ref2"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Betts</surname>, <given-names>R.K</given-names></string-name></person-group>. (<year>2002</year>) <article-title>‘Fixing intelligence’</article-title>, <source><italic>Foreign Affairs</italic></source>, <volume>81</volume>(<issue>1</issue>), pp. <fpage>43</fpage>–<lpage>59</lpage>.</mixed-citation></ref><ref id="ref3"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bousquet</surname>, <given-names>A</given-names></string-name></person-group>. (<year>2009</year>) <chapter-title><italic>The scientific way of warfare: Order and chaos on the battlefields of modernity</italic></chapter-title>. <publisher-loc>London: Hurst / New York</publisher-loc>: <publisher-name>Columbia University Press</publisher-name>.</mixed-citation></ref><ref id="ref4"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Caliskan</surname>, <given-names>M</given-names></string-name>. and <string-name><surname>Liégeois</surname>, <given-names>M</given-names></string-name></person-group>. (<year>2021</year>) <article-title>‘The concept of “hybrid warfare” undermines NATO’s strategic thinking: insights from interviews with NATO officials’</article-title>, <source><italic>Small Wars &amp; Insurgencies</italic></source>, <volume>32</volume>(<issue>2</issue>), pp. <fpage>295</fpage>–<lpage>319</lpage>. doi: <pub-id pub-id-type="doi">10.1080/09592318.2020.1860374</pub-id>.</mixed-citation></ref><ref id="ref5"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Castanedo</surname>, <given-names>F</given-names></string-name></person-group>. (<year>2013</year>) <article-title>‘A review of data fusion techniques’</article-title>, <source><italic>The Scientific World Journal</italic></source>, <volume>2013</volume>, <comment>art. no. 704504</comment>. doi: <pub-id pub-id-type="doi">10.1155/2013/704504</pub-id>.</mixed-citation></ref><ref id="ref6"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chang</surname>, <given-names>W</given-names></string-name>., <string-name><surname>Berdini</surname>, <given-names>E</given-names></string-name>., <string-name><surname>Mandel</surname>, <given-names>D.R</given-names></string-name>. and <string-name><surname>Tetlock</surname>, <given-names>P.E</given-names></string-name></person-group>. (<year>2018</year>) <article-title>‘Restructuring structured analytic techniques in intelligence’</article-title>, <source><italic>Intelligence and National Security</italic></source>, <volume>33</volume>(<issue>3</issue>), pp. <fpage>337</fpage>–<lpage>356</lpage>. doi: <pub-id pub-id-type="doi">10.1080/02684527.2017.1400230</pub-id>.</mixed-citation></ref><ref id="ref7"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dawes</surname>, <given-names>R.M</given-names></string-name></person-group>. (<year>1979</year>) <article-title>‘The robust beauty of improper linear models in decision making’</article-title>, <source><italic>American Psychologist</italic></source>, <volume>34</volume>(<issue>7</issue>), pp. <fpage>571</fpage>–<lpage>582</lpage>. doi: <pub-id pub-id-type="doi">10.1037/0003-066X.34.7.571</pub-id>.</mixed-citation></ref><ref id="ref8"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dempster</surname>, <given-names>A.P</given-names></string-name></person-group>. (<year>1967</year>) <article-title>‘Upper and lower probabilities induced by a multivalued mapping’</article-title>, <source><italic>Annals of Mathematical Statistics</italic></source>, <volume>38</volume>(<issue>2</issue>), pp. <fpage>325</fpage>–<lpage>339</lpage>. doi: <pub-id pub-id-type="doi">10.1214/aoms/1177698950</pub-id>.</mixed-citation></ref><ref id="ref9"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Echevarria</surname>, <given-names>A. J</given-names>., <suffix>II</suffix></string-name></person-group>. (<year>2016</year>) <chapter-title><italic>Operating in the gray zone: An alternative paradigm for U.S. military strategy</italic></chapter-title>. <publisher-loc>Carlisle, PA</publisher-loc>: <publisher-name>Strategic Studies Institute, U.S. Army War College</publisher-name>.</mixed-citation></ref><ref id="ref10"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Friedman</surname>, <given-names>J.A</given-names></string-name>. and <string-name><surname>Zeckhauser</surname>, <given-names>R</given-names></string-name></person-group>. (<year>2012</year>) <article-title>‘Assessing uncertainty in intelligence’</article-title>, <source><italic>Intelligence and National Security</italic></source>, <volume>27</volume>(<issue>6</issue>), pp. <fpage>824</fpage>–<lpage>847</lpage>. doi: <pub-id pub-id-type="doi">10.1080/02684527.2012.708275</pub-id>.</mixed-citation></ref><ref id="ref11"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gigerenzer</surname>, <given-names>G</given-names></string-name>. and <string-name><surname>Brighton</surname>, <given-names>H</given-names></string-name></person-group>. (<year>2009</year>) <article-title>‘Homo heuristicus: Why biased minds make better inferences’</article-title>, <source><italic>Topics in Cognitive Science</italic></source>, <volume>1</volume>(<issue>1</issue>), pp. <fpage>107</fpage>–<lpage>143</lpage>. doi: <pub-id pub-id-type="doi">10.1111/j.1756-8765.2008.01006.x</pub-id>.</mixed-citation></ref><ref id="ref12"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Hall</surname>, <given-names>D.L</given-names></string-name>. and <string-name><surname>Llinas</surname>, <given-names>J</given-names></string-name></person-group>. (<year>2001</year>) <chapter-title><italic>Handbook of multisensor data fusion</italic></chapter-title>. <publisher-loc>Boca Raton, FL</publisher-loc>: <publisher-name>CRC Press</publisher-name>.</mixed-citation></ref><ref id="ref13"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Herman</surname>, <given-names>M</given-names></string-name></person-group>. (<year>1996</year>) <chapter-title><italic>Intelligence power in peace and war</italic></chapter-title>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref><ref id="ref14"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Heuer</surname>, <given-names>R.J</given-names>., <suffix>Jr</suffix></string-name>. and <string-name><surname>Pherson</surname>, <given-names>R.H</given-names></string-name></person-group>. (<year>2019</year>) <chapter-title><italic>Structured analytic techniques for intelligence analysis</italic></chapter-title>. <edition>3rd edn</edition>. <publisher-loc>Washington, DC</publisher-loc>: <publisher-name>CQ Press</publisher-name>.</mixed-citation></ref><ref id="ref15"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Jervis</surname>, <given-names>R</given-names></string-name></person-group>. (<year>2010</year>) <chapter-title><italic>Why intelligence fails: Lessons from the Iranian Revolution and the Iraq War</italic></chapter-title>. <publisher-loc>Ithaca, NY</publisher-loc>: <publisher-name>Cornell University Press</publisher-name>.</mixed-citation></ref><ref id="ref16"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kent</surname>, <given-names>S</given-names></string-name></person-group>. (<year>1949</year>) <chapter-title><italic>Strategic intelligence for American world policy</italic></chapter-title>. <publisher-loc>Princeton, NJ</publisher-loc>: <publisher-name>Princeton University Press</publisher-name>.</mixed-citation></ref><ref id="ref17"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Liggins</surname>, <given-names>M.E</given-names></string-name>., <string-name><surname>Hall</surname>, <given-names>D.L</given-names></string-name>. and <string-name><surname>Llinas</surname>, <given-names>J</given-names></string-name>. (Eds)</person-group> (<year>2009</year>) <chapter-title><italic>Handbook of multisensor data fusion: Theory and practice</italic></chapter-title>. <edition>2nd edn</edition>. <publisher-loc>Boca Raton, FL</publisher-loc>: <publisher-name>CRC Press</publisher-name>.</mixed-citation></ref><ref id="ref18"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mandel</surname>, <given-names>D.R</given-names></string-name>. and <string-name><surname>Barnes</surname>, <given-names>A</given-names></string-name></person-group>. (<year>2014</year>) <article-title>‘Accuracy of forecasts in strategic intelligence’</article-title>, <source><italic>Proceedings of the National Academy of Sciences</italic></source>, <volume>111</volume>(<issue>30</issue>), pp. <fpage>10984</fpage>–<lpage>10989</lpage>. doi: <pub-id pub-id-type="doi">10.1073/pnas.1406138111</pub-id>.</mixed-citation></ref><ref id="ref19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Muñoz-González</surname>, <given-names>L</given-names></string-name>. and <string-name><surname>Lupu</surname>, <given-names>E.C</given-names></string-name></person-group>. (<year>2017</year>) <article-title>‘Bayesian adversarial learning: A framework and its use for adversarial network hardening’, in <italic>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</italic></article-title>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>IEEE</publisher-name>, pp. <fpage>3644</fpage>–<lpage>3651</lpage>.</mixed-citation></ref><ref id="ref20"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Murphy</surname>, <given-names>C.K</given-names></string-name></person-group>. (<year>2000</year>) <article-title>‘Combining belief functions when evidence conflicts’</article-title>, <source><italic>Decision Support Systems</italic></source>, <volume>29</volume>(<issue>1</issue>), pp. <fpage>1</fpage>–<lpage>9</lpage>. doi: <pub-id pub-id-type="doi">10.1016/S0167-9236(99)00084-6</pub-id>.</mixed-citation></ref><ref id="ref21"><mixed-citation publication-type="web"><person-group person-group-type="author"><collab>NATO Hybrid Centre of Excellence</collab></person-group> (<year>2022</year>): <article-title>Accessed 12 October 2026. <xref ref-type="bibr" rid="ref28">US Government Printing Office (2004)</xref></article-title>: <comment>Accessed 12 October 2026. <ext-link ext-link-type="uri" xlink:href="https://www.9-11commission.gov/report/">https://www.9-11commission.gov/report/</ext-link></comment></mixed-citation></ref><ref id="ref22"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pearl</surname>, <given-names>J</given-names></string-name></person-group>. (<year>1988</year>) <chapter-title><italic>Probabilistic reasoning in intelligent systems: Networks of plausible inference</italic></chapter-title>. <publisher-loc>San Francisco, CA (San Mateo, CA)</publisher-loc>: <publisher-name>Morgan Kaufmann</publisher-name>.</mixed-citation></ref><ref id="ref23"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rieber</surname>, <given-names>S</given-names></string-name></person-group>. (<year>2004</year>) <article-title>‘Intelligence analysis and judgmental calibration’</article-title>, <source><italic>International Journal of Intelligence and CounterIntelligence</italic></source>, <volume>17</volume>(<issue>1</issue>), pp. <fpage>97</fpage>–<lpage>112</lpage>. doi: <pub-id pub-id-type="doi">10.1080/08850600490273431</pub-id>.</mixed-citation></ref><ref id="ref24"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sentz</surname>, <given-names>K</given-names></string-name>. and <string-name><surname>Ferson</surname>, <given-names>S</given-names></string-name></person-group>. (<year>2002</year>) <chapter-title><italic>Combination of evidence in Dempster-Shafer theory</italic> (SAND2002-0835)</chapter-title>. <publisher-loc>Albuquerque, NM</publisher-loc>: <publisher-name>Sandia National Laboratories</publisher-name>.</mixed-citation></ref><ref id="ref25"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Shafer</surname>, <given-names>G</given-names></string-name></person-group>. (<year>1976</year>) <chapter-title><italic>A mathematical theory of evidence</italic></chapter-title>. <publisher-loc>Princeton, NJ</publisher-loc>: <publisher-name>Princeton University Press</publisher-name>.</mixed-citation></ref><ref id="ref26"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Smets</surname>, <given-names>P</given-names></string-name></person-group>. (<year>1990</year>) <article-title>‘The combination of evidence in the transferable belief model’</article-title>, <source><italic>IEEE Transactions on Pattern Analysis and Machine Intelligence</italic></source>, <volume>12</volume>(<issue>5</issue>), pp. <fpage>447</fpage>–<lpage>458</lpage>. doi: <pub-id pub-id-type="doi">10.1109/34.55104</pub-id>.</mixed-citation></ref><ref id="ref27"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tricco</surname>, <given-names>A.C</given-names></string-name>., <string-name><surname>Lillie</surname>, <given-names>E</given-names></string-name>., <string-name><surname>Zarin</surname>, <given-names>W</given-names></string-name>., <string-name><surname>O’Brien</surname>, <given-names>K.K</given-names></string-name>., <string-name><surname>Colquhoun</surname>, <given-names>H</given-names></string-name>., <string-name><surname>Levac</surname>, <given-names>D</given-names></string-name>. <etal>et al</etal></person-group>. (<year>2018</year>) <article-title>‘PRISMA extension for scoping reviews (PRISMA-ScR): Checklist and explanation’</article-title>, <source><italic>Annals of Internal Medicine</italic></source>, <volume>169</volume>(<issue>7</issue>), pp. <fpage>467</fpage>–<lpage>473</lpage>. doi: <pub-id pub-id-type="doi">10.7326/M18-0850</pub-id>.</mixed-citation></ref><ref id="ref28"><mixed-citation publication-type="web"><person-group person-group-type="author"><collab>US Government Printing Office</collab></person-group> (<year>2004</year>) <article-title><italic>The 9/11 commission report: Final report of the national commission on terrorist attacks upon the United States</italic></article-title>. <source>US Government Printing Office</source>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://www.9-11commission.gov/report/">https://www.9-11commission.gov/report/</ext-link> (Accessed: xxx).</comment></mixed-citation></ref><ref id="ref29"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>van Ditmarsch</surname>, <given-names>H</given-names></string-name>., <string-name><surname>van der Hoek</surname>, <given-names>W</given-names></string-name>. and <string-name><surname>Kooi</surname>, <given-names>B</given-names></string-name></person-group>. (<year>2007</year>) <article-title><italic>Dynamic epistemic logic</italic></article-title>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>. doi: <pub-id pub-id-type="doi">10.1007/978-1-4020-5839-4</pub-id>.</mixed-citation></ref><ref id="ref30"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yager</surname>, <given-names>R.R</given-names></string-name></person-group>. (<year>1987</year>) <article-title>‘On the Dempster-Shafer framework and new combination rules’</article-title>, <source><italic>Information Sciences</italic></source>, <volume>41</volume>(<issue>2</issue>), pp. <fpage>93</fpage>–<lpage>137</lpage>. doi: <pub-id pub-id-type="doi">10.1016/0020-0255(87)90007-7</pub-id>.</mixed-citation></ref></ref-list><app-group><app id="app1"><title>Appendix A: Formal algebraic proofs and supplementary specifications</title><sec id="S12"><title>A.1. Minimal algebraic setting</title><p>Let <italic>R</italic> be a non-zero non-commutative ring with filtration {<italic>R</italic><italic><sub>k</sub></italic>}<italic><sub>k</sub></italic> ≥ 0 satisfying <italic>R</italic><sub>0</sub> = <italic>R, R</italic><italic><sub>k</sub></italic><sub>+1</sub>⊆ <italic>R</italic><italic><sub>k</sub></italic>, and <italic>R</italic><italic><sub>k</sub></italic><italic>R</italic><italic><sub>m</sub></italic> ⊆ <italic>R</italic><italic><sub>k+m</sub></italic>. The compatibility condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic> aligns algebraic grading with reliability tiers. This is a parametric design choice, not a universal property of filtered rings (<xref ref-type="bibr" rid="ref1">Anjom Shoa, 2016</xref>).</p></sec><sec id="S13"><title>A.2. Quasi-valuation properties: proofs</title><p><list list-type="bullet"><list-item><p>Claim A.2.1 (addition). For <italic>A,B</italic> ∈ <italic>M</italic><sub>3</sub> (<italic>R</italic>), ϑ(<italic>A</italic> + <italic>B</italic>) ≥ min{ϑ(<italic>A</italic>),ϑ(<italic>B</italic>)}.</p></list-item></list></p><p>Proof: By the entry-wise minimum extension:</p><p>ϑ(<italic>A</italic> + <italic>B</italic>) = min<italic><sub>ij</sub></italic> ϑ(<italic>a</italic><italic><sub>ij</sub></italic> + <italic>b</italic><italic><sub>ij</sub></italic>) ≥ min<italic><sub>ij</sub></italic> min{ϑ(<italic>a</italic><italic><sub>ij</sub></italic>),ϑ(<italic>b</italic><italic><sub>ij</sub></italic>)} = min(min<italic><sub>ij</sub></italic> ϑ(<italic>a</italic><italic><sub>ij</sub></italic>), min<italic><sub>ij</sub></italic> ϑ(b<italic><sub>ij</sub></italic>))=min{ϑ(<italic>A</italic>), ϑ(<italic>B</italic>)}.</p><p><list list-type="bullet"><list-item><p>Claim A.2.2 (multiplication). For <italic>A,B</italic> ∈ <italic>M</italic><sub>3</sub>(<italic>R</italic>), ϑ(<italic>AB</italic>) ≥ ϑ(<italic>A</italic>)+ ϑ(B).</p></list-item></list></p><p>Proof: For entry (<italic>AB</italic>)<italic><sub>ij</sub></italic> = Σ<italic><sub>k</sub></italic><italic>a</italic><italic><sub>ik</sub></italic><italic>b</italic><italic><sub>kj</sub></italic>. By the quasi-valuation ring axiom: ϑ(<italic>a</italic><italic><sub>ik</sub></italic>b<italic><sub>kj</sub></italic>) ≥ ϑ(<italic>a</italic><italic><sub>ij</sub></italic>) + ϑ(<italic>b</italic><italic><sub>kj</sub></italic>)≥ ϑ(<italic>A</italic>)+ ϑ(B). Since ϑ of a sum is bounded by the minimum: ϑ(Σ<italic><sub>k</sub></italic> <italic>a</italic><italic><sub>ik</sub></italic><italic>b</italic><italic><sub>kj</sub></italic>) ≥ min<italic><sub>k</sub></italic>{ϑ(<italic>a</italic><italic><sub>ik</sub></italic><italic>bkj</italic>)} ≥ ϑ(<italic>A</italic>)+ ϑ(<italic>B</italic>). Therefore, ϑ(AB)= min<italic><sub>ij</sub></italic> ϑ((<italic>AB</italic>)<italic><sub>ij</sub></italic>)≥ ϑ(<italic>A</italic>)+ ϑ(B).</p><p><list list-type="bullet"><list-item><p>Claim A.2.3 (weakest-link encoding). If A contains a non-zero tier-assigned entry <italic>a</italic><italic><sub>ij</sub></italic> at filtration level k, then <italic>T</italic>(<italic>A</italic>) ≥ <italic>k</italic>.</p></list-item></list></p><p>Proof. By definition, <italic>T</italic>(<italic>A</italic>) = max{τ(<italic>a</italic><sub>00</sub> ): <italic>a</italic><sub>00</sub> ≠ 0} ≥ τ(<italic>a</italic><italic><sub>ij</sub></italic>)= <italic>k</italic>. No combination of other entries can lower the maximum below k. To improve T(A) below k, the entry <italic>a</italic><italic><sub>ij</sub></italic> must be upgraded to a lower filtration level or removed from the active matrix state.</p><p>Remark. The distinction between ϑ and T is structural. The quasi-valuation ϑ(<italic>A</italic>) = min<italic><sub>ij</sub></italic> ϑ(<italic>a</italic><italic><sub>ij</sub></italic>) provides an algebraic lower bound on individual entry valuations and is essential for proving that the filtration structure is preserved under ring operations. The assessment tier <italic>T</italic>(<italic>A</italic>) = max{τ(<italic>a</italic><italic><sub>ij</sub></italic>)} implements the weakest-link norm by selecting the highest (weakest) filtration tier among all active entries. Under the compatibility condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic>, we have τ(<italic>a</italic>) ≤ ϑ(<italic>a</italic>) for any tier-assigned element <italic>a</italic>, and therefore, <italic>T</italic>(<italic>A</italic>) ≤ maxϑ(<italic>a</italic><italic><sub>ij</sub></italic>) for all tier-assigned entries. The two functions provide complementary information: ϑ ensures algebraic coherence, and T enforces the conservative constraint.</p></sec><sec id="S14"><title>A.3. Compatibility condition</title><p>The condition ϑ(<italic>R</italic><italic><sub>k</sub></italic>) ≥ <italic>k</italic> is a local design constraint aligning algebraic grading with reliability tiers. If the tier structure of a specific operational context requires a different alignment, the compatibility condition should be revised accordingly without affecting the broader architecture.</p></sec><sec id="S15"><title>A.4. Source isolation operation</title><p>Let <italic>A</italic> ∈ <italic>M</italic><sub>3</sub> (<italic>R</italic>) be the current matrix state. Isolation of source stream <italic>i</italic> is warranted if and only if the formal criterion in Section 4.7 is satisfied: diagonal entry <italic>a</italic><italic><sub>ij</sub></italic> has been assigned tier 4, or an explicit documented evidentiary trigger has been recorded in the analytical log. Define the isolated matrix <italic>A</italic>(–<italic>i</italic>) as A with row i and column i set to zero (excluded from the domain of T). Then:</p><p><italic>T</italic>(<italic>A</italic>(–<italic>i</italic>)) = max <italic>over p,q</italic> ∈ {1,2,3}, <italic>p</italic> ≠ <italic>i, q</italic> ≠ <italic>i</italic> of τ(<italic>a</italic><sub>0</sub><italic><sub>e</sub></italic>).</p><p>This is a well-defined operation within the algebraic structure, and <italic>T</italic>(<italic>A</italic>(–<italic>i</italic>)) ≤ <italic>T</italic>(<italic>A</italic>) because the maximum over a subset of entries cannot exceed the maximum over all entries. The excluded entries are placed in a separate isolation log, forming part of the auditable update path. Reintegration of an isolated source, if subsequent evidence rehabilitates it, requires the analyst to explicitly restore the relevant entries and document the evidentiary basis.</p></sec><sec id="S16"><title>A.5. Optional visualisation (provisional)</title><p>Earlier versions of this work included a geometric visualisation layer that encoded analytical state transitions as a walk on a hexagonal grid. Six transition types were mapped to six local directions on the grid, providing a compact visual representation of the assessment path. This visualisation has been moved to a provisional appendix entry because its cognitive and operational properties require empirical testing. If testing reveals that the hexagonal structure does not reduce cognitive load or that a directed acyclic graph with timestamps serves equally well, the visualisation should be revised or replaced without affecting the core algebraic architecture. A directed acyclic graph with timestamps is a valid alternative that imposes no constraint on the number of distinct update types.</p></sec><sec id="S17"><title>A.6. Institutional review board (IRB) and pre-registration</title><p>The pilot feasibility study was carried out under the review protocol of the sponsoring security organisation. The organisation determined that the study met the criteria for exemption from full ethics committee review under applicable national research ethics guidelines. Confidentiality requirements preclude disclosure of the organisation’s identity. The exemption determination is available for verification by journal editors on request through the corresponding author, subject to applicable confidentiality constraints. Participants provided written informed consent. The full confirmatory study (N = 75) is pre-registered on the Open Science Framework. The registration link is to be confirmed and inserted at publication. All scenario texts, the rubric, coding instructions, training materials, and anonymised response data are to be deposited in a public repository upon publication.</p></sec><sec id="S18"><title>A.7. PRISMA-ScR flowchart</title><p>The PRISMA-ScR flowchart (Figure A1) documents the screening process in standard PRISMA-ScR diagram format (<xref ref-type="bibr" rid="ref27">Tricco et al., 2018</xref>). In all, 312 records were identified through database searching across Google Scholar, IEEE Xplore, ScienceDirect, SpringerLink, and Taylor &amp; Francis Online. After removal of forty-seven duplicate records, 265 records were screened by titles and abstracts. In all, 176 records were excluded at this stage; eighty-nine records were assessed for full-text eligibility; and forty-two records were excluded—twenty-eight did not address multi-source uncertainty in a tradecraft context, nine focused on non-adversarial sensor fusion, and five were not accessible in full text. Forty-seven records were included in the final synthesis.</p></sec></app></app-group></back></article>
