@techspokes/typescript-wsdl-client 1.1.4 → 1.1.5

package/docs/content-model-s06-research-handoff.md

@@ -0,0 +1,909 @@
+# S06 Research Contracts and Handoff
+
+Joint research evidence for #232 and its four leaves, with explicit decision and production gates. See the root [README](../README.md).
+
+## RE01-B ambient preservation
+
+The [compatible-environment theorem](content-model-s06-re-01-support-reconstruction.md#re01-b-compatible-ambient-preservation)
+extends S0/S1 to arbitrary finite ambient scalar globals, flat primitive local portfolios and HEAD carriers,
+plus required inherited readers restricting genuine HEAD subportfolios. The input-only research recognizer
+leaves source formation and native evidence pending; full Gamma/P still pass the existing producer/builder.
+
+A matching-A reader succeeds locally after affiliates but fails the initial parent RP obligation.
+The lawful subportfolio alternative completes automatically with receiving-context TYPE/VALUE dependencies,
+unchanged SOURCE authority and post-materialization rank. Conflicting readers, reverse affiliations, output-name
+collisions, invalid ambient actual values and exhaustion retain distinct outcomes. Fresh-context nonauthor review
+accepts the scoped theorem; exact delivery revisions and validation are recorded in the #234/#232 handoffs.
+
+The next residual is a lawful staged parent for a HEAD reader restricting A, or its exact additional compatibility
+predicate. Arbitrary history, full coverage/negatives and production remain open; do not start broad scalar solvers.
+
+## RE01-A private scalar choices
+
+The [constructive sufficient-class theorem](content-model-s06-re-01-support-reconstruction.md#re01-a-private-scalar-construction-theorem)
+defines closed source S0 and exact inherited attachment S1 from actual syntax/history, with arbitrary FIELD arity.
+The cross-copy discriminator admits a complete native witness: Boolean ITEM for numeric Boolean FIELDs,
+retained ITEM for QName FIELDs, separate immediate L0 tuple funding and the same HEAD spelling.
+The old shared-family negative is preserved within its original grammar.
+
+`preparePrivateAnchoredListAssignments` shares the existing anchored constructor and derives one recipe from input.
+The existing builder explores this alternative without accepting child targets, winning ITEMs or answer forests.
+Input-only S0 and labeled seeded S1 controls complete automatically; a real incompatible inherited consumer
+still rejects the locally feasible child. Native formation, SOURCE/maps, stored rank and exhaustion guards remain.
+
+This is constructive sufficiency for S0/S1, not full-domain coverage. The next packet is RE01-B under #234:
+compose the proved classes and select one residual parent-visible reader/owner reduction with a concrete consumer.
+Arbitrary/inactive parents, unknown future readers, full catalogue adequacy and general negatives remain open.
+No production activation, package-version change, release, tag or publication is included.
+
+## Automatic native evidence completion handoff
+
+The next #349/#350 slice starts from verified PR #356 main
+`215517967c1f2dec35425d1a88500d4152a4d96b`, tree `f3994db16bd41bbfbb4c2e9642e8f9156db0a5b0`.
+The [research evidence builder](../test/research/re01/evidence-builder.ts) discovers exact-context duties through
+the same internal native frontier used by the supplied verifier. It explores the delivered inherited-middle and
+anchored LIST grammars, constructs every child link and independent actual-Gamma support, then obtains the native
+receipt for the complete actual-root forest. Consumers no longer hand-wire the supported continuations.
+
+`buildRe01Evidence(actual,target)` takes authentic input only. `completeSeededRe01Evidence(actual,target,hypothesis)`
+instead completes one concrete original-root hypothesis; the seed contains no child targets, child choices or premises.
+These modes are reported separately. A seeded positive does not prove input-only discovery of the root construction.
+Both modes return a checked witness only after native aggregate verification; inspected frontiers are pending duties.
+
+The [proof-to-code map](content-model-s06-re-01-support-reconstruction.md#native-frontier-and-automatic-evidence-completion)
+qualifies the finite ranked closure, exact contexts, SOURCE versus FULL, global Gamma backsupport and shared budget.
+Independent controls cover multiple original and born duties, deeper continuation, repeated targets in different
+contexts and an inherited consumer that rejects a locally feasible alternative before another candidate succeeds.
+The native missing/wrong-context/cyclic/unused-evidence refusals and scalar/SOURCE/notation/IC controls remain binding.
+
+This completes evidence construction only for the stated generator closure. Empty delivered families, unsupported
+geometry, unresolved rank premises and resource exhaustion cannot establish general negatives. The next extraction
+premise is a parent-visible joint graph/program/owner catalogue with success-preserving continuation and the same
+winning fresh candidate's zero-new-stored-NP property. General and inactive parents require their own representation
+and rank argument. The new builder is the consumer for that generalization; do not add more manually wired forests.
+
+#234's full catalogue, #350's catalogue-wide adequacy, #347/#348, #351 complete negatives and dated-XSD correspondence
+remain open. #179/#153 activation, draft #231 reconciliation and #184 payload ownership remain separate.
+Final revision, review findings and actual validation/delivery disposition belong to the linked PR and issue ledger.
+
+## First-enumeration LIST implementation handoff
+
+The #349 anchored continuation adds research-only `prepareAnchoredListAssignments(Gamma,P,target)` in
+[`anchored-list-assignment.ts`](../test/research/re01/anchored-list-assignment.ts). It issues local preparations with
+explicit pending enclosing-forest duties. The [scoped proof and controls](content-model-s06-re-01-support-reconstruction.md#anchored-item-template-family-and-inherited-continuation)
+separate sound complete checked outputs, enumeration of the stated finite grammar, and still-unproved broader extraction.
+An authentic born target under `P != Gamma` now materially uses the selected ITEM/L0/L1/SG choices in a checked two-node
+actual-root forest. An inherited consumer can reject that same locally successful child; removing its child evidence
+is unresolved. Complete stored-universe native counts in this example decrease `(q,n)` from `(0,1)` to `(0,0)` after
+assembly, despite nonzero additions. This example does not establish arbitrary-parent coverage or complete negatives.
+
+Direct changed-ITEM controls establish that both retained decimal members succeed without the optional NEW serial
+provider. The retained float member funds float tuples but fails ordinary protected fixed-value equality. Serial
+selected-donor/no-donor, wrong-FIRST and one-token-versus-whole-tuple controls remain. A failed serial recipe therefore
+cannot exclude the direct atomic alternatives. Production #179, combined #153, runtime #184 and #351 remain gated.
+
+The continuation from PR #352 starts at main `81aa7f0e297fbee248c99378cddc0605c6cf7568`, tree
+`c32446d1fb50eb42770fc28209ea117b0611ec03`. Its overall research status remains blocked and incomplete. It now delivers
+input-only exact-ITEM and derived Boolean-ITEM LIST constructors, joint finite endpoint tuples and finite image WORD labels.
+The [single premise ledger](content-model-s06-re-01-support-reconstruction.md#joint-premise-ledger) records exact domains,
+owners, controls, next operations and independent reviewers. These scoped results do not complete #347-#351, #234 or #232.
+
+For #179, `prepareFreeListAssignments(actual,parent,target)` is a research-only entry point. Its initial sector requires
+`parent === actual`, one direct inherited LIST/ITEM and the protected ordinary frame specified in the
+[construction proof](content-model-s06-re-01-support-reconstruction.md#input-derived-exact-item-free-list-construction).
+It returns a separately authenticated physical delta/context, its derived FIELD/HEAD cohorts, a complete actual-root
+forest, the native checked receipt and post-assembly introduced-stored-NP count. Unsupported shapes remain unresolved;
+candidate rejection, actual invalidity and operational exhaustion retain native outcome categories. Production must
+not import this test module or treat a forest for a Gamma-fresh target as an independent actual-root receipt.
+
+`prepareBooleanFreeListAssignments` additionally derives one shared guarded ITEM over authentic `[QName,boolean]`,
+then forms genuine L0/L1 stages retaining a HEAD LIST's literal true/false P1 component. It rewrites physical member
+WORDs from original Boolean ROOT demands and checks the same ordinary/scalar candidate. The fresh namespace is
+derived from the complete FIELD map portfolio. A direct builtin-Boolean ITEM is also a lawful smaller alternative;
+the guarded UNION is a sufficient recipe, not an unavoidable shape extracted from arbitrary witnesses.
+
+The production scalar kernel exposes `privateAliasEndpointTuples({roles,constants,formula},owner)` in its actual H.
+Roles use authentic CURRENT enum, proved-singleton or empty inventories, with optional matching exclusive-repeat bound
+branches. Constants carry genuine type/WORD/maps; the topological Boolean circuit compares exact selected values and
+native partial orders. A result contains coherent values, CURRENT membership words where applicable, primitive words
+and actual repeat ordinals. Complete facet KEEP/REPLACE/fixedness formation remains a separate consuming duty.
+
+The same kernel exposes `finiteImageBinaryWordViews(views,owner)`. Each view supplies its fixed parser, saved map,
+optional ROOT and positive/negative finite enumerated LIST image labels in their actual maps. Successful results carry
+one canonical binary core, every physical WORD/value and positive-label inverse WORDs. Complete tuple constraints and
+FIRST are imposed before projection; no unknown cross-core or duration arithmetic join is silently solved.
+
+Both scalar APIs return the existing checked scalar receipt with H, authority, type dependencies and pending formation
+obligations, including local empty results. Consumers must pass those duties to native owners in their actual receiving
+contexts. Local emptiness is limited to the published fragment. Invalid-schema, unsupported-capability, unresolved and
+resource-limit outcomes cannot become general nonexistence. One shared budget covers preparation, products, inverses,
+native reassessment and publication. No new runtime payload ownership or #184 conversion contract is introduced.
+
+Remaining production work is deliberately gated: derive the complete graph/programme catalogue and unknown joins,
+qualify every local/native frontier, implement reviewed ranked search after both checkpoints, then integrate under
+#179 and reconcile draft #231. The three supplied-verifier general flags remain false. The
+[dated-XSD disposition](content-model-s06-re-01.md#dated-correspondence-disposition-after-the-first-list-constructor)
+keeps source-to-B translation, generated-context foundation and greatest-completion adequacy separate from Q_f.
+
+The precise mathematical gap is still the input-derived joint interpolation implication: every successful authentic
+B-v1 judgment must admit one input-bounded complete ordinary/scalar/owner candidate and forest, with zero new stored NP
+at a fresh target. Two investigated reductions fail on preserved native controls. Positive pre-cut TYPE observations
+miss a future-only middle in `future-middle-allocation.test.ts`; unrestricted Presburger summaries lose variable-arity
+GROUP multiplication in `joint-native-arithmetic.test.ts`. The new changed-ITEM controls additionally reject serial
+restoration without a genuine selected BASE donor. None proves the complete research task impossible or undecidable.
+
+The next executable resumption is to generalize derived anchored FIELD demands and current HEAD LIST/ITEM ports, enumerate
+the qualified finite atomic-UNION deletion masks jointly, and natively test whole selected-image funding before L0/L1
+formation. The decimal donor `001` versus absent-donor contrast in
+[the changed-ITEM controls](../test/research/re01/free-list-changed-item.test.ts) supplies a minimal discriminator.
+Recursive ITEM graphs, arbitrary native authorities and unanchored joins require further extraction or an equivalent
+total criterion; a failed technique and an unsupported local input remain explicit limitations.
+
+Platform qualification is separate from semantic research acceptance. Re-query current jobs rather than reusing an old
+timeout verdict. PR #352 main's Windows/Node 26 job passed; its Windows/Node 24 job timed out inside initial environment
+enforcement before reference setup or semantic tests, with successful cleanup and zero removals. The existing report
+could not distinguish its pre-removal substages. Bounded revision-linked progress now preserves registry, installation,
+inventory, control and probe boundaries through interruption, without changing enforcement. Portable interrupted-reader
+and unchanged-inventory controls pass; Windows execution still requires the hosted jobs and their actual artifacts.
+
+## Current purpose and next investigation
+
+RE01 asks whether an XSD complex type's derivation can be rearranged into an extension followed by a restriction, possibly with no change in the second step.
+We can check supplied constructions and finite proofs, and prove some particular constructions impossible.
+We now have a separately selected founded research judgment; its correspondence with dated XSD and a complete decision procedure remain unproved.
+Checking a design someone supplies is different from deciding whether any allowed design exists.
+
+The renewing-helper example explains the present difficulty: each proposed repair can pass its local checks while requiring another helper's derivation proof.
+The [PR #313 theorem](content-model-s06-re-01.md#global-formal-models-and-renewal-nonentailment) constructs two models of the audited, formalized selected-B contract that preserve accepted primitive and finite-positive rules but answer this example differently.
+These are two consistent interpretations of our formalized rules: one accepts the repeating case and the other rejects it.
+That establishes a limit of those formalized premises, not ambiguity of all normative XSD, semantic success or failure, or undecidability.
+
+The [source-to-B investigation has now executed](content-model-s06-re-01.md#executed-source-to-b-semantic-bridge-audit) from main `603d84dad2e5942e2aa76ee7e119c1c98661b8a4`, tree `a924ba281368b54ed8e6b0c08f51e2bb259d4bcf`.
+The investigator and independent reviewer tested two concrete truth principles and a possible missing-context correspondence, rather than stopping at the preparation packet.
+Neither attempted source-to-rule proof established its truth principle; the result records their exact failed inferences, a paired executable control and a concrete unselected alternatives packet.
+
+Execution ownership is recorded in the [leaf claim](https://github.com/TechSpokes/typescript-wsdl-client/issues/234#issuecomment-6270086533) and [joint link](https://github.com/TechSpokes/typescript-wsdl-client/issues/232#issuecomment-6270089692).
+These are fixed execution records, not permanently latest status: any continuation must reread current #234/#232 acceptance and ownership before dispatch.
+The reading/control map and staged gates below remain the executed packet's reproduction and continuation boundaries.
+
+### Selected founded research route
+
+The [external-resolution continuation](content-model-s06-re-01.md#founded-contextual-research-completion-and-identity-read-repair) executes both alternatives from main `a606c8af846678523915c85468c2bfa599334207`, tree `d9e1f6e57dec1043bd4ea886f68510568af5594b`.
+After independent compatibility review, the coordinator selects `founded-contextual-Q-v1` under the user's delegated choice: Q_f = S⁻ = ν(N restricted to K), with the existing K = J \ (Jₙ \ μR).
+This additional project research definition preserves B-v1 geometry and accepted primitives/finite positives; it is not a consequence attributed to dated XSD or ordinary SHACL well-founded semantics.
+
+P_sat would select the old greatest model S⁺, whereas P_found alone is only a necessary condition and needs a completion.
+They cannot both hold unchanged on renewal: S⁺ includes it and μR excludes it.
+The selected completion favors the founded route while keeping S⁺ as a model of the old formalized contract, rather than claiming the old source proof selected S⁻.
+
+For completely source/Q-free-qualified actual Γ, the new abstract theorem equates all actual nonprimitive duties lying in μR with a complete finite semantic assessment forest.
+Under Q_f, complete actual assessment is therefore equivalent to such a forest, with explicit exact-context, primitive-closure and materialization conditions.
+This supplies a conditional evidence-adequacy route; it is not a universal claim about the current executable interface or the independent dated judgment.
+
+The investigation also exposed and repaired a concrete false negative: comparing unchanged V.base=T published a hypothetical validity debt for unrelated original T.
+Identity preservation now checks membership/identity without manufacturing that debt; genuine scalar, ancestor and component-owner dependencies remain required.
+A complete one-node proof now passes, while a fresh mandatory declaration consuming T still reaches R_M and fails 5.4.
+
+The [late-original-property continuation](content-model-s06-re-01.md#late-reification-of-untouched-original-complex-properties) has now repaired one concrete materialization limitation.
+An unused original complex type's unchanged raw properties can first be supplied in a nested child when the canonical owner is untouched, its row is absent and authentic correspondence succeeds.
+Its synthetic content is installed only in that child and remains a mandatory fresh root.
+The complete direct-B2 positive and eager-parent EDC failure show why installing every original's generated content early is not a general preservation recipe.
+A complete fresh-E2 alternative still exists, so the failed eager recipe does not refute existential forest adequacy.
+
+The [scope-property continuation](content-model-s06-re-01.md#scope-property-reads-and-validity-dependencies) repairs a reproduced copied-prefix false negative.
+Reading two anonymous scopes' complete properties had scheduled full validity of their otherwise unconsumed shared base.
+The equality owner now separates same-complex identity and effective AU property reads from full type construction, while retaining actual correspondence and every AU/declaration/scalar prerequisite.
+Complete copied and identity forests pass; genuinely consuming the failing base still rejects.
+
+The same read-only audit justifies first-fork padding of faithful original named-group rows without new components or fresh roots, while retaining Γ debts and later H legality.
+The [reviewed scalar-selector lift](content-model-s06-re-01.md#reviewed-active-facet-forest-normalization) now preserves a coherent finite semantic forest's chosen active facet recipes while leaving original Γ operands and genuine full-type duties unchanged.
+It constructs scalar facts directly from qualified exact content selectors, without assuming old recipe-only facade-formation duties already have proofs; it is not a normalization implementation or universal frontier theorem.
+
+The [scalar content-property continuation](content-model-s06-re-01.md#candidate-scalar-content-property-repair) also repairs a real extension caller that read a complex scope's scalar content through its full facade.
+Candidate equality now uses that exact supplied scalar property; actual source normalization and genuine complex-type validity remain unchanged.
+Complete identity/copied three-node proofs pass, unequal scalar facets and unsupported anonymous-type restriction still reject, and genuinely consuming T requires its own hypothetical proof alongside the separate actual Γ proof.
+
+The [complex-reference composition audit](content-model-s06-re-01.md#complex-property-references-and-full-construction) extends the same boundary coherently: complex references recursively visited for property equality no longer publish full validity by themselves.
+A nested original-scope caller now completes identity/copied four-node proofs; a genuinely consumed inner type still requires and accepts a separate H proof, while an inherited method mismatch still rejects.
+AU matching shares collectors, but qualified same-QName declaration uniqueness rules out failed-branch-only complex scope alternatives; no blanket scalar-discard theorem or collector change is claimed.
+
+The [conditional-premise continuation](content-model-s06-re-01.md#conditional-prerequisites-through-particle-extension) repairs remaining local composition gates without weakening value, facade formation or mixed emptiability.
+Particle extension retains exact scalar and known current-context mixed prerequisites, and its construction caller sends them to the existing owners; unknown string families remain unresolved.
+Complete simple-base and mixed identity/copied two-node proofs genuinely consume both C types, with formation discharges or exact default-declaration/emptiability checks; complex-base missing-H and inherited-method failures remain binding.
+
+The [guarded original-property continuation](content-model-s06-re-01.md#guarded-original-property-views-in-the-current-context) now reads untouched original particle/empty properties directly in the current H without installing source-generated wrappers.
+The authentic copied and identity two-node forests complete with unchanged membership; faithfully installed wrappers and genuinely consumed C still fail EDC.
+Raw rows remain authoritative, the factory authenticates lineage/source-absence eligibility, the content owner checks collisions through current-H lookup, and the AU property authority retains Γ source qualification plus current-H individual facts.
+This partial reader does not remove any real fresh root, transfer facts from a reified context, support simple/opaque fallback or establish universal allocation/forest coverage.
+
+The [full original-input continuation](content-model-s06-re-01.md#guarded-original-inputs-to-full-construction) now checks genuinely consumed particle/empty originals using authenticated retained data as inputs to every current-H construction owner.
+A complete RequiredD one-node proof preserves the native ur wildcard without installing representation-only particles; ordinary raw/fresh wildcard negatives, current-H nonprimitive evidence and genuine EDC conflicts remain binding.
+Full AU derivation is separate from the property-only receipt, every private particle is locally checked, and real descendant/root debts remain owed.
+Unsupported source-only diagnostic paths, simple/opaque content and collisions remain unresolved; no Γ validity transfer or general SOME-forest theorem is claimed.
+
+The [original-compositor continuation](content-model-s06-re-01.md#original-compositor-incidences-in-candidate-construction) separately repairs authentic original child incidence when a containing type already has raw properties.
+A source-only 0..0 item no longer becomes a component-validity debt through an eligible original compositor; a complete unchanged-membership one-node forest now checks all actual obligations and the genuine H frontier.
+The factory supplies a frozen ordered subsequence to the construction prelude/particle branch and the semantic view's resolved compositor before DFS.
+Direct original zero IDs, fresh explicit lists/zero particles, actual source syntax and all genuine roots remain binding; the primary engine's UPA disagreement is recorded separately from the dated no-component mapping.
+This does not extend the full-input diagnostic lookahead, alter equality's literal-child path, settle direct absent declarations or prove general source-only/frontier coverage.
+
+The [component-admission continuation](content-model-s06-re-01.md#source-only-original-records-and-full-component-admission) now closes the demonstrated direct diagnostic-declaration gap at the full construction owner.
+A fresh live particle cannot make a source-absent original declaration into an H component merely by referencing its available record; the complete caller rejects that supplied candidate in exact H.
+A disjoint fresh declaration plus particle completes the same one-node witness with both explicit fresh roots, while actual syntax duties, property-only evidence and max-zero structural failures remain intact.
+This enforces the existing component domain without a new activation policy; retained-only absence is unresolved, and general source-role/frontier completeness remains open.
+
+The [finite-observation continuation](content-model-s06-re-01.md#passive-affiliates-and-anchored-head-observations) also proves a conditional one-way positive pruning lemma for a passive affiliate batch born in one Γ-root construction.
+Keeping at most two identities per nonzero complete head/context profile preserves some finite forest, but its general bound depends on the given forest's observation inventory.
+A complete fresh-head countercontrol defeats original-global-head-only profiling; Γ's local element QNames can anchor such fresh heads when all consumed roles are covered.
+An input-derived passive-pool bound follows only with that complete QName coverage plus invariant membership under the full frozen relation closure across retained contexts.
+Unrestricted nonpassive support, changing contexts, proof depth/record sizes and compatible SOME reconstruction remain the next quotient-route obligation, not a proved general bound or universal failure.
+
+For the present finite-verifier route, continue by proving that every completely qualified Q_f actual assessment has some executable finite forest with a justified semantic frontier, then establish complete search and negative/termination results.
+That goal does not require translating every prescribed candidate or retaining a failed eager-installation method.
+The [reviewed C² follow-up](https://github.com/TechSpokes/typescript-wsdl-client/issues/234#issuecomment-6274763459) is a separate restricted logical positive, not a full-B encoding or a reason to require today's verifier layout of every method.
+Normative correspondence, arbitrary runtime representation, input-derived negative bounds or equivalent complete negatives and mathematical termination remain separate open gates.
+There is no production selector/API/version change, release or downstream activation in this choice.
+
+### What is established and what remains unproved
+
+The [first-birth helper reconstruction](content-model-s06-re-01.md#first-birth-restriction-reconstruction-of-common-content-helpers) retains exact base identities while changing eligible fresh extension methods to restriction.
+With common exact content and complete affiliation, membership, property-equality and frontier guards, its helper child duties disappear.
+Complete live-consumer controls pass where the older E-cut recipe rejects affiliation; every actual and fresh obligation remains checked.
+
+This is conditional reconstruction, not a Γ-derived bound or a complete search.
+A separate fresh-head control also reconstructs a different complete root when pointwise recolouring fails, without deleting any inherited component.
+The next general task is to extract some compatible raw-content/type/head support from arbitrary complete successful forests, rather than preserve every prescribed helper graph.
+
+The [genuine original-anchor contrast](content-model-s06-re-01.md#genuine-original-equality-anchors-require-contextual-reconstruction) shows why equal properties alone do not justify replacing a fresh declared type with an original.
+That replacement creates a different H obligation and breaks a retained scope comparison; jointly reconstructing the consumer repairs the exact example with complete four-node evidence.
+The general method must therefore account for property-only scope observations and full declared-type consumption together, while retaining each proof's exact context.
+
+| Finding | Established scope | Remaining limit |
+| --- | --- | --- |
+| Shared local authorities and supplied finite proofs | Accepted local rules and context-bound checks | General helper existence is not decided |
+| Helper-count descent | Some proved reconstruction families terminate | New nonprimitive helpers can be necessary |
+| Copied-prefix transport | Strong transport fails; a displayed bypass succeeds | General reconstruction remains unproved |
+| Exact-content vacuous extension ground | A retained consumer refutes the general ground | No unrestricted vacuous-chain success rule |
+| Renewal | False in selected Q_f; no finite certificate under current leaves | Independent dated-XSD verdict remains unproved |
+| Global formal models | Two accepted-rule-compatible models disagree | Intended dated meaning still needs justification |
+| Executed semantic audit | Concrete positive/foundation inferences fail; paired anchor control qualifies | No authority-backed contextual truth rule or specific repair established |
+| Founded research completion | Q_f selected explicitly; conditional semantic forest adequacy proved | Runtime materialization and normative correspondence remain open |
+| Identity-read repair | Unrelated original type comparison no longer widens validity closure | Genuine consumed and fresh-root failures remain required |
+| Late original complex properties | Untouched original rows can first be reified in the consuming child with authentic correspondence | General executable-forest adequacy remains unproved; other row categories are unchanged |
+| Scope-property read repair | Copied-prefix proof no longer imports an unrelated scope-base validity root | Full construction and genuine consumed/fresh-root duties remain required |
+| Active scalar-selector forest normalization | Exact per-context scalar facts and finite semantic support preserved | Other publisher/representation paths remain unproved; no normalization implementation |
+| Scalar content-property repair | Candidate equality checks the exact scalar property without facade-only formation | Actual source and genuine complex-type consumption retain their prerequisites |
+| Complex property-reference repair | Authenticated recursive properties no longer manufacture full validity | Genuine construction/scalar/value duties and global composition proof remain |
+| Conditional extension prerequisites | Existing owners discharge exact scalar and known mixed-default premises | Nonprimitive own-Q, unknown string families and global frontier composition remain |
+| Full RE01 procedure | Useful positives and scoped contradictions work | Coverage, adequacy, negatives and termination stay open |
+
+These failed reductions led to the semantic gate rather than another helper-length experiment.
+Neither a familiar fixed-point convention nor a larger search budget supplies the missing implication.
+The seven accepted recovery packages, AU C1, PW R-240, DT A, #178, GSC1 and selected P1/F2 remain binding.
+Actual Γ, exact owning contexts and original typed operands remain distinct; every inherited fresh root remains required.
+Primitive truth stays conditional on its other duties, and legal primitive component cycles must remain accepted.
+
+### Practical routes and recommendation
+
+For the independent dated judgment, the remaining dependency is an authority-backed truth rule or a specific correspondence correction.
+For the selected Q_f research route, proceed with exact executable materialization/frontier correspondence, then complete search and negative/termination proofs.
+Preserve B-v1 geometry and every gate; choosing a research relation does not make those later proofs automatic.
+
+| Compared route | Executed finding | Evidence still required |
+| --- | --- | --- |
+| Repair a missing or mistranslated premise | Full extension/restriction, component and conformance bridge inspected; no compatible omitted premise established | Exact clause, both translation directions and model/control re-evaluation |
+| Positive reflection P_sat | Would accept renewal, but moves from component existence to existence of a predicate interpretation | Independent authority/correspondence and adequate sound proof representation |
+| Necessary foundation P_found | Excludes renewal; selected greatest completion is Q_f | Independent dated correspondence; foundation alone is not a complete interpretation |
+| Explicit project interpretation | Q_f is selected as an additional named research definition | Runtime/general decision proofs; do not present the choice as a source theorem |
+
+P_sat's failed step replaces a finite construction satisfying already interpreted predicates with a choice of the predicates' global interpretation.
+P_found's failed step replaces finite base ancestry/property closure inside each H with wellfounded support across generated Hᵢ; the renewal family keeps constant base height.
+Full component validity already retains every Q frontier duty, so requiring genuinely valid components does not add the missing introduction rule.
+
+The new paired control preserves a specified graph of nine global and six particle records across distinct authenticated inputs.
+Old P is locally qualified but not fully valid because its mandatory U judgment is false; new actual Γ′ has a complete one-node U proof.
+Both R_H and R_M now remain outside the positive hypothetical closure while remaining checked in actual Γ′.
+The earlier R_H inclusion was an incidental identity-read debt corrected by this continuation; independent hypothetical R_H checking still passes.
+
+This refutes anchor-erasing factorization over admitted locally qualified queries, not over a restricted class of already fully valid parents or successful transformations.
+Native cross-source invariance is unproved, and this optional shortcut is not a new gate for history-aware methods.
+For the independent dated judgment, a direct contextual proof can retain immutable Γ throughout and still needs independently justified truth introduction/exclusion or a concrete correspondence repair.
+
+If contract clarification becomes a concrete alternative, compare its exact statement against both models, conditional primitive truth, mutual primitive cycles and the retained-consumer contradiction.
+Selecting a least or greatest fixed point is not justified merely by finite constructions or legal recursive schemas; naive least-model treatment can lose primitive-cycle positives.
+A guarded proof or quotient would change proof representation only after semantic soundness is proved; altering helper/root/context requirements changes the selected witness domain and must be stated as such.
+The named research completion is selected explicitly, with no inference that the reviewed source obstacle establishes full normative ambiguity or source exhaustion.
+
+### Narrow reading and source inventory
+
+The executed reading order is recorded below; historical statuses do not supersede later accepted contracts.
+The [completed matrix and read limits](content-model-s06-re-01.md#completed-clause-to-premise-audit) distinguish investigator readings, coordinator readings, limited excerpts and unaudited sources.
+
+| Order | Exact input | Extract for the investigation |
+| --- | --- | --- |
+| 1 | [Selected policies and proportional delivery](https://github.com/TechSpokes/typescript-wsdl-client/issues/232#issuecomment-6141810918), then [accepted #286 handoff](https://github.com/TechSpokes/typescript-wsdl-client/issues/232#issuecomment-6149690148), then [#285 proof checkpoint](https://github.com/TechSpokes/typescript-wsdl-client/issues/234#issuecomment-6143189895) | Accepted policies, complete local owners, inherited-root and primitive interfaces |
+| 2 | [Semantic-success definition](content-model-s06-re-01.md#semantic-success-and-the-adequacy-question), [uniform contextual quantification](content-model-s06-re-01.md#quantified-claim-and-candidate-families), [primitive proof](content-model-s06-re-01.md#reviewed-primitive-no-change-proof) | Separate own Q, full validity and finite evidence |
+| 3 | [Global formal-model proof](content-model-s06-re-01.md#global-formal-models-and-renewal-nonentailment) and [complete local inventory](content-model-s06-re-01-resolver-implementation.md#complete-268-rule-inventory) | Candidate equivalence, local plans, full frontiers and accepted-rule compatibility |
+| 4 | [Pinned Structures XML](https://github.com/jacoelho/xsd/blob/142f25ee187e17f041af87b6bfcfc82385254520/docs/spec/xml/structures.xml) | Exact dated text and references listed below |
+| 5 | [Source authority and corrections](content-model-s06-re-01.md#source-authority-and-corrections), [AU/conformance contrasts](content-model-s06-re-01.md#why-xml-style-au-inheritance-is-insufficient), [algorithm applicability](content-model-s06-re-01.md#algorithm-applicability-and-the-next-gate) | Separate normative text, unresolved comments, project choices and proposed algorithms |
+
+Verify the pinned XML SHA-256 `e496af408b14853e6169ac7c1fca09d55a81bd73771758ad6be020960e1317ba` if retrieving a copy.
+Read all numbered `cos-ct-extends` premises at 3993–4108, including 1.5 and its note at 4070–4084, then `derivation-ok-restriction` at 4111 onward: the second step must be a valid restriction.
+Inspect `cd-ct-extension` at 4106, `cos-ct-derived-ok` at 4277 onward, and schema conformance at 8816–8844.
+Follow `e-props-correct.4`, `cos-equiv-derived-ok-rec` and `cos-equiv-class` only where the proposed inference consumes affiliation or membership.
+
+The note says “trivial to check”, and its construction recipe remains conditional on a valid restriction.
+The two-step bound concerns the construction, while conformance's recursive property closure concerns one finite schema; neither by itself selects a proof interpretation across generated contexts.
+For each erratum, later-edition text, engine observation or literature proposal, record its date, adoption status and applicability instead of importing it as dated authority.
+Use the [primitive approval](https://github.com/TechSpokes/typescript-wsdl-client/issues/234#issuecomment-6112070199) and [accepted B/evidence contract](https://github.com/TechSpokes/typescript-wsdl-client/issues/266#issuecomment-6143144936) as explicit project premises.
+
+### Existing owner and discriminator map
+
+| Owner or control | Exact entry point | What to inspect or preserve |
+| --- | --- | --- |
+| [Source preparation](../src/compiler/schemaDocumentSyntax.ts) | `prepareSourceSchemaRequest`, `checkSchemaDocumentSyntax` | Actual source qualification without pending RE01 truth |
+| [Correspondence](../src/compiler/re01CandidateCorrespondence.ts) | `re01Ancestor`, `checkCandidateCorrespondence` | Exact ancestor, coherent endpoint and retained properties |
+| [Component closure](../src/compiler/schemaConstructionAssessment.ts) | `checkComponentConstruction` | Local premises, owning contexts and outstanding own-Q duties |
+| [Finite evidence](../src/compiler/finiteRe01Verification.ts) | `verifyFiniteRe01Evidence`; internal `close`, `primitive`, `execute` | Actual obligations, every inherited fresh root, primitive conditions and child correspondence |
+| [Raw relations](../src/compiler/schemaTypeRelations.ts) | `checkTypeDerivation`, `checkSubstitution`, `effectiveSubstitutionMembers` | Raw ancestry/filtering versus positive component-validity duties |
+| [Particle construction](../src/compiler/particleExtension.ts), [views](../src/compiler/particleSemanticView.ts), [restriction](../src/compiler/particleRestriction.ts) | `checkRawParticleExtension`, `prepareSemanticParticleView`, `checkParticleRestriction` | Raw construction versus normalized comparison and complete mapping |
+| [Generated scalar shape](../src/compiler/schemaGeneratedScalarShape.ts), [scalar kernel](../src/compiler/schemaScalarKernel.ts) | `resolveOriginalScalarIdentity`, `originalGeneratedShape`, `checkOriginalGeneratedScalar` | GSC1 slot identity and its own context-bound legality, separate from its complex provenance owner |
+| [Renewal research](../test/research/re01/helper-renewal.test.ts) | `checks every local component in %s renewing contexts while the last child remains owed` | Existing 1/3/5-stage observations, not a semantic proof from sampling |
+| [Renewal contrast](../test/research/re01/helper-renewal.test.ts) | `retains a complete finite contrast when z no longer consumes the earlier endpoint` | Complete unconsumed positive |
+| [Exact-vacuous control](../test/research/re01/exact-vacuous-ground.test.ts) | `qualifies every local premise and distinguishes stable exact-B membership=%s` | Trapped consumer versus complete stable-membership positive |
+| [Distinct-anchor control](../test/research/re01/exact-vacuous-ground.test.ts) | `distinguishes immutable anchors under a complete component-property graph correspondence` | Complete represented-record bijection, local-old/full-new validity distinction and exact closure |
+| [Identity-read control](../test/research/re01/exact-vacuous-ground.test.ts) | `keeps identity-only original types outside hypothetical validity while fresh consumption=%s` | Complete unrelated-original positive and genuine fresh-consumption negative |
+| [Primitive controls](../test/research/re01/primitive-root-evidence.test.ts) | `has a valid primitive no-change proof although every added restriction step is forbidden` | Permanent recursive primitive positive |
+| [Other actual debts](../test/research/re01/primitive-root-evidence.test.ts) | `still requires and checks finite evidence for every nonprimitive actual obligation` | Primitive success does not discharge unrelated actual duties |
+| [Original scalar closure](../test/unit/schema-original-generated-binding-independent.test.ts) | `constructs an active original slot without requiring its inactive source container`; `rechecks slot legality in each sibling and nested context instead of transferring original or sibling success` | Exact slot versus source-owner identity; no original-legality transfer |
+| [Inherited roots](../test/research/re01/live-helper-forest.test.ts) | `requires unused sibling extension evidence inside a required child` | Unused inherited additions remain mandatory |
+| [Independent evidence](../test/conformance/reference/re01-helper-renewal.test.ts), [exact-vacuous source](../test/conformance/reference/re01-exact-vacuous-ground.test.ts) | Source/anchor assertions and live engine observations | Independent premises, not an engine RE01 completeness oracle |
+
+The mutual-direct-primitive reproduction in PR #313's independent review is historical scratch evidence, not a committed executable test.
+The permanent recursive primitive and other-actual-debt controls above are available now; do not restore or invent fixtures during this preparation pass.
+The [copied-prefix control](../test/research/re01/copied-prefix-transport.test.ts), `retains complete copied and original-plus-tail witnesses while exact no-tail replacement fails`, preserves the distinction between a failed recipe and absence of all witnesses.
+Renewal, exact-vacuous and primitive fixtures are under `test/conformance/fixtures/xsd/recovery/`; the copied-prefix fixture is `test/conformance/fixtures/xsd/re01/copied-prefix-anonymous-types.xsd`.
+Source acceptance and semantic expected outcomes must be recorded separately.
+Raw ancestry/property receipt reads do not automatically import full component validity; original scalar data or provenance likewise cannot certify a slot's legality in another context.
+
+### Executed slice and reusable evidence packet
+
+The following stages were executed for the source bridge, positive reflection, necessary foundation and paired anchor audit.
+Independent review accepted the paired proposition and failed-inference scopes before permanent controls; no semantic rule or witness-domain change was authorized.
+The checkpoint was a progress boundary, not the reason for the unresolved semantic verdict.
+
+The investigator first audits the semantic bridge, then attempts one concrete source-grounded inference for the exact renewal judgment, with all required contextual duties.
+The target deliverable is a clause-to-premise proof or a precise failed inference and its next dependency, not a solver or another helper-family expansion.
+
+| Stage | Required work | Reviewable output |
+| --- | --- | --- |
+| Start | Pin main, contracts, source and exact renewal judgment | Baseline and Q/full-validity/evidence definitions |
+| Bridge audit | Test both directions of the dated-rule to B-candidate correspondence | Specific missing premise or justified bridge, including uniform contextual B |
+| Inference attempt | Derive a precise introduction/exclusion rule and apply its complete closure | Formal statement, proof dependencies and preserved discriminators |
+| First checkpoint, 60–90 minutes after dispatch | Report findings even if no verdict follows | Filled evidence matrix and decisive inference or first failed step |
+| Independent disposition | Challenge applicability, contexts and countercontrols | Accepted scope or concrete corrections; next dispatch dependency |
+
+The checkpoint limits engineering scope, not mathematical truth or the source search universe.
+Not proving a result by then establishes neither normative underdetermination nor nonexistence; record what was read, what remains unchecked and the next bounded proof dependency.
+Root may narrow or continue the investigation from that concrete packet without repeating completed inventory work.
+
+Use one evidence row per claimed implication or concrete failure, with these fields:
+
+| Field | Required content |
+| --- | --- |
+| Claim and scope | Exact judgment, quantifiers and claimed positive/negative/translation result |
+| Authority | Pinned clause/line, short quotation, date and primary/erratum/project status |
+| Bridge | Source statement → formal assumption → exact inference; no omitted direction |
+| Context duties | Actual Γ, parent/generated contexts, all inherited roots and original typed operands |
+| Model and controls | Effect on both PR #313 models and expected preserved discriminator results |
+| Evidence status | Proof, counterexample or unproved step; distinguish observation from theorem |
+| Reproduction | Exact revision, command and result, or explicitly unrun evidence |
+| Independent review | Reviewer challenge, resolution and accepted scope |
+
+The investigator is `re01_implementer`, the same sole nonauthor reviewer is `re01_nonauthor`, and root is coordinator/integration owner.
+The investigator supplies the matrix and proof; the reviewer challenges source applicability, the decisive inference and all contexts before reliance.
+Root owns durable #234/#232 updates, any concrete later decision packet, scope transitions and normal delivery; no user relay or extra reviewer identity is required.
+
+### Outcome-specific gates
+
+| Outcome | Required acceptance | Permitted next action |
+| --- | --- | --- |
+| Concrete translation defect | Exact missing/mistranslated clause and independent review | Repair correspondence and re-evaluate both models before any semantic verdict |
+| Renewal semantic positive | Independently justified rule, full closure and primitive/consumer compatibility | If unchanged no-finite-certificate premises still hold, investigate evidence adequacy or a sound alternative proof format |
+| Renewal semantic negative | Independently justified exclusion over every permitted witness in the stated scope | Record only that scoped negative; broader criterion needs a separate theorem |
+| No justified conclusion | Exact failed source-to-inference step, read/unread inventory and next dependency | Continue bounded proof work or prepare a concrete, explicitly unselected clarification packet |
+
+A source-grounded verdict must do more than count which formal model survives: prove the rule's correspondence to the dated judgment and complete B-v1 obligations.
+If a clarification packet is warranted by concrete remaining authority/compatibility evidence, state alternative propositions, affected behaviors, preserved contracts, recommendation and who must decide; do not declare the full specification ambiguous from this checkpoint.
+No outcome here authorizes a production success rule, cyclic storage acceptance, altered witness domain or general-negative API.
+
+### Later implementation and full closure
+
+After independent semantic review, specify any changed proof interface and expected behavior before implementing it in the existing strict TypeScript owners.
+A quotient, guarded proof or other algorithm still needs sound extraction/reconstruction, exact contextual obligations and independently justified semantic correspondence.
+One renewal verdict does not supply a general solver.
+
+| Later gate | Evidence still required |
+| --- | --- |
+| Arbitrary-success coverage | Every permitted successful witness has a covered representative, or an equivalent complete criterion |
+| Evidence adequacy | Every semantic positive has a justified accepted proof mechanism with all contextual duties |
+| Complete negatives | Input-derived exhaustive bound or an equivalent complete-negative theorem |
+| Mathematical termination | Sufficient-resource termination independent of configurable request budgets |
+| Research and joint closure | Independent full #234 review, AU/PW/DT compatibility, exact checks and #232 acceptance |
+| Production and combined qualification | Separate #179 adapter/activation and #153 acceptance; #184 retains runtime ownership |
+
+This executed continuation adds strict research and independent source/reference controls, with their applicable behavioral, manifest, CI/reference and actual-main checks recorded by revision.
+Reuse unchanged broad evidence only under the [proportional delivery contract](https://github.com/TechSpokes/typescript-wsdl-client/issues/232#issuecomment-6141810918), with its original revision labeled.
+Defaults remain configurable inclusive/sticky 100,000 nodes and 125,000,000 work; exhaustion and unresolved prerequisites never prove invalidity.
+Keep #234/#232 and downstream gates open until their actual criteria pass; no release, version bump or activation is part of this continuation.
+
+## Disposition and delivery boundary
+
+The [global formal-model continuation](content-model-s06-re-01.md#global-formal-models-and-renewal-nonentailment) translates the explicitly stated B-v1 candidate equations in both directions and constructs two models satisfying the additional accepted rules, using the accepted complete local inventory.
+It separates every own clause 1.5 from full component validity, retains exact mathematical context/operand identities and quantifies local choice plans with complete finite positive frontiers, including primitive duties.
+Uniform selected B-v1 applies to every consumed contextual clause, not only the root; no independent nested Q_raw is substituted.
+An auxiliary optimistic nonprimitive projection gives a hereditary exclusion set containing renewal; this projection is not a semantic truth rule.
+It drops primitive and actual-Γ-owned duties only from auxiliary premise frontiers; every nonprimitive target remains in its domain, and full validity and actual assessment retain all original-context duties.
+The unrestricted greatest candidate model and the greatest model outside that set both satisfy the full candidate equations, accepted conditional primitive rules and finite-certificate positives, yet disagree on renewal and complete actual assessment.
+Their construction preserves legal finite primitive component cycles without asserting that the least full-candidate model preserves every accepted positive; reconstruction does not make every candidate or original schema valid.
+Primitive approval excludes some other candidate-equation models; the result proves that it and the accepted finite-positive rules do not distinguish between these two models.
+
+Thus the formalized contract entails neither that root nor its negation; this strengthens the earlier displayed-chain countervaluation without selecting either model as independent normative truth.
+No full-XSD ambiguity, semantic positive/nonexistence, general undecidability or new policy is inferred.
+The [executed source bridge audit](content-model-s06-re-01.md#executed-source-to-b-semantic-bridge-audit) tests that next gate and records the precise remaining truth-rule/correspondence dependency, failed principles and unselected alternatives.
+It establishes no independent dated renewal verdict; the later [selected founded research relation](#selected-founded-research-route) supports continued research without claiming that missing normative correspondence.
+
+The [exact-vacuous ground investigation](content-model-s06-re-01.md#exact-vacuous-extension-ground-fails-with-a-retained-consumer) refutes an unconditional success rule for a pure U→B→A extension chain, even when all three types share exact content/AUs and every parent local premise qualifies.
+A retained consumer requires exact M; every U rebase removes M from effective(H), and no finite additions can repair the missing QName.
+A complete original-X positive and a complete two-node contrast changing only M's original declared type to exact B distinguish this fixed-parent semantic obstruction from general witness nonexistence.
+
+The [renewing-helper investigation](content-model-s06-re-01.md#renewing-helper-duties-and-the-finite-evidence-boundary) proves no finite acyclic certificate for its recursive two-head source under the current direct-only primitive rules.
+Every locally qualified required closure retains consumed X and needs some extension-only descendant of exact B, hence another nonprimitive duty; a finite evidence sink is impossible.
+The proof permits arbitrary finite helpers, property-equal prefix copies, affiliation bridges and alternative raw shapes; it does not require every arbitrary step to add a helper.
+
+An explicit family of finite contexts Cᵢ rebases the previous supporter and adds one fresh global Uᵢ₊₁/Mᵢ₊₁, with every local premise rechecked, all inherited affiliations legal and only the newest Uᵢ outstanding.
+One-, three- and five-stage controls stop honestly at missing nested evidence; removing the z:X dependency gives a complete two-node positive certificate.
+Actual Γ's sole nonprimitive X debt is represented by the root, and B has its existing direct primitive discharge; original X(Γ) is not a repeated child debt.
+
+For the exact mathematical local-construction operator Φ with finite child frontiers, finite well-founded evidence is μΦ and the uniform local family is postfixed, hence lies in νΦ.
+Neither fixed point is identified with independent semantic success, and no productive finite trace, cyclic storage acceptance, semantic positive or no-witness conclusion follows.
+Configured resource limits remain separate engineering limits, never a premise of the mathematical separation.
+
+The attempted uniform proof establishes qᵢ₊₁⇒qᵢ and q₀⇒q_X but supplies no independently justified simultaneous-validity introduction.
+The global formal-model result above now proves nonentailment for the entire stated predicate contract rather than only that displayed inference; an independently sound guarded proof would require the missing semantic principle and complete reconstruction of each finite context.
+An existential representative quotient or guarded proof alternative remains unrefuted but needs sound extraction/reconstruction and semantic inference, rather than deleting inherited roots inside exact children.
+The exact-vacuous counterexample refutes the unrestricted ground; a narrower renewal-specific positive cannot follow from the audited formalized constraints alone and would require the independent distinguishing semantic principle.
+This is an unresolved proof obligation under the selected domain, with no new policy or approval request.
+
+The [copied-prefix continuation](content-model-s06-re-01.md#copied-prefix-transport-and-optional-prefix-bypass) refutes unconditional comparison transport from property-equal prefix copies under accepted B-v1 identity, while preserving complete alternative witnesses for the displayed optional-prefix case.
+Distinct original inline anonymous types compare property-equal without acquiring a derivation edge; a complete copied-prefix certificate passes, exact no-tail replacement fails and exact original-prefix replacement with a `0..1` or unbounded wildcard tail passes completely.
+This separates failed comparison transport from general witness existence and contextual finite-evidence adequacy.
+
+The original source syntax owner now qualifies a particle's retained inline type only through its exact same-source local declaration and owned anonymous type, including the source span and direct-child relationship.
+Canonical/source inventories remain retained, child-component syntax remains separate and particle annotation ordering remains enforced.
+Malformed, misplaced, duplicated and source/type-mismatched children retain rejection, with source-backed complex/simple positives and independent reference observations.
+
+General arbitrary-success coverage, contextual evidence adequacy, copied-prefix reconstruction, input-derived bounds or an equivalent complete-negative criterion and mathematical general termination remain open after these scoped results.
+
+The [finite flat-prefix continuation](content-model-s06-re-01.md#any-nonempty-finite-flat-prefix-of-optional-local-elements) extends the sufficient inherited-consumer obstruction to every nonempty finite flat prefix of original optional local element incidences.
+Given target/head/member/consumer IDs as selection hints, the research-only function verifies complete authenticated contexts, exact types and declaration properties, the target's nonprimitive duty, retained raw selectors and the normalized n + 2 explicit positions.
+It derives the base consumer and proves no permitted complete target child of that exact parent, including arbitrary finite additions and affiliates under both head and member.
+
+The unit original prefix sequence flattens without deleting optional element incidences, and complete strictly ordered Recurse mapping between equal finite lists forces every ordinal position to itself.
+The required M position still cannot map to effective(H), by the independent first-edge obstruction and mandatory M/global-QName argument.
+It does not assume the target's pending RE01 validity, classify immutable Γ as impossible, enumerate candidate children or activate a production negative branch.
+
+Single-element prefixes retain `inherited-three-position-consumer-v1`; longer prefixes publish `inherited-flat-prefix-consumer-v1` with the exact incidence count in `prefixLength`.
+`not-established` proves nothing; missing qualification, invalid input and inclusive/sticky resource exhaustion remain separate.
+The criterion retains the documented global/nonabstract declarations, global complex target/head types, fresh inherited consumer roots, disjoint local/M QNames and required empty choice; empty/nested/choice/all/wildcard/non-0..1 prefixes remain unsupported.
+
+Typed controls retain #309, renaming, identity/primitive positives and altered/missing-context cases, while adding direct n = 1, n = 2 and n = 5 parents, complete matching child rejection and complete unblocked positives with expanded H/M groups.
+Independent source/reference controls preserve the new operands and ordered mapping, and exact successful/one-below work/node controls preserve sticky resource failure.
+One fresh-context nonauthor reviewer scrutinizes the criterion before reliance and assesses the final code/proof and scoped #232 consistency.
+
+All accepted contracts, P1/F2, original operands, existing verifier claims and production ownership remain unchanged; full #234/#232 acceptance remains open.
+The copied-prefix continuation above addresses strong transport and the displayed bypass without settling general reconstruction; additional fixed-length prefix variants are unnecessary.
+
+The [fixed-parent nonexistence theorem](content-model-s06-re-01.md#no-complete-f-child-for-the-fixed-membership-loss-parent) settles #308's requested continuation over every permitted complete F child under B-v1, with arbitrary permitted finite additions and retained or fresh intermediates.
+Correspondence forces F's first edge to be restriction, while F and H.type=E remain distinct exact complex identities; any successful F-to-E path therefore contains the method excluded by H.block.
+This excludes M from effective(H), independently of whether its affiliation stays legal under empty H.final.
+The separate mapping proof extends #308's limited affiliation inventory: retained nonabstract M remains a mandatory derived leaf even when additions expand both choices, while global QName uniqueness prevents another base leaf from supplying M's name.
+Complete Recurse/RecurseLax mappings, all implicit orders, exact identity, normalization, simple-union exceptions and absence of a consumer wildcard bypass are accounted for; unchanged R_M fails derivation-ok-restriction.5.4 in every child context.
+Both consumers and all inherited particles remain mandatory roots; retained declarations, their flags/declared-type references and consumer records/particles are neither omitted nor rewritten.
+Typed direct/transitive-affiliate and fresh-intermediate controls support the primary-rule proof; bounded controls do not prove the universal conclusion.
+One fresh-context nonauthor reviewer challenges the universal argument before reliance and reviews final proof/code plus separate scoped #232 consistency.
+This proves impossibility for this inherited parent while preserving complete different Γ-root witnesses, all accepted AU/PW/DT/#178/GSC1/P1/F2 contracts, semantic owners, budgets and failure categories.
+No production obstruction API or general evidence-adequacy/negative/termination claim is added; full #234/#232 and downstream activation gates remain open.
+The research recognition criterion above supplies this theorem's previously requested bounded next action; production activation remains separate.
+
+The [mandatory restriction-consumer lemma](content-model-s06-re-01.md#one-mandatory-restriction-consumer-of-retained-hm-membership) retains #307's exact optional disjoint-name S and adds only supplied R_H restricting E and R_M restricting R_H.
+Their content is sequence1[A.content,H1,required-empty-choice] and sequence1[A.content,M1,required-empty-choice], with distinct retained wrappers/uses and exact shared original A.content/separator; admission needs no wrapping correction.
+The R_M/R_H mapping must consume effective M under required H, with no wildcard or whole-pair identity shortcut.
+Besides #306's separate H.final affiliation premises, preservation requires nonabstract M, no substitution in H.block and no H.block intersection with the exact realized segment-method union, including restriction introduced by an E rebase.
+Local constraints and the complete consumer/type/content recursive dependency conjunction are justified before decreasing-extension evidence; both consumers and all four particles remain inherited roots in every child with recomputed receipts.
+Complete stable-membership original/repaired five-/sixteen-node controls pass; the requested q=E,p=F-extension,H.final empty,H.block={restriction} parent is locally legal but its prescribed F child loses M and rejects retained R_M under derivation-ok-restriction.5.4 while affiliation and R_H remain legal.
+The two restriction types add no evidence nodes; four retained particles increase the repaired live count to eight, with the prefix/separator shared.
+This is a scoped positive and a failed fixed recipe, with no general nonexistence, production/API/budget or P1/F2 change; full #234/#232 acceptance stays open.
+The fixed-parent theorem above settles this earlier next action without changing the stable-membership positive lemma.
+
+The [retained optional-head lemma](content-model-s06-re-01.md#one-retained-optional-head-in-shared-live-content) extends #306 at exactly `S=sequence[A.content,H[0..1],required-empty-choice,wildcard]`, with H/M expanded names also disjoint from original local a.
+h0 survives reconstruction/normalization and is consumed by D′'s ordered skip and S's contextual attribution/EDC checks; all #306 path/final conditions remain.
+The content cycle S→H→H.type→S and the incoming M/type route close through a finite conjunction of independently established local constraints, followed separately by decreasing-extension required-child evidence; acyclic base ancestry does not discharge content recursion.
+Complete five-/sixteen-node original/repaired controls include both membership transitions, abstract declarations, exact dependency receipts, inherited unused roots and missing-child rejection.
+With a colliding local QName, a locally legal parent's prescribed child fails actual inherited S/E UPA and EDC while affiliation and D′ mapping pass; this refutes only the relaxed recipe, not general witness existence.
+The retained use adds one live particle: at most `k+3` distinct live particle records, exactly four at repaired k=1, while W(D)=1 still bounds only its wildcard tail.
+The exact optional disjoint-name family has outcome A; all full/general and downstream gates remain open, with no semantic-owner/verifier/API or P1/F2 change.
+Next action: analyze a retained head consumed by a non-skippable live mapping together with its complete required child.
+
+The [one-affiliation extension](content-model-s06-re-01.md#one-direct-declared-type-affiliation-in-the-live-e-forest) adds exactly fresh global H and direct member M, typed by retained E/forest identities, to #305's live-scaffold theorem.
+For distinct declared types p=M.type and q=H.type, exact q must lie on p's path; an interior q permits no extension vertex strictly below it, and H.final must avoid all original segment methods plus restriction when a rebase can introduce it.
+Equal declared types use exact identity without traversing an edge; rebasing the head or ancestors above the stopped segment imposes no additional affiliation exclusion.
+Under these explicit premises the identity-preserving simultaneous recipe and finite required-child induction retain both declarations, all helpers, particles and unused roots, checked afresh in every context.
+H.block governs effective membership separately; two complete original/repaired controls change membership in opposite directions without invalidating their witnesses.
+Original detached H references are recomputed, while repaired S/O consume no new head expansion; parent-local impossible-child traps refute only the unrestricted E-rebase recipe.
+One fresh-context nonauthor reviewer scrutinizes decisive reasoning and the final proof/code with scoped #232 consistency; exact revisions, checks and cleanup are recorded in #234/#232.
+All accepted contracts and full/downstream gates remain unchanged and open beyond this family.
+The optional retained-head continuation above addresses one such consumed role; this earlier theorem retains its nonrecursive scope.
+
+The [live-intermediate forest theorem](content-model-s06-re-01.md#simultaneous-live-intermediate-and-finite-helper-forest-reconstruction) reconstructs the exact #304 integer-restoration family with arbitrary finite acyclic content-only helper forests ending at E.
+It retains every supplied identity/owner, helper ancestry method and shared helper identity, trims E's existing tail to W(D)=1, copies repaired E content into every helper's canonical/effective raw properties, and replaces only detached fresh particle payloads by the exact original local a:int leaf.
+E's exact-A prefix, required empty choice and retained wildcard stay live; #304's trim-only F failure remains valid.
+The theorem proves hereditary local legality before induction: each nonprimitive extension helper's direct child restricts it to retained E and rechecks every inherited helper, live particle, detached particle and unused root with fresh correspondence/receipts.
+Remaining helper extension count decreases by one, giving finite supplied-forest evidence, separately from any Γ-derived helper/evidence bound or general RE01 termination claim.
+Complete original/repaired five-node controls include dependent/scoped helpers, sharing, unused roots, a missing sibling child and inherited/live-particle failures.
+One fresh-context nonauthor review covers decisive reasoning and final proof/code plus scoped joint consistency; normal delivery pins exact final revisions and checks in #234/#232.
+All accepted recovery and AU/PW/DT/#178/GSC1/P1/F2 contracts, original operands, failure categories and budgets remain intact; full #234/#232 and downstream activation gates remain open.
+The one-affiliation continuation above addresses the declaration-type audit; live consumed-head roles remain a separate next action.
+
+The seven recovery packages are accepted at PR #286 main `ad936e02b5a41029a8be8590845dd61c99fec401`, tree `3f0cc238cf42095af3e4ede751b983e916fdacb0`.
+Current AU C1, PW R-240, DT A, GSC1 and P1/F2 semantics and the complete local inventory govern new consumers; earlier implementation statuses below are historical.
+The [standalone RE01 investigation](content-model-s06-re-01.md#independent-helper-reduction-investigation) adds a scoped ancestry contradiction and an affiliation/UPA falsifier of arbitrary child installation, with full witness/evidence adequacy, general negatives and search termination still open.
+The [focused resumption](content-model-s06-re-01.md#fresh-complex-types-at-the-named-particle-comparison) establishes the fresh-complex NameAndTypeOK necessary condition and a complete helper witness that distinguishes two-head membership.
+Pointwise type compression preserving that vector fails, while changed-vector alternative witnesses pass for the empty endpoint.
+An anchored raw-particle construction then makes the vector necessary and refutes no-new-nonprimitive witness selection; its complete two-node certificate still passes in each required context.
+Alternative helper/signature extraction, general evidence adequacy, complete negatives and mathematical termination remain open.
+The [helper-permitting investigation](content-model-s06-re-01.md#helper-permitting-construction-investigation) refutes flat one-edge member representatives with an anchored three-head case requiring both derivation methods.
+Restriction wrappers repair that case, and both mixed-method orientations have complete context-local finite evidence with inherited roots preserved.
+B eligibility and method signatures alone cannot certify the helper's restriction child; the live-content contrast preserves that reconstruction debt.
+The recursive consumed-root contrast has a scoped full-helper nonexistence proof: the required nearest-extension child destroys a membership fact needed by X, which is consumed in that child.
+This rejects neither legal component-reference recursion nor general finite-evidence adequacy, and adds no general-negative API.
+The repaired family's arbitrary-success extraction, general evidence adequacy and terminating negative criterion remain open after alternative investigation and independent scrutiny.
+Each obligation stays in its required context, including inherited fresh roots; preservation across contexts is required only for facts a method transfers or installs.
+The [role-sensitive continuation](content-model-s06-re-01.md#role-sensitive-extraction-and-simultaneous-copied-content-reconstruction) separates exact named/intermediate anchors from support-path observations.
+Its all-complex relation replay lemma retains segment methods and entered blocks; the two mixed orientations differ at exact interior anchors despite equal common-B vectors.
+For arbitrary finite copied-B forests in the exact nonrecursive fixture template, per-member extraction preserves every expansion name, and simultaneous no-addition reconstruction yields complete evidence by decreasing fresh extension count with every inherited root checked.
+Sharing, unused roots, missing sibling evidence and the z:X contrast have independent controls.
+The [empty-or-copied-B replacement lemma](content-model-s06-re-01.md#empty-or-copied-b-replacement-lemma) relaxes only helper content to allow actual empty content with no particle.
+Simultaneously filling every empty helper in a new root relative to immutable Γ retains ancestry, identities, methods, members and X's complete relevant expansions/mapping; legality is re-established through the copied-B theorem, including inherited fresh roots.
+The empty S restriction and empty U extension, their required U-to-B child and the copied replacement pass complete finite verification; edge-label-only illegal candidates remain excluded.
+This is a scoped template theorem, not a B-v1 domain restriction, general witness bound or complete decision procedure; arbitrary raw/AU/scalar/bridge reconstruction and general contextual adequacy/termination remain open.
+The [private helper-particle replacement lemma](content-model-s06-re-01.md#private-helper-particle-replacement-lemma) additionally permits finite acyclic element/sequence/choice helper structure with shared private particles and reused original declarations.
+Simultaneous exact-B replacement in a new root omits only the wholly private fresh-particle inventory, audited across canonical/raw containment, typed references, ownership and correspondence; every retained helper/member remains a required root in each child.
+The fresh S-owned P+ tightens B's outer range to `1..1`; S restricts B, U extends S with the same P+, and the required U-to-B child preserves it with complete original evidence.
+That control, a shared particle DAG and their independently checked copied alternatives pass; every copied-B theorem premise is re-established, while nonprivate particle roles and all general acceptance gates remain outside this result.
+The [privacy-implication investigation](content-model-s06-re-01.md#complete-privacy-is-an-independent-template-premise) establishes that privacy is independent of the other template premises: a fresh scoped helper U can retain `identity.owner = P+` after simultaneous canonical/raw exact-B content replacement.
+The one-particle example preserves every other premise and passes complete original and dual-replaced root/child evidence while P+ remains; omission fails required owner membership.
+Fresh scoped ownership is governed by the current abstract B-v1 context, separately from persisted/source incidence rules; no XML representation is claimed.
+The private theorem keeps its hypothesis; its historical next assignment is addressed by the conditional continuation below.
+The [simultaneous scoped reconstruction lemma](content-model-s06-re-01.md#allocation-certified-simultaneous-scoped-reconstruction) establishes positive reconstruction for a supplied, checked fresh injective allocation, including dependent scoped-owner identities, canonical/raw references and keyed records.
+Owner membership/acyclicity, anonymity, explicit namespaces, ancestry, sharing, expansions and original correspondence are justified separately before invoking the copied-B evidence theorem.
+Two particle-owned helpers, a dependent scoped helper, shared incoming members and unused roots have complete original/reconstructed five-node contextual evidence; collision, stale-reference/owner/key and missing-child controls preserve the limits.
+Unconditional allocation existence remains unresolved because `scopedId` hashes a finite output space; distinct fresh paths alone prove neither freshness nor a total successful allocator.
+This is outcome B with an allocation-certified positive subfamily, not nonexistence or a new B-v1 restriction.
+The [identity-preserving investigation](content-model-s06-re-01.md#identity-requirements-and-the-unchanged-particle-alternative) audits the five allocation exclusions against actual new-root consumers.
+Original Γ/current retained/pairwise allocated uniqueness is required; excluding omitted particle and former replaced-helper IDs is sufficient for #294 but is not a historical-freshness rule of a new Γ-root.
+Relaxing those exclusions supplies no universal allocation theorem; #294's conditional certificate remains intact.
+Preserving all helper/member identities and the complete unchanged particle inventory passes complete evidence for the existing simple/shared-DAG forests, including dependent scoped owners and unused roots.
+It fails universally over locally successful template roots: a retained shared-Q1 DAG passes both root local checks, but U's mandatory restriction child exposes anonymous members at distinct positions and fails `cos-element-consistent` at P+ while UPA passes.
+Inherited M:U affiliation to H:B forces every permitted U intermediate to be exact B, so another intermediate cannot repair this retained root.
+The named-type contrast and allocation-certified omission alternative pass complete evidence; the failing original is asserted locally successful, not an arbitrary fully successful witness.
+This proves neither fresh allocation necessary for every reconstruction nor failure of all identity-preserving alternatives.
+That slice left actual particle-structure/correspondence preservation duties for a later identity-preserving alternative.
+General coverage/evidence/bounds/negatives/termination and downstream gates remain unchanged; #234/#232 stay open.
+
+The [detached-particle reconstruction lemma](content-model-s06-re-01.md#identity-preserving-detached-particle-reconstruction-lemma) resolves that bounded continuation for the unchanged nonrecursive template, with no fresh-allocation premise.
+In a new root over immutable Γ, it keeps every supplied identity/owner and all helper/member ancestry, names and sharing, copies helper canonical/effective raw content to exact B, and replaces only each detached fresh particle's term/occurrence with a `1..1` reference to exact original local string delimiter z.
+Scoped identity derivation uses owner/path/role rather than those payloads; original/endpoint correspondence and provenance remain fixed, while every required child inherits the reconstructed payloads unchanged.
+
+The proof explicitly extends copied-B to these additional mandatory particle roots and particle-owned helper chains: each new leaf consumes only z/string, has trivial EDC/UPA and remains legal independently of H/Q1/Q2 expansion changes.
+The same no-addition descent rechecks complete closure and correspondence in each context, including unused helpers/members/particles, without transferring receipts.
+The theorem states semantic success as its coverage premise and also establishes the stronger locally successful-root statement within this supplied family; it supplies no extraction of arbitrary B-v1 witnesses or Γ-derived search bound.
+
+Typed controls repair the exact #295 EDC trap and shared DAG with complete five-node evidence, dependent owners and shared incoming members.
+The unchanged trap still fails, missing unused-helper child evidence remains unresolved, and inherited particle replacement is rejected.
+The sole fresh-context nonauthor reviewer challenges the audit and proof extension before reliance and reviews final proof/code and scoped joint consistency; #294's conditional theorem, all seven recovery inputs, P1/F2, budgets and all full/downstream gates remain intact.
+Next action: audit one additional consumed helper role outside this template before extending reconstruction; general coverage/evidence/bounds/negatives/termination remain open.
+
+The [one abstract bridge theorem](content-model-s06-re-01.md#one-abstract-affiliation-bridge-under-immediate-head-final) extends #296 to a separate actual source with H.final `{restriction}`, one fresh abstract F typed by exact original B and affiliated to H, and members directly affiliated to F.
+F→H compares B identity with itself under H.final; M→F uses empty F.final, while effective transitive membership still uses the queried original head's block and entered type blocks.
+F is filtered from expansion but remains a mandatory legality root in the reconstructed root and every child.
+Exact-B helper content and detached z:string particles retain every identity/owner, sharing and unused root; the complete no-addition induction rebuilds each context's evidence as fresh extension count decreases.
+The arbitrary finite supplied-family theorem is established separately from its complete five-node control, which checks F and the entire inherited inventory and changed Q1/Q2 child memberships.
+The direct mixed member→H contrast fails immediate final, and an independently prepared H.block contrast retains legal bridge affiliations but loses effective membership; neither is a general impossibility claim.
+Historical local affiliation controls, #294/#295 limitations, all accepted inputs, original operands, failure distinctions, budgets and downstream gates remain intact.
+No bridge chain, fresh bridge type, other helper role, recursion, production activation or general search bound is added.
+Next action: audit the existing live-content helper's raw particle identity role and failed required restriction-to-B child, then state one bounded repair before combining broader content with this bridge.
+
+The [exact optional-wildcard-suffix continuation](content-model-s06-re-01.md#exact-optional-wildcard-suffix-with-identity-preserving-reconstruction) extends #296's direct-H family separately from #302.
+The original single-extension control prepares and passes local U extension/affiliation, but M remains Q2-effective and X's root mapping fails; its complete supplied root is rejected.
+U's required child separately fails the ordered first-position MapAndSum `0..4` against required H `4..4`; its outer `1..1` does fit B's `0..1`, correcting the earlier shorthand.
+
+The only added old shape is a fresh `1..1` sequence of exact original B content followed by a fresh `0..1` wildcard in the existing disjoint namespace with skip processing.
+After auditing raw/canonical, correspondence, provenance, namespace and identity consumers, simultaneous helper exact-B and detached-particle z:string replacement retains every identity/owner, method, member name, sharing and unused root with no new identities.
+All original helper-edge legality remains an explicit premise; complete repaired contextual evidence follows from copied-B closure, independent z leaves and decreasing fresh extension count, with each child's inherited particles unchanged.
+
+A separately identified mixed direct-H construction passes all original local obligations while retaining the failed original U child, then passes complete five-node repaired evidence including unused V/C, particle-owned helpers, dependent owners and shared members.
+The controls rebuild correspondence and complete context-qualified receipts in every required child; missing unused-helper evidence remains unresolved and inherited wildcard-payload restoration is rejected.
+The sole fresh-context nonauthor reviewer assesses decisive reasoning before reliance and final proof/code plus scoped consistency; #294/#295/#296/#302 and all accepted inputs retain their precise scopes.
+General coverage/evidence adequacy/input-derived bounds/complete negatives/mathematical termination remain open, with no production API, validator, identity representation, release or activation change.
+Next action: audit one additional content consumer outside this exact direct-H family before broader reconstruction; no wildcard necessity or general nonexistence follows.
+
+The [meaningful-prefix capacity audit](content-model-s06-re-01.md#input-derived-meaningful-prefix-capacity-audit) establishes an immutable Γ frontier capacity W from effective declared source particles, counting shared/group-use incidences without expanding occurrences or type references.
+For each qualified hypothetical context whose final normalized root is an element or unit sequence, r ≤ W(D), b ≤ W(A), grid states ≤ `(W(D)+1)(W(A)+1)` and replacement tail ≤ W(D).
+Virtual substitution alternatives remain inside choice slots but still affect branch membership, comparisons, ordering and contextual evidence; this is no bound on their internal components or complete search work.
+
+A complete current-verifier integer-restoration witness consumes fresh E's added wildcard; erasing that content preserves raw extension/correspondence and fails final restriction.
+A second complete witness retains a fresh restriction F consuming two E wildcards: trimming E alone to D's one-wildcard tail preserves D's mapping and exact identities but fails F's required construction.
+This refutes pointwise context-preserving replacement, not a bounded-tail existential witness, since unused F can be omitted or repaired.
+
+Outcome B retains the Γ-derived particle capacity and conditional exact-original-prefix mapping reconstruction.
+Comparison transport from property-equal prefix copies, simultaneous helper reconstruction, identity admission and complete child evidence remain unresolved.
+No helper/evidence/general-negative/termination bound or broader branch coverage follows; all accepted inputs and downstream gates retain their scopes.
+Next action: extract content consumers and contextual facts for simultaneous reconstruction, starting with F's restriction role.
+
+The [architecture recovery checkpoint](content-model-s06-re-01.md#architecture-recovery-domain-and-proof-checkpoint) stages concrete shared source owners, original-AU plans, context isolation and real-input preparation measurements.
+It preserves #231's original branch/history. The maintainer selected finite fresh helpers and affiliations, and independent review accepted the complete B domain contract.
+The maintainer subsequently selected [existential raw-AU matching, satisfying implicit-set order and GSC1 generated scalar properties](content-model-s06-re-01.md#selected-raw-matching-implicit-order-and-generated-scalar-properties); their implementation and exact delivery remain subject to local independent acceptance.
+The concrete finite checker verifies supplied nested evidence under that domain; complete local-owner acceptance and the universal theorem retain their separate review gates.
+Original scalar selectors and facet bindings now preserve source identities across hypothetical contexts through the same shared type, scalar, AU and particle owners.
+Generated scalar slots carry separate context-qualified construction evidence; the actual schema checks all original slots, while hypothetical closure checks consumed slots and their dependencies.
+Independent complete-property comparisons and genuine generated-scalar witnesses extend the finite checkpoint without selecting the remaining multi-pattern or repeated-facet interpretations.
+Source-owned local functions and conditional proof lemmas do not close #232/#234 or activate #179/#153.
+
+The [October 11 addendum](https://github.com/TechSpokes/typescript-wsdl-client/issues/234#issuecomment-6110178846) supersedes the historical global hypothetical-overlay characterization.
+The [derivability continuation](content-model-s06-re-01.md#derivability-and-affiliation-continuation) executes the independently specified affiliation contrast and implements a structural dependency census and isolated research model selection.
+Actual Γ remains immutable with all actual legality obligations; these concrete outputs do not yet discharge arbitrary-witness coverage, complete semantic checking or the joint acceptance gate.
+
+The [historical #234 literal continuation](content-model-s06-re-01.md#literal-preparation-and-fresh-attribute-helper-continuation) adds executable preservation and fresh-AU projection evidence within its declared model.
+The [revised continuation](content-model-s06-re-01.md#derivability-and-affiliation-continuation) owns the current complete-proof and qualified-authority obligations under the addendum; the old universal overlay requirement is not inherited as a new gate.
+The [current production adapter and resumption condition](content-model-s06-re-01.md#current-blocker-and-production-resumption) follow the amended derivability judgment.
+The [historical literal adapter](content-model-s06-re-01.md#r6-remaining-blocker-and-exact-production-adapter-changes) remains evidence for its experimental preservation policy.
+
+The [executed #260 investigation](content-model-s06-re-01.md#executed-design-investigation-for-260) adds finite method comparisons and an independently reviewed construction-domain packet.
+Its joint identity/UPA obstruction prevents combining separate local repairs; original identity, blocking and membership must be checked together.
+The [#260 continuation](content-model-s06-re-01.md#construction-contract-and-engineering-recommendation-after-260-continuation) specifies a literal abstract graph, preserved assessment context and coherent endpoint, and recommends a shared qualified checker with proof-gated candidate search.
+It supersedes the interim construction-domain blocker; exact continuation review and delivery govern #260 closure, while #234's complete theorem and #232's joint acceptance remain open and production owners retain their gates.
+
+This delivery records executable research and the maintainer's selected AU01, PW01 and DT01 contracts.
+Each selected leaf requires complete independent semantic review and exact delivery gates; its issue handoff records final acceptance.
+AU01/#233, PW01/#235 and DT01/#236 have completed their local acceptance and are closed; their selected contracts remain the continuation predicates.
+RE01's full-type completeness proof, #232's joint gate and the production assessment draft #179/#231 remain open, so S06/#153 and S07/S08 readiness remain blocked.
+
+The approved [ADR-003](decisions/003-content-model-contracts.md), [decision register](content-model-decisions.md), catalog format 2 and `xsd10-faithful-v1` remain unchanged.
+Original-source regeneration for flattened catalogs, structural companions and the legacy public default retain their existing contracts.
+#180 owns production matching, #181 owns independent model enumeration, and #184 owns payload scalar enforcement.
+
+## Checkpoints and source authority
+
+The research branch starts from accepted main `5876065b00d4eeb6d2324eaa63ff9b70e2279198`, tree `b647d9b0343d421426a539fc008c3cffa82c7875`.
+The TypeScript continuation starts from [PR #254](https://github.com/TechSpokes/typescript-wsdl-client/pull/254), commit `ddd90663aa88670edcca4371f7a142d94a5d36da`, tree `f00f442b4306285c20e0f6524ae50c652e0e50b6`.
+That migration candidate is unmerged at this checkpoint; #239's normal review, protected merge and closure remain separate from permission to continue isolated research.
+Its [NT-CONT-01 handoff](https://github.com/TechSpokes/typescript-wsdl-client/issues/239#issuecomment-6099806801) distinguishes one live Node primary, selected independent contract checks, pinned historical secondary observations and explicitly unqualified capabilities.
+The continuation preserves those evidence limits and introduces no Python execution or dependency.
+[The exact #178 handoff](https://github.com/TechSpokes/typescript-wsdl-client/issues/178#issuecomment-6086062948) defines the single occurrence-analysis input.
+The unaccepted #231 draft is inspected separately at `460f5b8379c68ffef79917284e445b5ab046429e`, tree `56830b28d1006b019918a364aa62f1ed9d7d8817`.
+
+[Its tested blocked handoff](https://github.com/TechSpokes/typescript-wsdl-client/issues/179#issuecomment-6088537340) and [independent review](https://github.com/TechSpokes/typescript-wsdl-client/pull/231#issuecomment-6088474178) are historical inputs.
+No assessment module is imported from that draft into the research runtime.
+Copied fixtures identify that exact source revision; historical expected outcomes are not silently rewritten.
+
+### Architecture recovery reconciliation of #231
+
+Recovery starts on current main `7d652fea79fddce8fd407f5c18dc2645ad203cc5`, tree `77de8bccba79228208c405b8c43582c4f00154f4`.
+The task-owned branch is `codex/architecture-recovery-232`; the original draft branch, checkout and history are preserved.
+The following ports are reviewed against current contracts rather than accepted through the draft's historical checks.
+
+| Draft area | Recovery disposition | Contract correction |
+| --- | --- | --- |
+| `scalarSchemaAssessment.ts`, `schemaDatatypeValues.ts`, `schemaPattern.ts`, `schemaUri.ts` | Deliberately ported behind `schemaScalarKernel.ts` | Authenticated context, shared sticky request budget, original typed operands and explicit aggregate prerequisites; exact calendar implementation shared with DT01 |
+| `schemaAssessmentContext.ts` | Replaced by `semanticContext.ts` and narrow scalar adapter | One immutable actual preparation, isolated deltas, complete context-qualified lookup and original source evidence; no NodeId-only hypothetical cache |
+| `attributeSchemaAssessment.ts` | Replaced by `schemaAttributeUses.ts` and `wildcardAlgebra.ts` | Original AU identities and C1 constraints, universal source replacement, schema operands retained after prohibition, normative wildcard subset distinguished from mathematical inclusion |
+| `schemaSyntaxAssessment.ts` | Deliberate actual-source port | Source checks retain their role; abstract candidates do not acquire invented XML syntax obligations; negative occurrence and simple-content syntax controls corrected |
+| `particleSchemaAssessment.ts` | Reconciled in concrete local particle owners | Shared #178 arithmetic and R-240; normalized comparisons remain distinct from raw extension construction |
+| `assessSchemaProfile.ts` blanket obligation discharge | Not adopted | Every required obligation needs matching concrete evidence; structural preparation and local receipts do not certify aggregate legality |
+| `operationSchemaAssessment.ts` and public orchestration | Preserved as later #179 integration input | Existing selected-closure behavior and operation capability boundaries are not renamed into full-schema acceptance |
+
+Research now consumes the reviewed internal source authorities through compatibility adapters.
+The manifest pins those source entries, and its dependency audit prevents shipping source from importing research implementations.
+This direction of reuse implements #232's staging amendment without activating public faithful assessment or altering persisted catalogs.
+
+The complete October 28, 2004 [structures source](https://github.com/jacoelho/xsd/blob/142f25ee187e17f041af87b6bfcfc82385254520/docs/spec/xml/structures.xml) has SHA-256 `e496af408b14853e6169ac7c1fca09d55a81bd73771758ad6be020960e1317ba`.
+The corresponding [datatypes source](https://github.com/jacoelho/xsd/blob/142f25ee187e17f041af87b6bfcfc82385254520/docs/spec/xml/datatypes.xml) has SHA-256 `430f010df8ed077a4ed11d9d5812ea5e5d62ba67e715f1bbeeaa8ee1765d84c7`.
+Both were retrieved and their bytes independently checked in this session.
+
+The official [second-edition errata](https://www.w3.org/2004/03/xmlschema-errata) contain the E1-56 PSVI correction and no Part 2 correction.
+[WG 2232](https://www.w3.org/Bugs/Public/show_bug.cgi?id=2232) proposes the wildcard member-bound adjustment without adopting it as XSD 1.0 errata.
+[WG 3256](https://www.w3.org/Bugs/Public/show_bug.cgi?id=3256) concerns the incompatible XSD 1.1 negative-year interpretation.
+
+## Four-rule contract map
+
+| Contract | Research record | Input and downstream owner | Acceptance status |
+|---|---|---|---|
+| AU01 C1 v1 | [Attribute uses](content-model-s06-au-01.md) | Original AU/declaration identities and typed constraints; #179/#184 | Locally accepted; #233 closed |
+| RE01 candidate v1 | [Reordered derivation](content-model-s06-re-01.md) | Original derivation operands plus reviewed AU/PW/scalar predicates; #179 | Complete procedure/proof gate open |
+| PW01 R-240 v1 | [Wildcard cardinality](content-model-s06-pw-01.md) | Original member/group ranges, wildcard namespace/process context; #179/RE01 | Locally accepted; #235 closed |
+| DT01 A v1 | [Calendar semantics](content-model-s06-dt-01.md) | Original lexical/type context, exact years/fractions; #179/#184 | Locally accepted; #236 closed |
+
+DT01 feeds AU01 only where compared operands use calendar semantics.
+AU01 and PW01 feed RE01; DT01 feeds RE01 only where an actual proof invokes scalar predicates.
+Selected interfaces count as accepted predicates only after their independent local review and delivery gates pass.
+
+A leaf's own contract, evidence, independent review and protected delivery govern its acceptance.
+No leaf waits for sibling or parent closure, and the epic separately assesses joint consistency.
+The selected interpretations below are project decisions; successful probes alone do not establish their complete contracts.
+The missing RE01 proof prevents joint acceptance even after sibling local acceptance.
+
+## Selected interpretations and remaining proof
+
+### AU01: Multiple uses and conflicting augmentation
+
+The [selected C1 interpretation](https://github.com/TechSpokes/typescript-wsdl-client/issues/233#issuecomment-6095916709) retains the AU set, combines requiredness with logical OR and checks every present fixed constraint.
+An absent optional attribute remains absent when unconstrained, receives one equivalent candidate value when augmentation is unambiguous, and fails that instance when candidates conflict.
+Conflicting fixed values can produce an empty accepted-instance set without inventing schema invalidity.
+
+C1's absent-instance rejection is an explicit project interpretation, not existing primary text established by this investigation.
+The maintainer [also selected universal matching for source replacement](https://github.com/TechSpokes/typescript-wsdl-client/issues/233#issuecomment-6095977338): each replacement satisfies every matching original base AU, while omitted uses retain unchanged identities and obligations.
+The local-most selection alternative can weaken inherited fixed constraints and changes default behavior according to source order.
+Blanket duplicate-schema rejection would introduce an additional profile rule; the [complete AU01 table](content-model-s06-au-01.md) records the consequences and the C1 recommendation.
+
+### PW01: Original versus adjusted member bounds
+
+The literal 2004 alternative compares every member with the original wildcard minimum and maximum, then checks the group's original effective total range.
+The [selected R-240 proposal](https://github.com/TechSpokes/typescript-wsdl-client/issues/235#issuecomment-6095922074) compares members recursively with `0..original-max` while checking the whole group against the original `min..max`.
+The proposal admits optional-member and repeated-group controls rejected by the literal reading, retaining namespace, maximum and processing checks.
+
+The [PW01 investigation](content-model-s06-pw-01.md) explains why neither reference engine's result establishes the interpretation.
+R-240 is an explicitly selected project interpretation because the proposal was never adopted as XSD 1.0 errata.
+
+### DT01: A closed calendar across the BCE boundary
+
+[Selected option A](https://github.com/TechSpokes/typescript-wsdl-client/issues/236#issuecomment-6095933213) preserves the lexical negative-year leap calculation and supplies contiguous rollover that skips year zero.
+Option B shifts BCE years into astronomical coordinates, changing which negative-year leap dates are valid.
+Literal Appendix E option C can calculate forbidden year zero and fails closure; adopting XSD 1.1 changes the approved profile.
+
+The [DT01 contract](content-model-s06-dt-01.md) provides the exact selected arithmetic, truth tables and conflicting original authority.
+Option A is a concrete project repair decision and does not become W3C errata merely because its probe passes.
+The record also distinguishes value-level addition and field-tuple arithmetic.
+Second-60 overflow and recurring-time ordering were separately selected: a modulo-day clock comparison can reverse the written arbitrary-date ordering at an offset wraparound.
+Candidate A includes those choices explicitly, with alias consistency and exact known/unknown-zone endpoints in the shared contract.
+
+### RE01: A missing proof cannot be approved into existence
+
+The recommended direction applies the numbered existential component rule, preserving known vacuous and dead/wildcard witnesses.
+The [RE01 prototype](content-model-s06-re-01.md) supplies useful checked positive constructions, but lacks a complete full-type negative theorem.
+The remaining theorem must cover normalization/all placement, mixed/simple content, source/final/block identity and AU witness synthesis with accepted scalar predicates.
+The dated specification's component-identity note leaves some unnamed identities incompletely defined.
+The [concrete RE01 equality options](content-model-s06-re-01.md#concrete-equality-options) therefore distinguish literal original IDs, abstract sharing and a source-representable incidence-preserving correspondence; fresh direct AUs cannot silently become inherited original uses.
+
+The new [named-group contrast](content-model-s06-re-01.md#executable-named-group-comparison-contrast) supplies executable evidence for the witness-domain and comparison-closure distinction.
+A bounded supplied-certificate checker verifies final AU incidence without claiming complete witness existence or general scalar equivalence.
+Fresh Node observations are recorded separately from the selected component predicates; duplicate-use rejections do not decide the C1 or RE contracts.
+
+The [revised recommendation](content-model-s06-re-01.md#witness-domain-and-comparison-decision) separates component representation from hypothetical endpoint resolution.
+It recommends abstract construction plans with original AU sharing and a separately checked hypothetical graph overlay, preserving the immutable actual graph and diagnostic provenance.
+Requiring XML reconstruction adds source-mapping obligations; freezing actual ancestry in hypothetical queries can exclude the supplied existing-intermediate construction.
+The [recursive all-group contrast](content-model-s06-re-01.md#recursive-endpoint-and-existing-intermediate-contrast) demonstrates that concrete difference in an invoked NameAndTypeOK query and adds an original intermediate-identity completeness obligation.
+This is a research recommendation, not an adopted production interpretation or a complete theorem; hypothetical roles, comparison closure and context-sensitive component checks remain open.
+
+The standalone [#256 resolver specification](content-model-s06-re-01-resolver.md) now defines those research interfaces and ownership: explicit D1/E2 membership with outgoing closure, excluded incoming relationships, anchored endpoint correspondence and all-member proposed-context checks. Its independently established retained-substitution contrast prevents reusing actual-schema affiliation answers after ancestry changes; complete candidate-family and ambient-schema preservation proofs remain #234 obligations.
+
+The [R1–R7 implementation record](content-model-s06-re-01-resolver-implementation.md) documents the bounded research resolver, its authority limits, combined controls and future production adapter.
+It checks one supplied construction and preserves original identity/source operands; complete semantic owners require qualified receipts or report unresolved obligations.
+Resolver readiness does not discharge the full-type witness theorem or #232's joint acceptance gate.
+The linked delivery handoff records exact revised parent, reviewed implementation and merged-main checkpoints; the earlier unmerged-parent observations above remain historical.
+
+The [post-resolver proof audit](content-model-s06-re-01.md#full-proof-audit-after-resolver-delivery) starts from verified main `b0992d00768cff5891cb924a734892ea675a55b8`, tree `cec7d141dfa3b9f3b2e4d96e0f17ca9626c3a6b3`.
+Nine new source controls and seven independently specified strict TypeScript tests demonstrate nonmonotone ambient membership, intermediate `block` sensitivity, a mixed empty-prefix normalization case and the source-style versus literal abstract AU-extension gap.
+They also support a terminating identity/path negative proof when the earlier `M:D/H:B` affiliation must be retained; that proof applies to the stated ambient requirement rather than every permitted smaller schema.
+
+The audit pins AU01 C1, PW01 R-240 and DT01 A to their shared independently reviewed head `c5f6e38600e7acbd700bf15eaea3092ba15fb174`, tree `28a0907ffe4ccc068197c16014c87915b00df495`, normally merged at `f4e39e819f2d9aa264cfdd14d16154c6443c9bac` with the same tree.
+Its joint map reconciles original operands, schema-versus-payload diagnostics, inclusive accounting and #184 scalar ownership without claiming delegated preparation assumptions passed.
+Joint acceptance remains blocked by the unresolved full witness-domain and candidate-reduction theorem, not by sibling closure or a failed budgeted search.
+
+The particle controls separately expose nontransitive MapAndSum restriction, original singleton-all placement, base final exclusions and ordinary simple-content ancestors.
+An empty-facet no-inline simple-content restriction is not proved to create a fresh anonymous scalar, so no source-impossibility claim relies on that assumption.
+Keep #234 and #232 open until the complete procedure is justified and substantively reviewed; do not substitute a smaller permanent profile or a search cutoff.
+
+## Joint consistency assessment
+
+Every contract preserves original source-local operands and declaration/use identity.
+Expanded QNames retain original namespace and chameleon/import context; lexical aliases are compared only after typed assessment.
+Restrictions, extension concatenation, schema-only operands, absent components and effective runtime closure remain distinct.
+
+Formal `schemaEmptiable` and effective total range remain separate from accepted-language nullability and realizability.
+Required empty choices and wildcard intermediates cannot be erased from RE01 evidence.
+PW01 intervals do not establish count-gap or payload-language inclusion.
+
+All proposals distinguish invalid schema, unsupported capability, unresolved research interpretation and resource exhaustion.
+An unresolved research result does not become a new permanent production error category or policy-switch framework.
+#179 must retain actionable component/source/related/operation diagnostics at its existing boundary.
+
+## Exactness and budgets
+
+Current measured configurable semantic defaults are 100,000 nodes and 125,000,000 work units, inclusive.
+Earlier 1,000,000-work examples retain their historical or explicit regression scope; they do not define the current default.
+Exact finite operands retain arbitrary integers, `unbounded` remains distinct, and zero semantics are preserved.
+Prototype preflight, indexing, fixed points, operand processing and copies must charge before their allocation or execution.
+
+Configured exhaustion returns explicit `resource-limit` with no successful partial plan.
+Exhaustion of an unproved or incomplete candidate family cannot prove existential invalidity, even when it terminates.
+Research measurements establish the measured probe boundary only, not #208's later production or platform qualification.
+
+S03/S04 loading and catalog limits and conservative cyclic-depth behavior remain unchanged.
+Later matcher, payload lexical/digit, generated-output and streaming budgets retain their D09 first owners.
+No prototype imports payload digit limits into schema-only assessment or expands huge occurrence counts into events.
+
+## Required production continuation in #179
+
+After each complete interpretation and proof passes its review gate, #179 must adapt the accepted contract into the existing immutable graph assessment path.
+It must not merge #231 merely to obtain fixtures or activate its four guarded paths from prototype results alone.
+The complete #179 integration then needs fresh combined review and validation at its actual final revision.
+
+AU01 requires source-faithful set union of AU identities, correct declaration/group uniqueness and all retained use/default/fixed obligations.
+Any approved augmentation rule must define absence, requiredness, conflicting constraints, typed value equivalence and deterministic lexical witnesses for #184.
+Existing `AssessedAttribute.constraints` and `compatibleUses` need explicit review against that selected rule.
+
+RE01 requires a complete implementable criterion covering approved normalized particles, repeated/composite and legal recursive types, content varieties and derivation flags.
+It must prove positive witness soundness, complete negative answers and termination with sufficient resources, then return explicit resource-limit under configured exhaustion.
+Its proof must pin accepted AU01/PW01/DT01 predicates actually used and discharge every precondition.
+
+PW01 requires the selected member/whole-group interpretation using original occurrence operands and the single #178 occurrence analysis.
+Namespace subset, imported `##other`, process strength and original declaration/use ranges remain independently enforced.
+The existing discharged `0..unbounded` subset remains available, without narrowing the intended profile to that subset.
+
+DT01 requires the selected complete calendar coordinate, lexical admission, rollover, normalization, equality and partial ordering shared with #184.
+Correct the assessment documentation's BCE sentence: both pinned engines accept `-0004-02-29Z` and reject `-0001-02-29Z` in the date/dateTime controls.
+That factual correction does not authorize removing negative-year or crossing-zero guards before the complete contract is accepted and implemented.
+
+## Downstream qualifications and next ready work
+
+The immediate next work is the [single semantic investigation packet](#current-purpose-and-next-investigation), beginning with the dated-rule correspondence audit and a concrete distinguishing inference or failed premise.
+B-v1's quantified domain and complete local contracts are already selected; historical resolver/domain assignments are not requests to redefine them.
+After that semantic gate, arbitrary-success coverage, evidence adequacy, complete negatives and mathematical termination still require the separate proofs listed above.
+Existing supplied-candidate and incidence checkers remain evidence tools rather than a general decision procedure.
+#179 may inspect these research inputs while keeping affected assessment gates open; the full accepted research epic must precede production activation.
+#153 remains the combined S06 acceptance owner and S07/S08 retain their existing dependencies.
+
+S01/#181 oracle disagreements, S05 reference disagreements, D07 streaming/incoming-security gates and SOAP/gateway/platform qualifications remain owned and open where previously recorded.
+No private production vendor, Windows platform, codec, adapter, payload scalar engine or public activation is qualified by these research probes.
+No packages, release tags or releases are published in this delivery.
+
+## Reproduction and acceptance ledger
+
+Run from a clean checkout of the delivered revision with Node 24 or 26 and npm:
+
+```bash
+npm ci --cache tmp/cache/npm
+npm run reference:setup
+npm run check:toolchain
+npm run typecheck:research
+npm run typecheck:reference
+npm run test:research:ports
+npm run ci
+npm run test:reference:full
+npm run test:conformance
+npx tsc -p test/conformance/tsconfig.json
+npx tsc -p test/research/s06-pw01/tsconfig.json
+npx tsc -p test/research/dt01/tsconfig.json
+npm run research:re01:measure
+npx tsx test/research/dt01/measure.ts
+git diff --check
+```
+
+The [research manifest](../test/conformance/s06-research-manifest.json) identifies committed leaf records, prototypes, reference discovery files and fixture digests.
+The [provenance audit](../test/conformance/s06-research.test.ts) verifies those hashes and discovery paths without adding product capability claims.
+The linked delivery PR and issue handoff record exact reviewed/head/merged revisions and trees, actual commands/counts/versions, independent findings and hosted checks.
+This external ledger avoids self-referential commit hashes and must be verified before treating any delivery revision as accepted.
+
+IDE inspection tools are unavailable; repository documentation/support-matrix, TypeScript, executable reference/prototype, CI and installed-consumer checks provide portable verification.
+Unrun or unpassed checks must be named in that ledger, including full semantic acceptance and all later production gates.