After an experiment runs, exactly two decisions could still be made by a person: does this outcome exclude the theory's declared region, or did an auxiliary — source, tap, detector, calibration — fail, voiding the run instead; and who is licensed to say so. Any protocol that leaves either decision open after data exist has left a seat for a post-hoc refutation authority — the Global Falsifier, the imagined adjudicator who owns the modus tollens. Paper 44 of this sequence closed its photonic tapped-switch probe FA at pre-registration-grade design ("the IV gate itself remains future laboratory work") ; Paper 48 froze the shared adjudication layer as a handover template, typing everything design-specific as named pre-data slots behind a failable acceptance gate. What stands between that design and a laboratory's first shot is a single object: a completed, gate-passing handover instance. This paper — the forty-ninth in the sequence, centre panel of its Execution Program (Papers 48-50) — builds that object, the reference instance HA, at the executable level the template promised. Delivered: the delta specification from the cited apparatus class (the Goswami-type photonic quantum switch) to 44's tapped configuration, component by component against the frozen budget rows; the schema completion with field-level primitives for every field, extensions add-only and partition-admissible; the frozen analysis pipeline in algorithmic normal form — IV gate, measured-calibration transfer, estimators, and the leaf router implementing 48's tap rows verbatim, under a language-independent rounding convention so floating-point artifacts cannot flip a frozen boundary direction — with the reference implementation shipped as a hash-anchored code appendix (deposited companion file) behind a declared production-scoring boundary; the concrete exclusion rule list with its veto-impact report and a frozen post-exclusion N rule disposing shortfall, surplus, and stopping at once; the S1-S4 blinding runbook; and the mock-data challenge, executed in three parts — a deterministic core exhaustive over every router branch and both tie directions, an adversarial set generated through a recorded, deposited exchange by a party in the auditor role that did not implement the scoring code, and a public-beacon-seeded bulk for totality and determinism. All three parts pass; the routing tables are generated by executing the shipped implementation and are typed non-evidence in the sentence that reports them. The acceptance gate is then run condition by condition on the deposited pair. One finding is published along the way: 48's coverage condition, read literally, would force every per-design instance to claim all seven leaves; the pre-committed completion evaluates coverage over the design's assigned leaf subset plus the shared non-execution leaf — an annotation to 48, never a retro-edit. The verdict is InstanceStatusA = reference-complete, with an empty instance gap register: every gate condition passes, and what remains is ownership — acceptance transfers when a laboratory signs, auditor-reproducibly, over the instance plus its re-gated extensions; reference-complete never shortens to accepted, and an immutable core guarantees that no admissible extension can change what a null excludes, who may say so, or how boundary cases route. Displayed at the close is the channel's frozen exclusion content — the carve a future null already names, 1. 7e-1, 2. 1 at the conservative corner — beside the pre-priced Duhem escape map. Nothing is carved, scored, or measured; no band or feasibility verdict moves; the data paper 49-D stays reserved behind its unlock conditions. What retires is the interpretive seat: refutation content as a public, frozen, executable object — falsifiability without a Falsifier.
Tomoyuki Uchida (Sat,) studied this question.