Background-Free Candidates Without a Global Gatekeeper: The Candidate-Class Normal Form for the Background-Free Support Functor, the Admission Test, and the Literature Families Typed

Paper 57 built the corpus's dressed region package on a fixed ambient net, scored its own ceiling in one sentence — "Anchor-carried is not background-free" — and registered the deep half as (r5): full background independence and beyond weak field, "scored here, open; never attempted; closes only by a successor's exhibited construction." Papers 46 ((p1)+(p4)), 54 ((b5)), and 56 (the frontier "returned to the backlog with owners unassigned") name the same seat. But the corpus has no checkable specification of what counts as a candidate for that construction. While none exists, admission runs on authority — the Global Gatekeeper, for whom "a serious framework" is a decree — and the frontier's difficulty is indistinguishable from its emptiness. This paper types the candidate layer and starves the Gatekeeper. "Typed is not constructed." / "Admissible-as-typed is not selected." The instrument is the BFCandSpec normal form (deliberately distinct from Paper 63's adoption-layer CandSpec): seven declared fields — a source category S of background-free relational region data (S = (R, causal/containment relation, comparison data, provenance labels, allowed relational transformations), with a BarredFields type constraint: object/morphism data cannot carry an ambient manifold point, fixed background metric, fixed cell label, pre-given local net, or coordinate region — backed by a renaming test run as three finite scans of the declaration text, so background in disguise is caught structurally, not by word-scanning); a target algebra category T; a support functor F; axioms Ax at 57's honest strengths; a reduction map rho onto 57's fixed-net package, whose codomain is the only place a fixed net appears; strict-recovery proof targets RecT for 46/54/56/57's frozen objects (declaration-grade now, proof-grade the successor's); and explicit failure criteria K0c — each field with a declared grammar and a placeholder rule, so the admission test is decidable: four finite checks with a verdict routing, including the smuggling check: "A candidate fails the admission test if the support functor reads a fixed-net label before the reduction map is applied." The boxed working definition: background-free here means no ambient net, metric, cell assignment, or fixed local algebra appears in the source category or support functor before the reduction map. "Admission is not permission. It is a finite type check against declared fields." The declared candidate table — four cited literature families (crossed-product/modular; edge-mode/boundary-charge; dressed-observable; locally-covariant functor) plus one corpus-internal boundary-data row (the quasi-local horizon row, typed only as a possible source of relational boundary data) — is typed against the seven fields under a field-by-field extraction protocol with a setting/input rule (a barred field in a source's presentation setting pends the row; a barred field in the declared object class or input signature fails the source condition), so the typing is a reading of displayed signatures, not the author's decree: "The paper classifies the families by displayed fields, not by reputation or expected success." Realized: the crossed-product/modular and dressed-observable families land conditionally admissible-as-typed with named pending fields; the edge-mode family lands outside as published (by the input signature) and the locally-covariant functor outside (by the object class) — "BFV passes covariance and functoriality, but fails the background-free source condition because its objects are spacetimes rather than relational record-region data" — background-covariant, not background-free, a defined and scoped shorthand; each outside row displays its achievements and its re-basing route. The reduction and recovery targets are fixed checkable, row by row — the operationalization of (r5)'s "exhibited construction." The ceiling is strict: nothing here is a construction, and no row is a winner — the declared inbox is not empty at skeleton grade; (r5) stays open on every branch; the U1 hand is recorded as artifact-complete, not as grouping-unlocked (no grouping opened, numbered, or reserved; a separate owner decision); no physics claim, no adoption, no datum. CandStatus(background-free classes) = scoped at typing/classification grade. "Typed is not constructed." / "Admissible-as-typed is not selected."