Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-21 09:09:35 UTC · snapshot created 2026-11-21 09:15:17 UTC · last check 2026-11-21 10:20:05 UTC

C.35:11 - SoTA-Echoing

Source or practice lineUse of the contributionContribution to the assessmentBoundary of use
MBSE query and view generationIdentify the source, selection rule and coverage of the query.A complete, validated query can settle a claim about the model.Claims about the installed architecture depend on evidence connecting that model to the installation. Reopen when the model edition, represented object, query or coverage changes.
Google OR-Tools, CP-SAT solver statusesRead a feasible witness, a proof of infeasibility, an optimum or an inconclusive stop according to the stated result.Helps decide whether a search has already fulfilled the commission or whether coverage or a bound is still needed.Solver conclusions apply to the encoded constraints, objective and stopping conditions.
Graph grammars and model transformationsAdapt rule-governed transformation as the transformation branch.Identifies source and result objects, transformation trace, preserved structure, lost structure, and C.34 preservation exit.Grammar or transformation output does not prove adequacy, feasibility, or realization. Reopen when transformation rules, source object, result object, trace, or constraints change.
DSM, MDM, and modularization practice including Jiang and Luo, arXiv:2604.28018Adapt modularization and LLM-assisted DSM work as discovery.Identifies extraction basis, observed dependencies, inferred clusters, unknown functional-bearer semantics, coverage, uncertainty, validation, and C.31 plus C.32 exits.Cluster, partition, or MDM slice is not candidate architecture adequacy. Reopen when relation matrix, covered region, modularity objective, functional prior, validation, or solution pool changes.
Multi-objective NAS and Sukthanker et al., arXiv:2402.18213Adapt multi-objective search as a generative-proposal source.Identifies constraints, proposed neural organization, known omissions, validation needs, search criteria, bearer boundary, eval return, and C.32 admission condition.A Pareto point or neural graph is not holonic architecture adequacy. Preservation is claimed only against a declared baseline. Reopen when search space, constraints, criteria, hardware target, proposal content, or eval trace changes.
DSE, QD, OEE, NQD, and evolutionary architecture practice inherited through C.32Adapt retained alternatives and stepping-stone pressure as candidate-input practice.Connects candidate input and its use conditions to the archive, front and pool policy for that use and C.32 candidate-palette rules.These practices do not make C.35 a second candidate-set admission rule. C.18, C.19, and G.5 define archive, front, and pool policy; C.32 defines candidate-palette admission.
AI-assisted architecture design and AI-assisted ADDAdapt generated decompositions, relation graphs, and decision proposals through the generative-proposal branch.Identifies constraints, proposed organization or claim content, known omissions, source-label recovery, validation needs, and candidate-admission boundary.An LLM proposal, ADD suggestion, benchmark trace, or agent consensus is not decision authority, evidence sufficiency, realization, or architecture adequacy by itself.
Sapunov, Theory of Code Space, and code-agent architecture-map practiceAdapt partial-observability mapping through the discovery branch.Identifies observation or extraction basis, separate observed, inferred, and unknown content, confidence, covered and unexplored regions, active-passive comparison, and validation.A code-agent map, JSON probe, benchmark score, dependency F1, invariant F1, or active-passive gap is not architecture adequacy, internal-state proof, safe-change authority, evidence sufficiency, gate passage, or release authority.
GonzoML neural-network architecture intakeAdapt neural architecture operation language as source-label recovery for discovery or generative proposals.Identifies recovery for dataflow change, routing, gating, memory placement, cache placement, block substitution, pruning, distillation, NAS, ablation, and compute, memory, and latency trade-offs without choosing a branch by label.Use clear source-local meanings directly. Obtain the branch-specific basis, bearer or characteristic needed by the architecture claim; ablation or benchmark gains alone do not establish it.