Outcome-Evidence Layers in AI Systems

• Outcome-Evidence Layers are architectures that maintain an explicit evidential intermediate, separating evidence extraction from final predictions to enhance transparency and reliability.
• They integrate multiple processing stages—from data extraction and audit checklists to causal discovery and multimodal fusion—to support interpretable decision-making.
• These layered systems are applied in fields such as clinical NLP, cybersecurity, and prospectivity mapping, where evidence-guided actions improve outcome verifiability and performance.

Searching arXiv for papers relevant to “Outcome-Evidence Layers” and adjacent formulations. Outcome-Evidence Layers, an Editor’s term, denotes a family of architectures in which a system first specifies, extracts, represents, audits, or fuses evidence and only then commits to an outcome claim, prediction, or action. In the cited literature, this pattern appears in benchmark auditing, clinical NLP, multimodal prediction, prospectivity mapping, mechanistic interpretability, XAI design, and automata-based cybersecurity. The shared structural move is to preserve an explicit evidential intermediate—rather than collapsing reasoning into a single output score—so that uncertainty, conflict, fidelity, or causal visibility remain inspectable (Gao et al., 11 May 2026, DeYoung et al., 2020, Ruan et al., 8 Jan 2025, Ye et al., 19 Feb 2026, Alpay et al., 9 Jun 2026).

1. Conceptual schema

A three-layer formulation is explicit in the means–end framework for XAI and AI-based decision support systems. Its Evidence Layer provides data, studies, and causal-mechanistic models; its Means Layer comprises interpretable surrogates, local explainers, counterfactual engines, and causal-discovery submodels; and its Outcome Layer presents the final decision support output together with a Meaningful Human Explanation and an Outcome Reliability score. The framework introduces evidence strength $S_e$, evidence value $V_e$, and evidence utility $U_e$, with $S_e=(n-\ell+1)/n$, $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$, and $U_e=S_e\times V_e$. The Means Layer is characterized by fidelity, interpretability, and stability, including a similarity condition $E_x[d(f(x),g(x))]\le \epsilon$, while the Outcome Layer aggregates predictive accuracy with explanation-level quantities such as $F_m$, $I_m$, $S_m$, and $V_e$0 (Love et al., 2024).

A decision-theoretic analogue appears in work on actionability. There, latent state $V_e$1, measurement $V_e$2, action $V_e$3, and outcome $V_e$4 define a generative process in which an outcome-prediction layer uses $V_e$5, whereas an action-value layer chooses

$V_e$6

The associated action values satisfy $V_e$7. The paper further states that, except in the degenerate case where there is a single “sufficient” action that improves the outcome no matter what $V_e$8 is, the outcome-prediction layer cannot match the action-value layer; in its Boolean construction, $V_e$9 for all $U_e$0 (Liu et al., 2023). This suggests that outcome-evidence layering is often motivated by intervention selection rather than by predictive accuracy alone.

2. Audit layers and evidence-supported adjudication

In interactive-agent evaluation, the outcome-evidence reporting layer is introduced as an additive, post-run wrapper that does not modify tasks, agents, or native evaluators. Its purpose is to close the “outcome-evidence gap”: benchmarks often report a single success rate even when stored artifacts such as screenshots, action logs, final messages, or database dumps do not suffice to verify the claimed success. The layer therefore performs three functions. First, it specifies per-case checklists describing the benchmark’s own binary claim, the official source of that claim, the artifacts that would decide it, and the rule for when evidence is too weak and should be marked Unknown. Second, it applies a locked checklist after runs complete and assigns each record one of three labels: Evidence Pass, Evidence Fail, or Unknown. Third, it reports evidence-supported score bounds rather than a single scalar. If $U_e$1, $U_e$2, and $U_e$3 denote the counts of Pass, Fail, and Unknown over $U_e$4 completed runs, then

$U_e$5

The worked AgentDojo Slack example uses $U_e$6, $U_e$7, $U_e$8, $U_e$9, giving Lower $S_e=(n-\ell+1)/n$0, Upper $S_e=(n-\ell+1)/n$1, Width $S_e=(n-\ell+1)/n$2, and Counted-only success $S_e=(n-\ell+1)/n$3. The same paper reports several empirically distinct failure modes, including missing post-state snapshots, proxy-based evaluators, paired-arm gaps, reward/action mismatches, and target-set bugs; once Unknowns are kept explicit, AgentDojo’s three-model leaderboard becomes unresolved on all three pairwise comparisons (Gao et al., 11 May 2026).

