G.9:4.3a — Worked parity slice
Preface node
heading:g-9-4-3a-worked-parity-slice:105652
What this page is
This is generated FPF reference text from the specification preface or supporting sections. It helps interpret FPF; it is not FPF Reference product documentation.
Methodology
Use it to understand how the specification wants to be read, then return to a route, pattern, or work packet for active work. Cite generated IDs only when the wording changes the task decision.
Content
Ordinary case: compare two pump-triage method rows. The team from the G.5 example wants a reproducible comparison of the two exact selector-row editions, not a claim that one Method is universally better. Both rows use the same scheme, units, and ReferencePlane, so no normalization or crossing branch is needed.
The plan explicitly says that BaselineSet and targetRefs[] contain the same two row refs. EvaluationWindow bounds the observations and results included in the comparison. FreshnessWindows asks a different question at run or reuse time: whether each required input and evidence path is still recent enough to rely on. A report from this run carries parityPlanRef=<PumpTriageParity, E1>, BaselineBindingRef=PumpTriageBaselineBinding-E1, the same evidence path, and the unordered Shortlist; it does not invent a scalar winner. A cold reader can therefore recover the subject, comparison boundary, two window meanings, measurement and comparator editions, and evidence without opening a causal, crossing, assurance, telemetry, or publication branch.
Conditional specialization case. Loop-engineering parity may add further pins after the ordinary comparison boundary above is complete. An evaluation program, benchmark script, or dashboard is part of the evaluation or comparison procedure; it is not the Characteristic being improved.
- Two agentic search setups both claim bounded specialization on the same declared task family.
- Their
ParityPlanalso pins the same threshold target, adaptation budget, prior-exposure declaration, and corridor-entry baseline. One setup reaches threshold sooner but shows low retention and no transfer. The other reaches threshold later, but carries reusable transfer and lower downside field. - Their CSLC-admissible
ParityReportstates what was held constant, which signals remained telemetry, and why the outcome stays a selected set or partial order rather than collapsing into a scalar winner. These specialization values extend the complete comparison boundary; they do not replace its subject, scope, windows, baseline binding, comparator editions, or evidence.
Last Updated: 2026-09-03 — upstream FPF commit b999972c (github.com/ailev/FPF)