ifc-0143
10.5.1 The target card
10.5.1 The target card
Before an experiment, publish the following target card: it is the interface between theory and experiment, and changing a field changes the algorithm.
Field Question Required record Operational target What is deployed or retained? Type, interface, and evaluation semantics of \(Y_X\). Declaration What structural promises type it? Versioned \(\mathbb {S}_X\), observers, and intervention contract. Creative mandate In what sense could a result be creative? Boden mode, reference space \(\mathcal R_X\), novelty observer \(\nu _X\), and surprise measure \(\sigma _X\). Repair theory Which two typed calculi interact? Presentations \(\mathbb {A}_X,\mathbb {B}_X\), their tensor-product interchange, and realizations \(H_X,V_X\). Mixed witness How are the two orders compared? \(\Theta _X\), observability gate, equivalence margin, and localization rule. Finite realization Can the candidate survive composition? Integration observer \(\gamma _X\), horizon, uncertainty, and failure semantics. Proposal language What may change? Typed candidates in \(\mathcal L_X\), including the no-change proposal. Controls What must be ruled out before extension? Registered in-language, measurement, hidden-state, no-change, and intervention-only controls in \(\mathsf{Ctl}_X\). Package comparison How does a declaration or its interpretation change? \(\Upsilon _X:\mathfrak R_X\to \mathfrak R_X^+\), its presentation component \(J_X\) when applicable, model transport, and preserved structure. Admission What evidence is independent? Certificate family \(\mathsf{Adm}_X\), splits, thresholds, and abstention rule. Persistence What survives a revision? Memory, transport, regression tests, and provenance in \(\mathsf{Mem}_X\).
The target card is a common interface, not a claim that every realization has already reached its final creative target. The four principal implementations developed next occupy different points in the evidential sequence:
System Supplied or registered Estimated or learned Constructed and admitted Present boundary CLIC Repair templates, intervention library, unsupported alternatives Intervention operators, uncertainty, residual posteriors, active probe choice Exact studies instantiate and admit typed repairs within the registered metalanguage No autonomous variable or mechanism type outside that metalanguage OPTIC Hypotheses, probes, renderer, skill vocabulary, typed subskills Routing and composition of supplied subskills No new interface or grammar has yet been independently admitted Mechanism evidence for factorization, not transformational skill invention RELIC Primitive actions, stage contracts, admissible-command channel Predicates, filters, proposal rankings, and policy behavior A temporal composition and a missing task-stage operator, admitted up to behavioral equivalence Construction remains inside registered primitives and contracts AGENTIC Packet schemas, probe and action vocabularies, workflow interfaces Finite-sample causal, skill, and decision packets; active evidence allocation A response-conditioned policy absent from the baseline declaration Synthetic proof of composition; no invented sensor, action, or packet language
This ledger prevents evidence from being promoted as it moves downstream. For example, an admitted RELIC policy does not retroactively admit the causal explanation that motivated its probe, and wiring CLIC, OPTIC, and RELIC into AGENTIC does not upgrade registered component vocabularies into invented ones.