A different thresholded adjudication scheme appears in multi-outcome clinical trial design. For $S_e=(n-\ell+1)/n$4 continuous outcomes with true mean treatment effects $S_e=(n-\ell+1)/n$5, the hypothesis is

$S_e=(n-\ell+1)/n$6

The group-sequential design computes $S_e=(n-\ell+1)/n$7 and uses Wang–Tsiatis boundaries $S_e=(n-\ell+1)/n$8, $S_e=(n-\ell+1)/n$9 for $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$0, $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$1. A “Go” decision occurs when at least $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$2 outcomes cross the upper boundary simultaneously, and a “No-go” decision occurs when at least $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$3 outcomes cross the lower boundary. The two-stage drop-the-loser design instead uses conditional power thresholds $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$4, outcome dropping, and a final efficacy boundary $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$5. Type I error is defined globally under the complete null, power is defined at a least-favourable configuration, and both are evaluated by simulation because no closed-form sample-size formula exists (Law et al., 2020). Here, stagewise test statistics function as accumulating evidence layers for a final multi-outcome decision.

3. Textual evidence extraction and context-grounded reasoning

In biomedical evidence inference, outcome–evidence separation is built directly into the annotation schema and model pipeline. Each randomized controlled trial document is paired with ICO prompts of the form (Intervention, Comparator, Outcome), and expert MD annotators assign both a three-way comparison label—“significantly increased” $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$6, “significantly decreased” $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$7, or “no significant difference” $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$8—and one or more supporting evidence spans. Annotation proceeds in three staged passes: prompt generation, prompt-level annotation, and independent verification, yielding Krippendorff’s $$V_e=w_r\cdot \mathrm{Relevance}+w_t\cdot \mathrm{Timeliness}+w_c\cdot \mathrm{Coherence}$$9. The expanded corpus contains 12,616 prompts across 3,346 distinct full-text RCTs, including 2,503 new prompts added to the original release; an abstract-only subset contains 6,375 prompts, with approximately $U_e=S_e\times V_e$0 of prompts answerable from the abstract alone but $U_e=S_e\times V_e$1 of evidence spans requiring at least one sentence from the body. The model architecture is explicitly two-step. An evidence identification layer scores sentences as evidence or non-evidence, using negative sampling because at least $U_e=S_e\times V_e$2 of sentences are non-evidence; then the single highest-scoring sentence $U_e=S_e\times V_e$3 is passed to a 3-way outcome-comparison classifier. Error analysis isolates misaligned layer failures, and oracle-sentence experiments show that perfect identification lifts end-to-end $U_e=S_e\times V_e$4 from approximately $U_e=S_e\times V_e$5 to approximately $U_e=S_e\times V_e$6 (DeYoung et al., 2020).

Prompted reasoning systems use a closely related separation. “Chain of Evidences” and “Evidence to Generate” are presented as mono/dual-step zero-shot prompting strategies that avoid unverified reasoning claims by focusing first on thought sequences explicitly mentioned in the context and then using those extracted sequences to guide generation. The paper positions this against CoT variants such as Self-consistency, ReACT, Reflexion, Tree-of-Thoughts, and Cumulative Reasoning, citing limitations including limited context grounding, hallucination/inconsistent output generation, and iterative sluggishness. Reported results include a LogiQA accuracy of $U_e=S_e\times V_e$7 with GPT-4 for CoE, surpassing CoT by $U_e=S_e\times V_e$8, ToT by $U_e=S_e\times V_e$9, and CR by $E_x[d(f(x),g(x))]\le \epsilon$0, and a DROP $E_x[d(f(x),g(x))]\le \epsilon$1 of $E_x[d(f(x),g(x))]\le \epsilon$2 for CoE with PaLM-2, exceeding the variable-shot performance of Gemini Ultra by $E_x[d(f(x),g(x))]\le \epsilon$3 points (Parvez, 2024). This suggests a layering principle in which evidence extraction and answer generation are intentionally decoupled.

4. Multimodal evidence fusion for outcome prediction

