C.32.MLAO - Architecture Candidates to Reduce Cross-Scope Residuals
Type: Architectural subpattern under C.32 Status: Stable Normativity: Normative unless explicitly marked informative
C.32.MLAO:1 - Problem frame
Use this pattern when a practitioner has a recoverable cross-scope or interlevel architecture residual and needs candidate architecture changes that reduce that residual under a declared evolution window.
Primary working reader: an architect or architecture-responsible practitioner who has already recovered a residual and must prepare candidate changes without calling a local improvement a whole-holon optimum.
Typical entry phrases:
"The local architecture improvement made another scope worse."
"The platform helps product teams but grows evidence exceptions."
"Local agent autonomy conflicts with the control or policy scope."
"The method template speeds authoring and slows review."
"The graph looks better, but which architecture change reduced the residual?"
First-minute use slice. A regulated product-family team has used C.30.ILC to name a residual: local product variants are quicker to ship, but certification evidence grows at the family scope. Using C.32.MLAO, the practitioner frames three residual-reducing candidate changes: add evidence scope, narrow interface grammar, or accept a bounded exception with a reopen trigger. Each candidate states the residual it reduces and the new burden it creates. The team now has explicit inputs for A.19.CPM, C.11, A.19.SelectorMechanism, or G.5 when comparison, local choice, selection, or selected-set result declaration is current.
The primary EntityOfConcern is a residual-reducing candidate frame for one grounded architecture question. In plain working terms, the frame asks where a local architecture improvement moved the cost and which candidate can reduce that moved cost without hiding its new burden. The described holon can be a system, organization-as-system, discipline, AI-agent setup, built asset, episteme, work occurrence, or an instance of another admitted holon kind. Recover source labels such as practice, culture, tradition, style, or method before architecture use. Use E.10.ROLE for unresolved role wording: it may resolve to a local system-role kind, an assignment occurrence, a participant position in a direct relation, a function claim, an organization or representation position, or ordinary wording. Carry only the recovered object or relation, never a generic role-side structure. Candidate Systems, assignments, Methods, plans, and structures remain modal content until their own facts obtain; a publication family appears only under its applicable pattern. Use E.24.PUB for a publication occurrence and audience availability; add E.17 when a source-backed face and source return are needed. C.32.MLAO is not a universal optimizer, adequacy claim, selector, decision, assurance argument, publication pattern, or software-system-only pattern.
What goes wrong if C.32.MLAO is missed: local success is called whole-holon architecture success, or an optimization phrase hides the residual that shifted to another declared holon-level ref or declared scope ref.
What C.32.MLAO buys in practice: the practitioner can prepare residual-reducing architecture candidates for later comparison by explaining expected residual reduction, possible new burden, affected scopes and relevant preservation or loss. Include source-return conditions when later use needs omitted distinctions.
Ordinary working move: name where the local improvement moved the cost, name the selected structure and scope that now carry the residual, then prepare candidate changes that reduce that residual while making the new burden explicit.
Adoption test: after using C.32.MLAO, a reader can see the expected residual reduction, possible new burden, affected scopes, relevant preservation or loss, and evolution-window stop condition for each candidate, including what remains unresolved.
Use C.32.MLAO only after residual triage. Do not use it to recover the residual itself, justify a mathematical lens, compare or select candidates, choose locally, declare a selected-set result, publish it to an audience, or decide the project architecture.
Common exits by claim kind:
C.30.ILCwhen the residual is not recoverable yet.C.32.ACSwhen architecture-characteristic criteria rows are missing.C.32.ACEwhen eval programs or eval results are the current claim.C.29when a question remains about choosing, transferring, or relying on a mathematical representation; a sufficient subject-level mathematical result can finish without that separate account.A.19.CPMfor explicit comparison,A.19.SelectorMechanismfor set-returning selection,C.11for local choice, andG.5for selected-set result declaration.C.18andC.19for archive, front, pool treatment, or stepping-stone retention.C.30.ADfor architecture-description work,E.17for a source-backed publication face and source return, andE.24.PUBfor the publication occurrence and audience availability.C.32.PADfor project decision.
The first useful output is an account of candidate changes, the residual each addresses and its possible new burden. An ordinary explanation can suffice. Use MultilevelArchitectureResidualOptimizationFrame@Project when a structured record helps retain or compare these contributions:
For a first pass, name the residual, affected holon, scopes and structures, candidate changes, expected burden and relevant window. Keep unknown structure, criteria or feasibility as questions to resolve. Before a candidate supports a comparison or stronger claim, supply the criteria, ClaimScope and other bindings that use requires. Add front, archive, NQD, OEE, C.29 lens, ideality, scale-amenability, function-bearer, and architecture-influence-correspondence refs only when that support is current for the candidate being framed.
MultilevelArchitectureResidualOptimizationFrame@Project:
projectWorkOccurrenceRef?: U.EntityRef constrained to U.Work
residualOptimizationFrameProjectUseRelationRef?: U.RelationRef defined by the exact synthesis-use or work-use pattern
describedHolonRef:
optimizationQuestion:
objectiveBasisRefs:
claimScopeRef?: U.ClaimScope
residualTriageRef:
declaredHolonLevelRefs?:
declaredScopeRefs:
selectedStructureRefs:
residualBearingLoci:
candidatePaletteRef:
architectureCharacteristicCriteriaSetRef?:
architectureCharacteristicCriteriaRowRefs:
qBundleRefs?:
evolutionWindowRef:
dynamicFrontOrArchiveRef?:
nqdOrOeeSupportRef?:
steppingStoneRefs?:
architectureIdealityPressureRef?:
scaleAmenabilityPolicyRef?:
functionBearerFeasibilityRef?:
architectureInfluenceCorrespondenceRef?: C.32.CONWAY frame or exact pair-row ref
residualReducingCandidates:
- candidateRef:
selectedStructureChanged:
affectedLevelOrScope:
affectedArchitectureCharacteristicRefs:
affectedCriteriaRowRefs?:
architectureCharacteristicEvalResultRefs?:
residualReduced:
newBurden:
preservedStructure:
lostOrHiddenStructure:
sourceReturnCondition?:
comparisonInputRefs?:
receivingOperationPatternRef?:
c29LensOutputRef?:
metaHolonTransitionRef?:
stopCondition:
Here @Project is a compatibility and retrieval cue only. It establishes no project entity, composite-work identity, context, authority, viewpoint, or parthood. When the frame is genuinely used in one actual project, projectWorkOccurrenceRef identifies the exact composite U.Work and residualOptimizationFrameProjectUseRelationRef identifies the direct relation by which that work uses the frame. The frame, the residual-reducing synthesis work, the candidate architectures, and the project work remain distinct.
C.32.MLAO:2 - Problem
Many architecture problems are residual problems. A local module boundary improves one team and creates integration exceptions elsewhere. A control relation improves response and creates audit or timing burden. A platform improves reuse and creates evidence decay. A method family speeds authoring and harms transfer.
The tempting shortcut is to call the local improvement optimized. C.32.MLAO blocks that shortcut by asking: where did the residual shift, which selected structure carries it, and which candidate change reduces it enough to be worth its new burden?
C.32.MLAO:3 - Forces
| Force | Tension |
|---|---|
| Local fit | A candidate may help one scope while harming another. |
| Optimization language | Objective, residual, front, and matrix language sounds decisive before the claim is typed. |
| Level and scope recognition | Name the affected scopes clearly. Use declared refs when the receiving claim requires them and C.30.STRAT when ordinary wording leaves the relevant distinction unresolved. |
| Candidate action | When performing repair work, the practitioner must use the residual triage to prepare candidate changes. |
| New burden | A residual-reducing candidate can create another cost or loss; inspect the affected scopes rather than presuming either losslessness or a positive new burden. |
C.32.MLAO:4 - Solution
Develop candidate changes around one recoverable residual; record them in the form needed for their use.
Work in eight steps:
- Start from a
C.30.ILC-compatible residual triage. - Name the affected levels or scopes and the selected structures that carry the residual. Supply declared refs when the receiving use requires them.
- Explain why reducing the residual matters. Reuse adequate architecture-characteristic criteria and Q-Bundle slots; develop missing criteria through
C.32.ACSwhen needed for the proposed use. - Develop or reuse a C.32 candidate palette. Investigation of a candidate may expose structure or criteria not yet understood.
- For each candidate, state the residual it is expected to reduce, the selected structure changed, and the characteristics or criteria affected.
- Assess the new burden, loss, exception, or source-return load that the candidate could create within the declared evolution window. State what is expected and unresolved; if none is identified, say which affected structures, scopes, and criteria were inspected.
- Record the evolution window and any support that only keeps candidate plurality or directionality alive, such as NQD, OEE, an archive or front, stepping-stone retention, ideality, or BLP.
- Stop at the frame, or name the pattern for the next question when a later claim is current: use
A.19.CPMfor explicit comparison,A.19.SelectorMechanismfor set-returning selection,G.5for selected-set result declaration,C.11for local choice,C.32.PADfor an architecture decision,C.30.ADfor architecture-description work, andC.29for a remaining question about choosing, transferring, or relying on a mathematical representation. For publication, useE.24.PUBfor the actual occurrence, form, carrier, audience, bounded use and availability; addE.17when a source-backed face and return to source are needed.
Before relying on a candidate for residual reduction, answer the working questions: which scope and selected structure change, which architecture characteristic or Q-Bundle slot is at stake, what residual is expected to decrease, what structure is preserved or lost, and what new burden is expected or why none is currently identified. A provisional candidate can retain unanswered questions; it cannot supply the conclusions those answers would support.
| Candidate change family | Use when | Repair it provides |
|---|---|---|
splitScope | One scope carries incompatible tempo, functional demand, constraint, or admissibility condition. | Separates the conflict and names coordination cost. |
mergeScope | Mediation creates more burden than separation saves. | Removes unnecessary boundary and names coupling risk. |
addMediator | Direct cross-scope dependency is brittle. | Adds mediation and names mediator failure mode. |
addControlStructure | Rate, feedback, policy, or supervisor conflict persists. | Adds or changes control relations, states timing burden, and names any direct control-responsibility predicate with actual participants; if none is admitted, records the exact missing governor instead of inferring responsibility from the control structure. |
addInterfaceGrammar | Variation grows through unmanaged interface variants. | Names allowed variation, conformance expectation, and exception risk. |
repairFunctionBearerGap | A residual-reducing functional change has no feasible bearer at the affected declared holon-level ref or scope ref. | Proposes or changes a feasible bearer, splits the function, changes placement, resource access, or control relations, or rejects the candidate. Any responsibility change uses its direct domain predicate or exact missing governor. |
addEvidenceScope | Reusable candidate bearer lacks reusable evidence scope. | Makes evidence maintenance part of the candidate. For a current evidence use, apply A.10 for source recovery and bounded reliance, and the applicable subject rule to judge whether the evidence supports the named claim or meets the named requirement. |
addWorkMethodScope | Repeated work remains bespoke because method structure is missing. | Proposes reusable method structure for the repeated work and names review or training burden. |
repairArchitectureInfluenceCorrespondence | The residual is carried by mismatch between one exact typed influence-side architecture source and transformed-side architecture content for the changed referent. | Open C.32.CONWAY; keep the changed referent and any actual A.3.4 U.Transformation separate, then prepare candidate alternatives that change the influence-source side, change the transformed side, change both, or keep a bounded mismatch. |
acceptBoundedException | Eliminating the residual costs too much now. | Records the exception and reopen trigger, including source return when needed to recover a consequential distinction. |
Comparison-input boundary. C.32.MLAO prepares comparison inputs; it does not run the comparison or choose a candidate. Its comparison inputs state expected residual reduction, possible new burden, selected structures and relevant preservation or loss. Include source-return conditions when a later use needs omitted distinctions, and C.29 lens-output references when used.
Those references are diagnostic inputs only.
Admitted profiles and a ComparatorSpec belong to the receiving explicit-comparison pattern.
If the current claim is explicit comparison, use A.19.CPM with admitted profiles and a declared ComparatorSpec. If the claim is local choice over an existing option set, use C.11. If the claim is set-returning selection, use A.19.SelectorMechanism. If the claim is selected-set result declaration, use G.5. For publication, use E.24.PUB for the occurrence and audience availability, with E.17 when a source-backed face and source return are needed.
Lens-output discipline. Graphs, fronts, residual vectors, DSMs, RG-like descriptions, and frustration language are C.29 lens outputs, structural descriptions, or diagnostic signals after their architecture use is typed. The real failure is proxy preference: a candidate is preferred because the output looks better while selected structures, lost structure, architecture characteristics, and pattern for the next question remain unnamed. The repair is to interpret the output over selected structures and state what residual or loss it exposes; any comparison, selection, or choice claim then belongs to its pattern for the next question.
Method, culture, and episteme discipline. For a Method-family, culture, practice, or episteme case, first name the described holon, optimization question and use, selected structures, and the pattern that defines or constrains each load-bearing claim. If a publication family or publication face is in view, decide whether it is the described holon, a selected structure, an architecture description, or an MVPK face before using it. C.32.MLAO defines only the residual-reducing architecture candidate frame; use the applicable patterns for Method, Work, publication, evidence, ethical, and decision claims.
Dynamic candidate discipline. A preferred or retained candidate is bounded by an evolution window, source conditions, and the pattern for the next question that admitted the preference or retention. NQD, OEE, C.18, and C.19 can keep a front, archive, pool, or stepping stone visible; they do not select the architecture and they do not turn a front member into a durable optimum.
Ideality and BLP discipline. TRIZ ideality can suggest residual-reducing candidate changes: remove a support bearer, transfer a useful function onto an existing resource, or generalize a bearer so fewer selected structures carry more useful functions. BLP can prefer a more general scale-amenable bearer only inside its declared scale window and audit boundary. Both lines guide candidate generation. When removing a bearer, inspect transferred functions and possible coupling, evidence, control and source-return burdens; retain the applicable scale boundary and receiving comparison or choice rules.
Functional-bearer feasibility discipline. Before a candidate can support a feasibility or residual-reduction claim, name a bearer that could perform the function under the applicable module, placement, resource, control, information and evidence constraints. This is a design-time feasibility claim, not proof that the System, assignment, or Work already exists. An assignment supplies neither capability, functioning, function bearing, nor performance. If feasibility is unknown, investigate the consequential uncertainty. If no feasible bearer can be proposed, add or change a candidate bearer, split the function, change placement, resource access, or control relations, reduce the demand, or mark the candidate unfit for that use. It may remain useful as an exploratory alternative or counterexample. Responsibility still needs an admitted direct predicate or the exact missing governor.
Architecture-influence and transformed-side discipline. When a residual is carried by one independently typed architecture-side source constraining architecture content for a changed referent, use C.32.CONWAY. For each actual side, keep the exact C.30 described holon, obtaining ArchitectureRelation, and selected U.Structure together; keep candidate, required, desired, or expected content in an exact C.30 ArchitectureClaim. Keep the changed referent and any actual A.3.4 U.Transformation separate. Then prepare residual-reducing candidates that change the influence-source side, the transformed side, both sides, or a bounded mismatch as comparison inputs or downstream candidate alternatives. Influence, transformation, flow, Work, and module-interface claims belong to their exact relation pattern, A.3.4, E.18, A.15, or A.6.M when current. Use C.29 when a separate question remains about choosing, transferring, or relying on a mathematical representation of structural similarity.
Level, stratification-term, and whole-reidentification discipline. When stratification wording leaves the relevant object or relation unclear, use E.10.ARCH and C.30.STRAT. When BOSC, MHT, MET, MFT, emergence, boundary-crossing or promotion wording leaves the claim kind unclear, use E.10 and B.2.P. Use the recovered subject pattern directly when the meaning is already clear. Use B.2 only when a whole-reidentification question remains after the existing-whole explanation check; otherwise use the subject pattern for architecture, boundary, capability, function, measurement, publication, work, or lens claims.
Stop condition. Stop when the needed candidate account explains the residual, affected scopes and structures, proposed changes and possible new burdens. Preserve the distinctions, loss and source-return conditions needed by its receiving use. An exploratory account may finish with unresolved questions; comparison or decision inputs must meet their receiving rules.
Reconsideration condition. A changed residual, structure, criterion or evolution window reopens the affected candidate claims. Preserve any still-supported account and useful provisional questions. A missing binding blocks the use that needs it; it does not erase independent information. Retain a candidate for a new window only when its premises still hold, and revise or retire the affected claim when they do not. Use C.30.ILC when the residual itself is missing, C.32.ACS when criteria rows are missing, C.32.ACE when eval results are needed but not current, C.29 for a remaining mathematical-representation choice, transfer, or reliance question, and A.19.CPM, A.19.SelectorMechanism, C.11, G.5, or C.32.PAD when the downstream claim is current.
C.32.MLAO:5 - Worked Residual Cases
| Grounded working case | Residual-bearing locus | Residual-reducing candidates | Stop condition |
|---|---|---|---|
| Regulated product family where shared platform reduces engineering work but grows certification exceptions | Product-variant scope against family evidence scope; module-interface and evidence-scope structures | Add reusable evidence scope; narrow interface grammar; keep bounded exception for one variant | Stop before assurance, G.5 selected-set result declaration, publication availability, or decision unless those claims are current. |
| Clinical triage arrangement where local intake speed increases downstream escalation misses | Intake scope against hospital escalation scope; proposed triage Systems, procedure or Method structure, escalation relation, and optional kind or assignment requirements kept distinct | Propose a mediator System or relation, split triage scope by patient class, and state any assignment requirement as plan or decision content. Retarget responsibility only through an admitted direct predicate or record the exact missing governor. Only after performance occurs, recover every precise performer’s A.13 core and independently admit the Work under A.15.1; add F.6 only when precise assignment-bound attribution is current, and add a Work-to-change relation only when that predicate independently obtains. | Stop before ethical mediation or staffing decision unless D.3, D.4, or the receiving staffing-decision pattern is current. |
| AI-agent review setup where local agent quality improves while policy violations increase | Agent task scope against policy-control scope; control and evidence-refresh structures | Add supervisor relation; narrow model-interface admissibility; change evidence refresh cadence | Stop before safety, gate, release, or causal claims unless their subject patterns are current. |
| ML inference workflow where the searched functional graph improves quality and exceeds edge-device resource limits | Functional graph against deployment and resource scopes; module-interface, placement, and resource structures | Split the function, change deployment placement, add a resource bearer, or reject the candidate for this evolution window | Stop before release, benchmark, G.5 result declaration, or publication claims unless the definition and test for each current claim are applied. |
| Method family where template reuse accelerates authoring and creates review residue | Authoring scope against review scope; method-structure and authored-section structures | Split method variants; add review-evidence scope; accept bounded local method residue | Stop before method governance, MVPK publication-face governance, or project decision unless the pattern for the next question is current. |
| Built-asset maintenance program where digital-twin abstraction hides lower-scope source loss | Asset-family scope against maintenance activity scope; reference-designation, information, and maintenance-Method or plan structures | Add source-return scope; split the information view; retarget maintenance responsibility only through its admitted direct predicate or record the exact missing governor. Introduce actual maintenance Work only through its basis: A.13 first, independent A.15.1 Work admission second, and F.6 afterward only for precise assignment-bound attribution. | Stop before built-asset architecture-description, publication-face, or A.10 evidence-use claims unless their subject patterns are current. |
C.32.MLAO:6 - Residual And Trade-Off Failure Modes
| Failure mode | C.32.MLAO repair action |
|---|---|
| Local improvement shifts the residual elsewhere | Record the scope and selected structure that improved, the scope and selected structure that worsened, and the new burden created. |
| Universal optimizer is assumed | Treat optimization as bounded residual reduction over declared holon-level refs or declared scope refs, with comparison inputs, pattern for the next question, and stop condition. |
| Proxy result substitutes for comparison or choice claim | When a score, vector, graph partition, front, DSM, or C.29 lens output is used to prefer a candidate, name the selected structures, relevant preserved or lost structure, architecture characteristic, and pattern for the next question. |
| Level or scale wording leaves the relevant distinction unclear | Use E.10.ARCH, C.30.STRAT or C.16.P for the unresolved meaning, and E.10/B.2.P for an unresolved whole-reidentification claim. Keep adequate ordinary wording and supply exact refs only where the receiving claim needs them. |
| Software-source overfit | Treat software examples as domain lineage; admit other holons only after selected structures and affected scopes are recoverable. |
| Lossless repair is assumed | Inspect possible new burdens in the affected scopes. Name any expected burden or loss; if none is identified, state the inspected structures, criteria, and evolution window without claiming universal losslessness. |
| Front member is treated as durable optimum | A front member has archive or front membership under an evolution window; membership does not establish a durable architecture optimum. |
| Stepping stone is erased too early | Keep retained stepping stones visible through C.18 or C.19 when they preserve future residual-reduction reach. |
| Architecture-influence residual is hidden | A residual between one typed influence-side architecture source and transformed-side architecture content must open C.32.CONWAY; keep the changed referent and any actual transformation separate, and use C.32.CONWAY:4.1.1 to construct the applicable source-side, transformed-side, joint or bounded-mismatch candidates, preserving the receiving requirement. |
| Ideality is used as optimum | Treat ideality as direction for candidate generation, not as an adequacy claim that a bearer may be removed. |
| Universal bearer admitted by name | Establish the declared criteria, safety and admissibility boundaries required for the intended use, with an eval result when the claim depends on it. A scale-advantage claim or applicable policy selects C.19.1 and its scale window. |
| Functional graph has no feasible bearer | Do not claim feasible residual reduction. Distinguish an unresolved feasibility question from demonstrated infeasibility; revise the candidate or retain it for an appropriate exploratory use. |
C.32.MLAO:7 - Conformance Checklist
| ID | Requirement | Purpose |
|---|---|---|
CC-C32.MLAO-1 | The use starts from a recoverable residual triage. | Prevents premature optimization. |
CC-C32.MLAO-2 | Affected scopes and selected structures are named, with declared refs where the receiving claim requires them. | Keeps multilevel wording reviewable. |
CC-C32.MLAO-3 | Each candidate states expected residual reduction, affected architecture characteristics and possible new burden, preserving unresolved questions. | Prevents one-sided optimization. |
CC-C32.MLAO-4 | Comparison inputs, comparison results, selection results, and choice results name their pattern for the next question. | Keeps C.32.MLAO from performing comparison, selection, or choice locally. |
CC-C32.MLAO-5 | Use C.29 when mathematical-representation choice, transfer, or reliance remains unresolved; retain a sufficient subject-level result. | Keeps mathematical adequacy outside this pattern. |
CC-C32.MLAO-6 | Source-return conditions are present when compression hides distinctions needed for a later use. | Keeps later source-use or decision-use claims tied to recoverable sources. |
CC-C32.MLAO-7 | Evolution window, dynamic front or archive relation, and any NQD or OEE support are typed as retention or generation support only. | Blocks static-optimum and selector overread. |
CC-C32.MLAO-8 | Influence-source and transformed-side architecture content stay distinct through exact C.30 holon, obtaining-ArchitectureRelation, selected-structure, or modal-ArchitectureClaim refs; the changed referent and any actual A.3.4 transformation stay separate; C.32.CONWAY is used when correspondence candidates are being prepared. | Preserves kind distinction among architecture content, influence, Work, actual transformation, and structural similarity. |
C.32.MLAO:9 - Consequences
| Positive consequence | Cost or trade-off |
|---|---|
| Residual-reducing architecture candidates are made explicit. | The practitioner must recover the affected scopes and structures, expected residual reduction, possible new burdens and relevant preservation or loss. Comparison or choice adds its own requirements; unresolved level or whole-reidentification wording uses C.30.STRAT or B.2.P. |
| Optimization language is usable without carrying architecture adequacy. | No scalar selector or architecture decision is available by wording alone. |
| Holonic breadth is preserved. | Non-software cases must still recover their selected structures and patterns for the next questions. |
| Residual triage and candidate framing stay distinct. | The team may need both C.30.ILC and C.32.MLAO. |
| Compressed representations can guide action. | Source-return triggers must be visible when a later use needs omitted distinctions. |
C.32.MLAO:10 - Rationale
C.30.ILC names cross-scope residuals and first architecture repair directions. C.32 creates candidate palettes. C.32.MLAO is needed when the constructive candidate work is specifically about reducing a residual across declared holon-level refs or declared scope refs.
The nontrivial work is to prepare candidate architecture changes for later comparison by naming residual reduced and burden created, not by using an optimizer phrase, scalar output, or locally improved structure as the candidate frame.
Multilevel learning, frustration, RG-like, DSM and Pareto material can suggest candidate changes. Recover the source contribution and its applicable meaning before use; a source cue does not itself establish an architecture claim. A comparison or stronger conclusion needs the relevant structures, scopes, criteria and loss conditions under its own rules.
C.32.MLAO:11 - SoTA-Echoing
These rows document transfers from source practice into C.32.MLAO. Each row names the part of the residual-reducing frame that uses the source’s contribution; none imports its source-domain ontology into FPF.
| Source to inspect | Why this source is load-bearing here | Transfer into C.32.MLAO | Blocked overread |
|---|---|---|---|
Current FPF architecture residual, criteria, eval, comparison, and level-recovery line: E.10, E.10.ARCH, C.30.STRAT, B.2.P, B.2, C.30.ILC, C.32.ACS, C.32.ACE, A.19.CPM, A.19.SelectorMechanism, C.11, G.5, C.29, C.31, C.31.ASAP, and architecture source section 15.3 | Current local law for interlevel and cross-scope architecture residuals. C.32.MLAO starts only after residual triage; use the applicable patterns to recover criteria, eval, stratification terms, whole reidentification, comparison, selection, choice, and selected-set result declaration. | Require C.30.STRAT recovery when stratification wording is ambiguous and B.2.P recovery when BOSC, MHT, MET, MFT, or emergence wording is ambiguous. Before candidates support comparison, selection, choice or selected-set result declaration, supply the scope, structure, criteria, loss and evidence bindings required by that use. | Resolve unclear predicates before relying on them. An ordinary same-scope structure conflict uses its subject pattern; it does not by itself establish a cross-scope residual. |
Vanchurin, Wolf, Katsnelson, and Koonin, Towards a Theory of Evolution as Multilevel Learning (https://arxiv.org/abs/2110.14602); Wolf, Katsnelson, and Koonin, Physical foundations of biological complexity (https://arxiv.org/abs/1803.09975); Akhtyrchenko, Katsnelson, and Ustyuzhanin, Directing Open-Ended Evolution ... via Multi-Scale Path Divergence, submitted 2026-06-12 (https://arxiv.org/abs/2606.17091) | Mathematical source line for multilevel residual and scale-dependent frustration. The MSPD contribution makes the selected scale-dependent frustration computable over its substrate. | Use frustration and multiscale divergence as optional mathematical results for residual-bearing loci across declared holon-level refs or declared scope refs. Use C.29 for an unresolved representation-choice, transfer, or reliance question. | Source-domain ontology stays outside architecture; a scalar output must be interpreted as pressure, loss, or residual over selected structures before a receiving comparison or choice pattern can use it. |
Evolutionary architecture: Ford, Parsons, Kua, and Sadalage, Building Evolutionary Architectures, 2nd ed. (https://www.oreilly.com/library/view/building-evolutionary-architectures/9781492097532/) | Current practitioner architecture line for guided incremental change over declared architecture characteristics, affected selected structures, and feedback from source-side fitness functions. | Assess the new burden a residual-reducing candidate could introduce, preserving a supported finding of no identified burden and the stop or reopen condition; recover what each source-side fitness function does and use C.32.ACE when the current question is an eval program over architecture criteria. | A local eval improvement needs an architecture interpretation before a comparison, selection, or choice pattern for the next question can use it. |
TRIZ ideality and laws of technical-system evolution, read with C.19.1 BLP | Older heuristic line: systems tend toward more useful function with less cost, harm, and support apparatus; BLP supplies FPF scale-amenability discipline for general bearers. | Use ideality and scale amenability to generate residual-reducing candidates, not to select them. | Removing a part, consolidating functions, or choosing a universal bearer is not residual reduction without grounds for the affected structures, characteristics and possible new burden; a scale-advantage claim or applicable policy also requires the selected scale boundary. |
Multi-objective and hardware-aware NAS: Elsken, Metzen, and Hutter 2019 (https://www.jmlr.org/papers/v20/18-598.html); Sukthanker et al., v3 revised 2025-02-04 (https://arxiv.org/abs/2402.18213); Sinha et al. 2024 (https://arxiv.org/abs/2404.12403) | Current architecture-search line where functional graph candidates are judged against hardware, latency, cost, and transfer constraints; useful as a general co-design lesson beyond ML. | Before claiming feasible residual reduction from a changed functional structure, name bearers that could perform it at the affected scopes. | A functional graph, resource score or Pareto member does not establish feasible residual reduction without a bearer that could carry the function under the stated constraints. |
Architecture trade-off practice and Software Architecture: The Hard Parts (https://www.oreilly.com/library/view/software-architecture-the/9781492086888/) | Practitioner treatment of architecture trade-offs and context-dependent decisions. | Explain each candidate’s expected residual reduction and possible new burden within the stated conditions. | A trade-off scenario, ranking, or preferred decomposition is not a decision inside C.32.MLAO. |
DORA loosely coupled teams, last updated 2025-10-20 (https://dora.dev/capabilities/loosely-coupled-teams/), DORA trunk-based development (https://dora.dev/capabilities/trunk-based-development/), and Team Topologies key concepts (https://teamtopologies.com/key-concepts) | Current socio-technical practice for independent change, testing, deployment, small batches, dependency reduction, and fast flow. It is load-bearing because many residuals concern organization relations, proposed Systems or assignments, ordinary work or procedure organization, actual Work, direct responsibility relations, and coordination structures, not only software modules. | Admit organization, local-kind, separate System-classification, assignment, responsibility, coordination, Method, plan, and actual-Work residuals only when their selected structures, direct predicates, affected scopes, and modal or actual status are recoverable. | Recover the objects and relations an organization-design observation concerns. Apply System or assignment admission when those claims are current. An assignment alone establishes no responsibility, capability, function bearing or Work; stronger module, evidence, assurance and decision claims need their own grounds. |
Design-space and architecture-spread research: Shaw and Petre 2024 (https://arxiv.org/abs/2407.18502); Cortellessa et al. 2024 (https://arxiv.org/abs/2402.19171) | Current research showing that useful alternatives need a design-space or architecture-space view, not only objective-space scores. | Preserve plural residual-reducing candidates when residuals shift differently across structures or scopes. | Candidate preference still depends on declared architecture characteristics, losses, and a pattern for the next question. |
| C.18 archive and front stewardship plus C.19 explore-exploit governance | Current FPF pattern line for open-ended search, NQD, OEE, archive, front, pool treatment, and stepping-stone retention. | Treat NQD and OEE as generation and retention support for residual-reducing candidates, not as architecture selection. | Archive membership, front membership, retained stepping stone, or pool treatment is not architecture adequacy or decision. |
Conway’s law, mirroring, DORA loosely coupled teams, Team Topologies, and current C.32.CONWAY | Current practice line for residuals where one typed Work, communication, tool, method, deployment, evidence, selected-structure, or architecture-side source no longer fits the transformed-side architecture content needed for the changed referent. | Treat architecture-influence correspondence mismatch as a residual-reducing synthesis problem, not as actor identity, Work attribution, transformation participation, or transformed-side architecture settlement. | A claim that a correspondence residual has been repaired needs its shifted burden, affected structures, characteristic pressure, applicable influence basis and exception cost. Provisional candidate reasoning may retain unresolved questions. |
Source-use boundary. Each row states a bounded contribution. Recheck a dependent claim when a source or application premise changes materially. An unsupported transfer may remain historical background; retain independently supported candidate reasoning and identify the question that needs further work.
C.32.MLAO:12 - Relations
- Builds on:
C.30.ILCfor residual triage,C.32for palettes,C.32.ACSfor architecture-characteristic criteria rows,C.32.ACEfor eval programs and eval results,C.29for a remaining question about choosing, transferring, or relying on a mathematical representation,A.19.CPMfor explicit comparison,A.19.SelectorMechanismfor set-returning selection,C.11for local choice over an existing option set,G.5for selected-set result declaration,C.19.1for scale-amenability preference claims, andC.31orC.31.ASAPfor characteristic or scale-preference claims. - Uses:
E.10.ARCHandC.30.STRATwhen stratification terms hide the recovered neighborhood;E.10andB.2.Pwhen BOSC, emergence-family, MHT, MET, MFT, boundary-crossing, or promotion-like wording hides the claim kind;B.2when the recovered facts leave a question about retaining or reidentifying the relevant whole;C.32.CONWAYwhen residual reduction requires co-synthesis of exact influence-source and transformed-side architecture content;A.6.M,C.30.LCA,C.30.TFS-REL, and method or work patterns when their structures are the affected selected structures. - Patterns for the next questions:
A.19.CPMfor explicit comparison,A.19.SelectorMechanismfor set-returning selection,G.5for selected-set result declaration,C.11for fixed local choice,C.30.ADfor architecture-description work,E.17for a source-backed publication face and source return,E.24.PUBfor the publication occurrence and audience availability, andC.32.PADfor project architecture decisions. - P2S docking:
C.32.P2Suses MLAO when cross-scope, interlevel, interlayer, or meta-holon residual pressure must become candidate-synthesis and repair content inside the wider architecturing flow. - Boundary: Use C.32.MLAO only for residual-reducing architecture candidate frames after residual triage. Use the applicable patterns for mathematical-lens adequacy, evidence, assurance, gate passage, ethical mediation, causal claim adequacy, work authorization, and final selection.