Skip to content

Article · research february 2026 · published 2026-08-03 · v1 · 3 min read

Reconstruction, not explanation

An account of a decision that cannot be rerun is a story, and the thing that usually blocks the rerun is a library version

Why accountability for an automated decision means reconstructing the state of the machine at the moment it decided, and why the opacity that actually defeats an audit is operational rather than neural.

Topics: Measurement , Provenance at machine scale

In brief
The problem

verified

Every claim this passage rests on has been checked against its sources.

  • "Record-keeping and traceability obligations for high-risk systems are written into the European Union's AI Act, and the NIST AI Risk Management Framework makes documentation and traceability central to its guidance."

    verified. The AI Act's high-risk provisions and the published NIST framework. Reported at the level of the obligation existing, with no reading offered of how any particular deployment falls under it.

Open the complete evidence in the structured publication.

Regulators and wounded people ask why a system decided what it decided, and the standard answer is an account produced after the fact by the same system, which is a story about the decision rather than the decision itself.
The mechanism

directional

The evidence points this way but is not settled.

  • "The opacity that defeats an audit in practice is more often operational than neural, a missing library version, seed, container digest, or time zone database rather than the inscrutability of the weights."

    directional. Our forensic-provenance research record, which argues it directly and grades itself medium confidence. A claim about where audits fail in practice rather than a measured distribution of audit failures, and graded accordingly.

Open the complete evidence in the structured publication.

An explanation is generated after the event and can be checked against nothing, while a reconstruction is a rerun that can come out different, so only the second one is capable of failing and therefore only the second one is evidence.
The move

position

This is the publication's stated position, not an empirical claim. It rests on the argument rather than graded evidence.

Open the complete evidence in the structured publication.

Record the whole envelope at the moment of inference, versions, artifact hashes, environment, seeds, and every time-dependent source, then declare in advance which grade of replay the system can honour.

The complaint about automated decisions has settled into a familiar shape. The network is a black box, its reasoning is inaccessible in principle, and the best anyone can do is ask the system to explain itself afterward. The complaint is not wrong about the weights, and record-keeping and traceability obligations for high-risk systems are written into the European Union’s AI Act partly because of it. But go and try to audit an actual decision taken eighteen months ago, and the wall you hit is almost never the weights. It is that nobody recorded which release of a numerical library was installed, or what seed the sampler drew from, or which version of the time zone database was in force when a timestamp got converted.

Explanation and reconstruction are different obligations wearing the same word. An explanation is produced after the event, by or about the same system under question, and there is nothing to check it against; it is a plausible account of feature importance that would have sounded equally plausible had the decision gone the other way. A reconstruction is a rerun. You rebuild the computational state at the moment of inference, feed the same input through it, and see what comes out, which means the exercise can come out different and can therefore fail. Only the thing capable of failing is evidence.

What makes reconstruction hard is nearly always operational rather than neural, and the specifics are almost comically mundane. Floating-point addition is not associative, and a parallel reduction on a graphics processor makes no promise about the order in which it sums, so identical weights on a different card or a different driver can differ in the low bits and, at a threshold, in the answer. The time zone database changes several times a year, because jurisdictions keep moving their clocks and the database keeps recording it, so any computation conditioned on local time is silently pinned to a version nobody wrote down. Add the container image, the sampling parameters, the artifact hashes of whatever rubric or item bank was in force, and you have a list that is tedious rather than mysterious. Every item on it is recordable at the moment of the decision and unrecoverable a year later.

Which puts the honest system in an unusual position of having to grade itself in advance. Some decisions can be replayed exactly, given the captured environment. Some can be replayed only in distribution, matching within a stated tolerance, which is a real guarantee as long as the tolerance is published rather than discovered during the dispute. And some cannot be replayed at all, which is a fact about the system and not an accusation, provided it is declared before anyone asks rather than after. A product that labels a decision non-replayable has told a regulator something true and testable. An explanation has never once been able to do that.

The reason this belongs to measurement rather than to compliance is that it is the same commitment as the error bar, arriving in a different layer. An instrument that reports its own uncertainty is stating the limits of what its number can be asked to mean. A system that records its own envelope is stating the limits of what its decision can be asked to justify. Both are ways of refusing to be believed on charm. And a decision that can be run again in front of the person it was taken about is the only kind that ever really answered them.

Evidence and lineage

Research trail

Follow the sources, inspect how the claims are graded, or propose a correction at the exact record it concerns.

Sources 4
  1. European Union (2024). Regulation on artificial intelligence (the AI Act), record-keeping and technical documentation provisions for high-risk systems

    The regulatory anchor for the demand. Traceability and record-keeping are obligations rather than good practice, which is what turns the reconstruction question from an engineering preference into a compliance one.

    Comment on this source
  2. National Institute of Standards and Technology (2023). AI Risk Management Framework

    The voluntary counterpart, which makes documentation, traceability, and accountability central to its guidance for organisations deploying these systems.

    Comment on this source
  3. IANA (2024). Time Zone Database, released several times a year as jurisdictions change their rules

    The most mundane and most instructive of the hidden non-determinism sources. A computation conditioned on local time cannot be replayed without the database version that was in force.

    Comment on this source
  4. MNSTRY research record (2026). Forensic provenance and deterministic replay, an auditability framework for scoring engines (internal synthesis, self-graded medium confidence)

    The framing this brick takes: auditability as the reconstruction of computational state rather than post-hoc rationalisation, the minimal provenance envelope, and the three declared grades of replay. The document's own field-level tables are internal and are not reproduced.

    Comment on this source
Claims and confidence 5
  1. verified

    Record-keeping and traceability obligations for high-risk systems are written into the European Union's AI Act, and the NIST AI Risk Management Framework makes documentation and traceability central to its guidance.

    The AI Act's high-risk provisions and the published NIST framework. Reported at the level of the obligation existing, with no reading offered of how any particular deployment falls under it.

    Respond to this claim
  2. verified

    Floating-point addition is not associative, and parallel reductions on graphics hardware make no ordering guarantee, so identical weights can produce different low-order bits across hardware or driver versions.

    IEEE 754 arithmetic and the standard reproducibility literature for accelerated computation.

    Respond to this claim
  3. verified

    The IANA time zone database is revised several times a year as jurisdictions change their rules, so any computation conditioned on local time depends on the database version in force.

    The database's own release history.

    Respond to this claim
  4. directional

    The opacity that defeats an audit in practice is more often operational than neural, a missing library version, seed, container digest, or time zone database rather than the inscrutability of the weights.

    Our forensic-provenance research record, which argues it directly and grades itself medium confidence. A claim about where audits fail in practice rather than a measured distribution of audit failures, and graded accordingly.

    Respond to this claim
  5. directional

    Replay guarantees can be declared in advance at three grades, exact given the captured environment, statistically equivalent within a published tolerance, and non-replayable with disclosure.

    The taxonomy proposed in the same research record and adopted here as our position. A design proposal, not a measured finding.

    Respond to this claim

Read next

Or survey the topics.

Concepts in this piece 1

Add to the work

Contribute to Reconstruction, not explanation

Write the useful part. Identity, provenance, and review history are attached when you submit. The published source stays unchanged.

Target Reconstruction, not explanation

Contribution intent
Use an agent instead

The interface is ready. Public authenticated intake remains off until the hosted migration and feature flag are deployed together.