<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-17T07:55:58Z</responseDate>
  <request verb="GetRecord" identifier="oai:lifeofresearch.com:1" metadataPrefix="oai_datacite">https://lifeofresearch.com/oai2</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:lifeofresearch.com:1</identifier>
        <datestamp>2026-09-22T17:33:08Z</datestamp>
        <setSpec>type:article</setSpec>
        <setSpec>openaire</setSpec>
      </header>
      <metadata>
        <resource xmlns="http://datacite.org/schema/kernel-4" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.4/metadata.xsd">
          <identifier identifierType="DOI">10.5281/zenodo.22750268</identifier>
          <alternateIdentifiers><alternateIdentifier alternateIdentifierType="URL">https://lifeofresearch.com/articles/1</alternateIdentifier></alternateIdentifiers>
          <creators>
            <creator>
              <creatorName>Pranay Mahendrakar</creatorName>
              <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="https://orcid.org">0009-0003-7224-029X</nameIdentifier>
              <affiliation>SONYTECH</affiliation>
            </creator>
          </creators>
          <titles><title>Attribution Is Scored on a Finished Trace: What Failure-Attribution Benchmarks Measure, What Cascade Containment Would Need, and Why Neither Result Bounds the Other</title></titles>
          <publisher>Life of Research</publisher>
          <publicationYear>2026</publicationYear>
          <subjects>
            <subject>multi-agent systems</subject>
            <subject>failure attribution</subject>
            <subject>error propagation</subject>
            <subject>cascade containment</subject>
            <subject>root cause analysis</subject>
            <subject>benchmark construction</subject>
            <subject>fault localization</subject>
          </subjects>
          <resourceType resourceTypeGeneral="JournalArticle">Journal article</resourceType>
          <rightsList><rights rightsURI="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0</rights></rightsList>
          <descriptions><description descriptionType="Abstract">(c) 2026 Pranay Mahendrakar. Licensed under CC BY 4.0.
A family of recent proposals aims to stop errors from spreading through LLM-based multi-agent systems: genealogy-graph governance over message dependencies, cross-channel causal monitoring, propagation-aware remediation of contaminated state, infection-aware safeguarding, and corrector placement on the communication graph. Most of these mechanisms have to decide where a spreading error came from before they can decide what to cut. A separate and largely disjoint literature measures exactly that: automated failure attribution, the task of naming the agent and the step responsible for a failed run. Its reported accuracies at step granularity are low, and the obvious inference is that containment is built on a primitive that does not work. This paper argues that the inference is not available, in either direction, and sets out why. The attribution benchmarks score a method on a completed trace whose failure is already known to have occurred and whose ground truth is a single decisive step; a containment mechanism must act on a prefix, without knowing that a failure will occur, and its output feeds an intervention rather than a developer. Recent benchmark work reports that how much of the trace a method is shown, and whether the ground truth is allowed to be multi-valued, both move the measured accuracy substantially, which means the pessimistic numbers are not a stable property of the task. The paper also separates the containment proposals by what they localise and notes one that localises nothing at all; and it observes that the most widely used taxonomy of why these systems fail defines its first category as failures that occur during execution but reflect pre-execution design choices, for which the step a method points at is a symptom by construction. It closes with the measurements that would make the question decidable, and with the older fault-localisation literature that already ran this experiment once.
The literature search, drafting and citation verification for this paper were carried out with AI assistance under the author&apos;s direction. Every citation was machine-verified against the arXiv API and Crossref before inclusion, and every quantitative claim was read back against the cited source&apos;s own text, either its abstract or, where a claim is drawn from a paper&apos;s body, the located passage. The author is responsible for the final text and for all claims made in it.</description></descriptions>
        </resource>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>