In ICU outcome prediction, the layer structure is formalized through belief function theory. The frame of discernment is $E_x[d(f(x),g(x))]\le \epsilon$4, with $E_x[d(f(x),g(x))]\le \epsilon$5 denoting an event such as mortality and $E_x[d(f(x),g(x))]\le \epsilon$6 denoting no-event; $E_x[d(f(x),g(x))]\le \epsilon$7 represents total ignorance. Structured EHRs are mapped by a structured-data encoder to an embedding $E_x[d(f(x),g(x))]\le \epsilon$8, then by an Evidence Mapping Network with $E_x[d(f(x),g(x))]\le \epsilon$9 prototypes to a modality-level mass $F_m$0. Free-text notes are processed by a pretrained LLM plus a $F_m$1-unit feed-forward layer to obtain $F_m$2, then similarly mapped to $F_m$3. Independent masses are fused by Dempster’s rule,

$F_m$4

and the combined mass is converted to a probability by the pignistic transform

$F_m$5

Conflict $F_m$6 and total uncertainty $F_m$7 are monitored but not directly added to the loss. On MIMIC-III, the framework outperformed the best baseline by $F_m$8 in BACC, $F_m$9 in $I_m$0, $I_m$1 in AUROC, and $I_m$2 in AUPRC for mortality and PLOS, with corresponding reductions of $I_m$3 in Brier score and $I_m$4 in negative log-likelihood (Ruan et al., 8 Jan 2025).

Literature-augmented prediction implements a retrieve-then-predict layering. BEEP first preprocesses admission-time clinical text, extracts “problem,” “test,” and “treatment” spans with a BERT-based tagger, filters negations with ConText, and links the remaining entities to MeSH headings via scispaCy. Retrieval then combines sparse TF–IDF cosine similarity on MeSH vectors, a dense PubmedBERT bi-encoder trained with triplet loss, and a PubmedBERT cross-encoder reranker over the union of top sparse and dense results. The top $I_m$5 abstracts are fused with the note embedding by mean pooling, weighted mean pooling, soft voting, or weighted voting, and the fused representation is passed to a linear prediction head. Reported gains include PMV micro $I_m$6 from $I_m$7 to $I_m$8, MOR micro $I_m$9 from $S_m$0 to $S_m$1, PMV positive-class precision@10% from $S_m$2 to up to $S_m$3, and MOR positive precision@10% from $S_m$4 to $S_m$5 (Naik et al., 2021).

A graph-based multimodal variant is the multiplexed graph neural network for tuberculosis outcome prediction. Here $S_m$6 modalities are encoded by domain-specific autoencoders, concatenated into a $S_m$7-dimensional representation, and passed through a common autoencoder whose $S_m$8 latent dimensions define the concept planes of a multiplexed graph. For each concept plane, perturbation saliency retains the top $S_m$9 of features, which are then fully connected to form the intra-plane adjacency. Message passing alternates two supra-walk structures, $V_e$00 and $V_e$01, before a global readout MLP produces a $V_e$02-class outcome prediction. In 10-split cross-validation, weighted AU-ROC rises from $V_e$03 for early-fusion MLP, $V_e$04 for intermediate fusion, $V_e$05 for late fusion, and $V_e$06 for relational-GCN to $V_e$07 for the proposed multiplexed GNN, with per-class AU-ROC gains of $V_e$08 to $V_e$09 significant at $V_e$10 by DeLong’s test (D'Souza et al., 2022).

5. Spatial and mechanistic evidence layers

In mineral prospectivity mapping, evidence layers are literal spatial layers produced from natural-language queries. QueryPlot preprocesses approximately $V_e$11 SGMC polygons, selects eleven text fields per polygon, concatenates them into cleaned descriptions, and dissolves rows with identical key columns to produce approximately $V_e$12 unique MultiPolygons. Descriptive deposit models are assembled from approximately $V_e$13 source documents covering $V_e$14 deposit types, summarized by few-shot GPT-4o into structured descriptions. A transformer-based sentence embedder $V_e$15 maps polygon descriptions and free-form queries into a common vector space, and cosine similarity

$V_e$16

ranks polygons. A percentile threshold $V_e$17 defines the selected set $V_e$18, which is rasterized or rendered as a continuous heatmap; export forms the evidence layer

$V_e$19

For compositional queries, buffered layers are intersected to model contact zones. In the tungsten-skarn case study, the top $V_e$20 of polygons cover nearly $V_e$21 of known sites, and with a $V_e$22 m buffer the top $V_e$23 cover approximately $V_e$24 of sites. The best tract-alignment scores include IOU $V_e$25, Precision $V_e$26, Recall $V_e$27, and $V_e$28 $V_e$29 for GTE-large-v1.5. When the fused geology-evidence layer is added as an extra band in a supervised pipeline, AUPRC improves from $V_e$30 to $V_e$31, Balanced Accuracy from $V_e$32 to $V_e$33, MCC from $V_e$34 to $V_e$35, and $V_e$36 from $V_e$37 to $V_e$38 (Ye et al., 19 Feb 2026).

A mechanistic analogue appears in a 12-layer VideoViT. The “Success vs Failure” signal is defined at layer $V_e$39 by the activation difference

$V_e$40

for the [CLS] residual stream, with scalar strength

$V_e$41

The observed cascade is delayed and concentrated: $V_e$42 grows from approximately $V_e$43 to $V_e$44, over a $V_e$45 increase, which the paper designates as the “Outcome-Evidence Layers.” Activation patching shows a division of labor between attention heads and MLP blocks. Single attention blocks recover $V_e$46 to $V_e$47 of the final signal, while MLP blocks recover $V_e$48 to $V_e$49 in layers $V_e$50–$V_e$51. Attention heads therefore act as “evidence gatherers,” supplying low-level spatio-temporal information, whereas MLP blocks are “concept composers,” generating and amplifying partial outcome concepts such as “pins-fallen” versus “pins-standing.” No single block recovers $V_e$52, and simple ablations produce only small final-logit changes of approximately $V_e$53 to $V_e$54, indicating a distributed, cumulative cascade with substantial redundancy (Chereddy, 11 Mar 2026).

6. Layer order, limitations, and interpretive cautions

In automata-based cybersecurity, outcome-evidence layering is formalized as layer-order semantics. The framework consists of four objects: a layer-order automaton $V_e$55 recognizing admissible layer sequences such as $V_e$56; deterministic sequential security transducers $V_e$57 that may copy, suppress, or insert evidence markers; a finite marker alphabet $V_e$58; and a final decision automaton $V_e$59 that accepts or rejects based on the resulting marker pattern. The theory defines marker birth, marker survival under marker-monotone layers, and reorder-sensitive visibility. It proves that, under causal visibility, total output on prefixes, transparency, soundness, and maximal permissiveness, a regular policy $V_e$60 is faithfully enforceable by a layered chain if and only if $V_e$61 is prefix-closed. It also proves monolithic equivalence to finite-output deterministic edit automata while preserving layer-local invariants. The worked HTTP request-smuggling abstraction identifies the forbidden marker factor with CL.TE, TE.CL, TE.TE, and HTTP/2-downgrade boundary disagreement; whether the marker sequence reaches the final DFA depends on the order in which framing evidence becomes visible to later layers (Alpay et al., 9 Jun 2026).

The literature also records several boundary conditions. In actionability, pure outcome prediction is optimal only in the trivial case of one action that works for everyone; otherwise action-relevant measurements dominate generic outcome prediction (Liu et al., 2023). In benchmark auditing, a high counted-only success rate can coexist with a wide uncertainty interval when Unknown cases are numerous (Gao et al., 11 May 2026). In prospectivity mapping, QueryPlot’s prototype currently uses Boolean overlap plus buffering, while a weighted-sum fusion is described as generalizable rather than implemented (Ye et al., 19 Feb 2026). In ICU prediction, conflict and total uncertainty are monitored diagnostically rather than added directly to the loss (Ruan et al., 8 Jan 2025). In biomedical evidence inference, the evidence-identification and outcome-classification layers are trained separately, and the joint objective $V_e$62 is described as a candidate formulation rather than the implemented approach (DeYoung et al., 2020). In multi-outcome trials, the drop-the-loser design is restricted to two stages, assumes a single-arm trial, continuous outcomes, and known variances and correlations; binary or ordinal endpoints, alpha-spending, and longer multi-stage drop-the-loser variants are left for further methodological work (Law et al., 2020).

Taken together, these works suggest that outcome-evidence layering is less a single algorithm than a recurrent design commitment: evidence is made explicit as an intermediate object—scores, spans, masses, markers, retrieved documents, latent-state measurements, or spatial layers—before an outcome is declared. The resulting systems differ sharply in domain and formalism, but they converge on the same methodological claim: outcome reliability depends on how evidence is represented, propagated, and exposed, not only on the final prediction or verdict.