Coverage / Reachability¶
Core Idea¶
Coverage / reachability is the structural pattern of asserting that every required target in some target set is reachable from — or producible by — the system's inputs, pathways, or mechanisms. The claim is one of completeness in the surjective direction: the system covers the target set, and nothing required is left unreachable. The failure mode is a gap — a target that the system was supposed to be able to reach but cannot. The diagnostic is enumeration of the required targets and a check that at least one pathway exists to each. The pattern is the completeness claim about a relation — a mapping, a routing, an accessibility, a productive capacity — and it is deliberately silent about the uniqueness or efficiency of the pathway and about whether multiple pathways exist.
Formally, the pattern is the surjectivity of a relation R from a source set S to a required-target set T: for every t in T, there exists some s in S with s R t.[1] The negation — coverage failure — is the existence of a t reached by no s. Two structural properties follow. Coverage is monotone: adding inputs or pathways can only increase it; removing them can only decrease it. And coverage is relative to T: it can be trivially achieved by shrinking the target set and trivially broken by expanding it, which makes the target set itself a load-bearing design artefact rather than a fixed background. The standing structural risk is that a system's coverage claim rests on an implicit target set that drifts in either direction without the claim being revalidated — new branches, new beneficiary classes, or new failure modes silently enlarge T while the old coverage proof is still being cited. The pattern is the surjective sibling of injectivity (no collisions, distinct inputs to distinct outputs); together they generate the standard bijection properties, but each carries an independent intervention catalogue and can hold or fail without the other.[1]
How would you explain it like I'm…
A Crayon for Every Colour
Reach Everything, No Gaps
Every Target Reachable
Structural Signature¶
the source-and-pathway set — the required-target set — the reaching relation between them — the surjective completeness obligation (every target reached by at least one source) — the gap as an unreached target — the monotonicity in pathways and relativity to the target set
A configuration exhibits coverage / reachability when each of the following holds:
- A required-target set. A stipulated collection of elements that the system is obligated to be able to reach or produce: branches, destinations, beneficiary classes, competencies, failure modes. This set is a load-bearing design artefact, not a fixed background.
- A source-and-pathway set. A collection of inputs, channels, or mechanisms from which targets can be reached: tests, routes, access channels, courses, controls.
- A reaching relation. A relation that holds between a source and a target when the source reaches, routes to, exercises, teaches, or mitigates that target.
- The surjective obligation. Completeness in the surjective direction: for every target there exists at least one source standing in the relation to it. The claim is silent about uniqueness, efficiency, or multiplicity of pathways.
- The gap. The negation of coverage: a target reached by no source. Detecting gaps is the diagnostic, and enumeration of targets plus a per-target existence check is the procedure.
- Monotonicity and relativity. Coverage can only increase as pathways are added and decrease as they are removed (monotone in the source set), and it is defined only relative to the target set (trivially achieved by shrinking T, trivially broken by enlarging it).
The components compose so that the dominant silent failure is target-set drift: pathway loss is visible, but a quietly growing T leaves an old, still-cited coverage proof that no longer covers, which is why an honest claim must re-anchor on its T.
What It Is Not¶
- Not
traceability. Traceability links each artefact back to its source or requirement — a per-element provenance relation. Coverage asserts the surjective completeness of a relation: every target reached by some source. One traces individual lineages; the other proves no target is orphaned. - Not
redundancy. Coverage demands at least one pathway to each target and is silent about a second.redundancydemands more than one. A coverage-complete system can be one outage from a gap. - Not
completeness. Generalcompletenessis a catch-all "nothing missing"; coverage is the specific surjective form — completeness of a relation in the reaching direction, relative to a stipulated target set, monotone in pathways. - Not injectivity or
representation. Coverage says every target is hit; it says nothing about collisions (distinct sources to distinct targets). A fully covering relation can be many-to-one, so coverage never implies a bijection or a faithful one-to-onerepresentation. - Not
reachabilityas efficiency. The relation only requires that a pathway exists, not that it is short, cheap, or fast. Existence of a route is orthogonal to its adequacy. - Common misclassification. Reading a coverage percentage as a robustness or quality guarantee. "100% covered" means every required target has one pathway — not that the pathways are adequate, redundant, or distinct. Catch it by asking for the target set and whether any target rests on a single, possibly inadequate, path.
Broad Use¶
- Software testing: branch, path, and statement coverage — every code branch is exercised by at least one test; gaps are branches no test reaches.[2]
- Network reachability: every required destination is reachable from every required origin in the routing fabric; unreachability is the design failure to detect and fix.[3]
- Service design and public policy: every entitled beneficiary class has at least one accessible pathway to the benefit; coverage gaps are eligible-but-unreachable populations, a chronic failure of welfare programmes.[4]
- Workflow design: every input case has at least one terminating branch; an input that reaches no terminal state is a coverage failure.
- Access control: every required action is permitted by at least one granted role; a required action no role permits is a coverage gap that breaks the workflow.[5]
- Curriculum design: every required competency is taught by at least one course; an uncovered competency is a graduation gap.[6]
- Formal verification: every reachable state is enumerated, and unreachability of a bad state is the dual proof obligation.[7]
- Failure-mode and effects analysis: every documented failure mode has at least one mitigating control; an uncovered mode is a gap in the safety case.[8]
Clarity¶
The label distinguishes completeness in the surjective direction from neighbouring completeness claims that ordinary language blurs together. Coverage is "every required target is reached by at least one input." It is not "every input is used" (that is utilisation), and it is not "every output is reached by exactly one input" (that is injectivity-plus-coverage, a bijection on the relevant subset). Naming it sharply turns the diagnostic — enumerate the target set, check at least one pathway to each — into a routine that ports across substrates rather than being re-invented in each. The clarifying force also foregrounds the target set as a design object: coverage is meaningful only relative to a stipulated set of required targets, so redefining that set changes what coverage means, and an honest coverage claim must state its T explicitly. This exposes a common rhetorical move — claiming coverage while quietly contracting the target set so the remaining gaps fall outside it — as a redefinition rather than an achievement. Once the surjective skeleton is named, an unfamiliar coverage claim can be audited in minutes: ask for the target set, the source set, the relation, and the gaps.
Manages Complexity¶
The pattern reduces a heterogeneous set of substrate problems — test gaps, routing holes, eligible-but-unreached beneficiaries, unhandled workflow inputs, unteachable competencies, unproven safety cases — to one structural question and one diagnostic procedure with a small, substrate-independent intervention catalogue. Enumerate the target set, making the required-outputs claim explicit and reviewable. Map inputs and pathways to targets, constructing the relation that determines coverage. Identify gaps as targets with no incoming pathway. Close gaps by adding inputs, adding pathways, or contracting the target set — the last being honest if scope is genuinely reduced and dishonest if gaps are quietly redefined away. Detect over-time erosion, revalidating the claim whenever targets are added. The compression is that a test engineer, a network architect, a benefits administrator, and a safety analyst run the same five-step procedure under different names, so expertise in one transfers as procedure in the others. Complexity moves from an unbounded, per-substrate worry ("are we missing anything important?") to a bounded set-relation audit whose monotonicity guarantees that the only ways coverage can change are adding or removing pathways, or moving the target-set boundary.
Abstract Reasoning¶
The prime trains a reasoner to render any completeness worry as a surjective relation and then ask the three questions the formalism exposes: what is the required-target set, what is the source-and-pathway set, and is there at least one s reaching each t? Because coverage is monotone, the reasoner knows that the claim can only be strengthened by adding pathways and weakened by removing them — there are no surprising interactions to track within a fixed T. Because coverage is relative to T, the reasoner knows that the real subtlety lives at the target-set boundary: a coverage claim is only as trustworthy as the stability and honesty of its T, so the diagnostic must include "has the target set drifted since this claim was last validated?" The non-obvious move the prime licenses is to treat target-set drift, not pathway failure, as the dominant silent failure: pathways tend to be visible and pathway loss tends to be noticed, whereas a target set that quietly grows leaves an old, still-cited coverage proof that no longer covers. The prime also keeps coverage cleanly separated from its relatives — it is weaker than redundancy (which demands more than one pathway) and orthogonal to injectivity (which forbids collisions) — so the reasoner does not over-claim distinctness or uniqueness from a mere coverage result.
Knowledge Transfer¶
The diagnostic ports across substrates without modification. A software-test engineer measuring branch coverage is making the same structural move as a public-services designer auditing beneficiary access pathways, a network architect verifying destination reachability, and a curriculum designer auditing competency-to-course mapping; the role mappings transfer directly — required-target set ↔ branches / destinations / beneficiary classes / competencies / failure modes; source-and-pathway set ↔ tests / routes / access channels / courses / controls; relation ↔ exercises / routes-to / reaches / teaches / mitigates; gap ↔ untested branch / unreachable host / unreached beneficiary / untaught competency / unmitigated mode. The intervention vocabulary — enumerate targets, map pathways, identify gaps, close gaps, watch for target-set drift — is invariant, and the only substrate-specific work is deciding what counts as a required target and what counts as a pathway. The transferred and non-obvious lesson is that the most dangerous coverage failures are usually not broken pathways but unexamined growth of the target set: a claim that was true when T was fixed silently becomes false as new branches, new eligible populations, or new failure modes are added, and because coverage is monotone in pathways but relative in targets, the audit must re-anchor on T every time. A reader who has internalised the prime can therefore walk into an unfamiliar domain and audit a coverage claim in minutes — ask for the target set, the input set, and the relation, then look for the elements of T with no incoming pathway — and can immediately recognise the difference between honestly closing a gap (adding a pathway) and cosmetically closing it (shrinking T so the gap is no longer required).
Examples¶
Formal/abstract¶
Branch coverage in a unit-test suite is the prime in its purest form. The required-target set T is the set of conditional branches in the program's control-flow graph — every if/else arm, every loop entry and exit.[2] The source-and-pathway set S is the test cases. The reaching relation holds when executing a test traverses a given branch. The surjective obligation is "every branch is exercised by at least one test"; a gap is a branch no test reaches. The structure makes the two key properties operational. Monotonicity: adding a test can only cover more branches, never fewer, so coverage is a strictly accumulating quantity as the suite grows. Relativity to T: when a developer adds a new if to the code, T silently enlarges, and a coverage report that still cites "92%" from before the change is measuring against a stale target set. The diagnostic — enumerate the branches, check at least one traversing test per branch — is exactly the surjective existence check. The intervention catalogue applies directly: a gap is closed honestly by writing a test that traverses the branch, and cosmetically (the redefinition move the prime warns against) by deleting the branch's coverage requirement or excluding the file from the report. Mapped back: branches are the required targets, tests are the sources, execution is the reaching relation, and the dominant silent failure — target-set drift as new branches are added faster than tests — is precisely the prime's prediction that coverage is monotone in pathways but relative in T.
Applied/industry¶
Two applied instances show the same skeleton in non-software substrates. First, public benefits administration: a state rolls out a childcare subsidy.[4] The required-target set is the enumerated classes of eligible families (by income band, employment status, immigration status, county). The source-and-pathway set is the access channels — the online portal, the phone line, in-person offices, partner non-profits. The reaching relation holds when a beneficiary class has at least one channel through which it can actually enrol. A coverage gap is an eligible-but-unreachable class — say, non-English-speaking rural families for whom the online-only portal and the county office two hours away constitute no real pathway.[4] The audit is the prime's: enumerate eligible classes, map channels to classes, find classes with no incoming pathway, and close them by adding a channel (mobile enrolment, translated phone intake) rather than by quietly narrowing eligibility. Second, failure-mode-and-effects analysis in aerospace: T is the catalogued failure modes of a subsystem, S is the mitigating controls (redundancy, monitors, procedures), and a gap is a documented failure mode with no mitigating control — an unaddressed hole in the safety case.[8] As new failure modes are discovered in testing, T grows, and an old "all modes mitigated" sign-off silently becomes false. Mapped back: beneficiary classes and failure modes are required targets; access channels and mitigating controls are sources; enrolment-feasibility and mitigation are the reaching relations; and in both the chronic danger is not a broken pathway but unexamined growth of T, so the safety case and the benefits rollout must each re-anchor on their target set every time it expands.
Structural Tensions¶
T1 — Existence versus Adequacy of the Pathway (scopal). The surjective obligation is satisfied by at least one pathway to each target — but a pathway can exist while being too narrow, too slow, or too costly to count as real coverage. The tension is between formal reachability and effective reachability. The failure mode is checkbox coverage: a beneficiary class is "covered" by an online-only portal it cannot navigate, or a branch is "covered" by a test that touches it without meaningfully exercising it. The diagnostic: for each existence-of-pathway, ask whether the pathway carries adequate capacity and quality, not merely whether the relation holds — coverage's silence about pathway quality is exactly where the gap hides in plain sight.
T2 — Target-Set Stability versus Drift (temporal). Coverage is monotone in pathways but only relative to a fixed target set T, so the claim's truth is dated. The productive tension is between a coverage proof that was valid when constructed and a T that grows after. The failure mode the prime names: citing a stale "92%" after new branches, new eligible classes, or new failure modes silently enlarged T. The diagnostic is a re-anchoring audit — every coverage claim must carry the snapshot of T it was validated against, and any expansion of T invalidates the old proof until re-run. Pathway loss is visible; target growth is the dangerous, quiet failure.
T3 — Coverage versus Redundancy (multiplicity). Coverage demands one pathway; it is deliberately silent about whether a second exists. The tension is between the cheap surjective guarantee and the resilience that only redundancy provides. The failure mode is single-path fragility mistaken for coverage: every target reachable, but each by exactly one pathway, so a single failure opens a gap. The diagnostic: distinguish "every target reached" from "every target reached by at least two independent pathways" — a coverage-complete system can be one outage away from a coverage hole, and reading coverage as robustness over-claims what the surjective property guarantees.
T4 — Honest Closure versus Cosmetic Contraction (sign/direction). A gap can be closed by adding a pathway (raising coverage) or by shrinking T so the gap falls outside scope (redefining coverage). Both report "covered," but they move in opposite directions on the thing that matters. The tension is between genuine extension of reach and rhetorical narrowing of obligation. The failure mode is coverage laundering: excluding a file from the report, narrowing eligibility, or de-scoping a failure mode, then claiming achievement. The diagnostic: compare the current T against the prior T — if coverage rose because the denominator shrank, the gap was hidden, not closed.
T5 — Surjective Coverage versus Injective Distinctness (coupling). Coverage (every target reached by some source) is orthogonal to injectivity (distinct sources to distinct targets, no collisions). The tension is that a system can be fully covering while many sources collide onto the same target, leaving other apparent distinctions illusory. The failure mode is inferring uniqueness or efficiency from coverage: assuming that because every requirement is met, each is met by its own dedicated mechanism. The diagnostic: separately verify the injective property — coverage proves nothing about collisions, so reading a coverage result as a bijection conflates two independent set properties that hold or fail without each other.
T6 — Local Per-Target Check versus Global Composition (scalar). The diagnostic is a per-target existence check, run target by target. The tension is between verifying each target locally and the system-level claim that all targets are simultaneously coverable under shared, finite resources. The failure mode is resource-blind coverage: each target is individually reachable, but the pathways contend for the same channel, tester time, or budget, so they cannot all be exercised at once. The diagnostic: after the per-target checks pass, ask whether the pathways are jointly realisable — a coverage proof assembled from independent existence checks can be globally infeasible even when every local check succeeds.
Structural–Framed Character¶
Coverage / reachability sits at the structural end of the structural–framed spectrum, with an aggregate of 0.0: it is the surjective completeness of a relation — every required target reached by at least one source — a set-theoretic property that holds wherever there is a source set, a target set, and a reaching relation between them. Nothing about it depends on a field's vocabulary or on any normative stance.
Every diagnostic reads structural. The pattern carries no home vocabulary that must travel: it is told as branch coverage in a test suite, destination reachability in a routing fabric, beneficiary access in a welfare programme, competency mapping in a curriculum, and mitigation coverage in an FMEA, each substrate supplying its own targets and pathways while the surjective skeleton stays invariant. It carries no inherent approval or disapproval — full coverage is not good in itself and a gap is not bad in itself until you specify what the targets are; the property is value-neutral surjectivity. Its origin is formal — definable purely as "for every t in T there exists an s in S with s R t," with two derived facts (monotonicity in pathways, relativity to T) that are mathematical, not institutional — and it runs indifferently in code-coverage instrumentation, a packet-routing graph, and a chemical-pathway analysis, none requiring a human practice to instantiate. And invoking it RECOGNISES a completeness pattern already present in the relation rather than IMPORTING a frame: to audit coverage is to enumerate T and check pathways, not to overlay an interpretive lens. On every diagnostic the prime reads structural, consistent with the 0.0 aggregate.
Substrate Independence¶
Coverage / reachability is a maximally substrate-independent prime — composite 5 / 5 on the substrate-independence scale. Its domain breadth is total: the surjective-completeness claim recurs with identical force in software branch coverage, network destination reachability, welfare-programme beneficiary access, workflow input handling, access-control permissions, curriculum competency mapping, formal-verification state enumeration, FMEA failure-mode mitigation, and chemical-pathway analysis — spanning code, institutions, pedagogy, and chemistry. Its structural abstraction is maximal because the property is statable in bare set-theoretic terms — "for every t in T there exists an s in S with s R t," with two derived facts (monotonicity in pathways, relativity to T) that are mathematical rather than domain-laden — so it carries no normative or institutional load. The transfer evidence sits a notch lower at 4: the role mappings and the five-step audit (enumerate targets, map pathways, find gaps, close gaps, watch for target-set drift) port across substrates with documented instances, but the cross-domain carrying is mostly a shared diagnostic procedure rather than a single formal model literally re-run, and what counts as a "required target" or a "pathway" must be re-decided in each substrate. The pattern is recognised wherever a source set, target set, and reaching relation exist, holding the composite at 5.
- Composite substrate independence — 5 / 5
- Domain breadth — 5 / 5
- Structural abstraction — 5 / 5
- Transfer evidence — 4 / 5
Relationships to Other Abstractions¶
Current abstraction Coverage / Reachability Prime
Parents (2) — more general patterns this builds on
-
Coverage / Reachability is a kind of Completeness Prime
Coverage/reachability is explicitly the surjective-direction specialization of the general no-gaps completeness claim.Completeness supplies the genus: No gaps in structure. Coverage / Reachability preserves that general structure while adding its differentia: A completeness claim in the surjective direction: every required target in a target set is reachable from at least one of the system's inputs, pathways, or mechanisms. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.
-
Coverage / Reachability is a kind of Surjectivity Prime
Coverage / Reachability is a specialization of Surjectivity, retaining the parent's defining structure while adding the child's specific commitments.Surjectivity supplies the genus: A coverage-guaranteeing mapping in which every element of the target is hit by some input, leaving no gap in the codomain. Coverage / Reachability preserves that general structure while adding its differentia: A completeness claim in the surjective direction: every required target in a target set is reachable from at least one of the system's inputs, pathways, or mechanisms. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.
Children (23) — more specific cases that build on this
-
Affine plank problem Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is
prime:coverage_reachability.prime:coverage_reachability is the nearest broader Prime; the source-domain invariant supplies the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Affine plank problem adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the dimension and convex body, covering planks and normals, ordinary and body widths, relative-width formula, coverage condition, lower-bound claim, proven special cases and open status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Affine plank problem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:coverage_reachability. No live DAG mutation is authorized. -
Content validity Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is
prime:coverage_reachability.prime:coverage_reachability is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Content validity adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the target construct and use, domain blueprint and facets, item pool, expert qualifications and sampling, rating criteria, agreement or index calculation, revision decisions and residual coverage gaps are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Content validity. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:coverage_reachability. No live DAG mutation is authorized. -
Cop-win graph Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is
prime:coverage_reachability.prime:coverage_reachability is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cop-win graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the graph class and loop convention, player counts and initial-choice order, legal move and information rules, capture condition, finite assumption, winning strategy and dismantling or constructibility certificate are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cop-win graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:coverage_reachability. No live DAG mutation is authorized.
- Cover (topology) Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.The candidate literally instantiates prime:coverage_reachability; its topology constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cover (topology) adds domain-specific constraints. The entry does not collapse into that parent because A family of subsets whose union contains a specified set or space, with open covers restricting the members to open subsets It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cover (topology). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Covering design Domain-specific is a kind of Coverage / Reachability
Covering Design instantiates Coverage / Reachability because every required t-subset must be reached by at least one selected block through the containment relation, with minimization applied after completeness is secured.The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Covering number Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Covering number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the metric or pseudometric space, target subset, radius and positivity, open or closed balls, internal or external center restriction, candidate cover and proof, minimized cardinality and relation to packing number or metric entropy are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Covering number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Covering Set Domain-specific is a kind of Coverage / Reachability
Covering Set instantiates **Coverage / Reachability** in a strict number-theoretic form: the required targets are all allowed indices, and each must be reached by at least one prime-divisibility rule.It presupposes **Periodicity**, because a finite residue table can govern infinitely many terms only when divisibility patterns repeat modulo each prime. **Set and Membership** supplies the generic collection apparatus but does not explain the certificate role. **Partition** is related only when the index classes happen to be disjoint; overlap is valid and common, so partition is not constitutive. **Verification** describes auditing the certificate, while **Mathematical Induction** is a contrast rather than the proof engine. The closest domain-specific neighbor is **Primefree Sequence**. That node describes a class of recurrence sequences and its nontrivial all-composite condition. Covering Set describes one finite proof mechanism that can certify such a sequence and also applies to exponential families outside the Fibonacci-type class. Neither subsumes the other.
- Danzer set Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.The candidate literally instantiates prime:coverage_reachability; its discrete_geometry constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Danzer set adds domain-specific constraints. The entry does not collapse into that parent because A set of points in Euclidean space that intersects every convex body of unit volume, studied through the unresolved question of whether bounded-density examples exist It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Danzer set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Discoverability Domain-specific is a kind of Coverage / Reachability
HCI discoverability is coverage and reachability specialized to the goal-weighted portion of a capability set reachable through bounded perception and exploration.Coverage/reachability supplies the target set, pathway set, reaching relation, and gap. Discoverability specializes these to supported system capabilities, the perception-and-exploration paths available through the encountered interface, and a goal-weighted degree of coverage under bounded search cost.
- Dominant functor Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Dominant functor adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the source and target categories, functor, quantified target object, source witness, section and retraction arrows and identity composite are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Dominant functor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Erdős–Woods number Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Erdős–Woods number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the positive distance k, witness interval start, endpoint inclusion convention, every interior offset, gcd condition and nontrivial threshold, witness verification, minimality if claimed, and indexing of published sequences are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Erdős–Woods number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Eternal dominating set Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Eternal dominating set adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Eternal dominating set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Mode collapse Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Mode collapse adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the target data distribution and relevant modes, generative model and latent source, training or fine-tuning objective, diversity and coverage metrics, omitted-mode evidence, distinction from memorization and sampling settings are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Mode collapse. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- News desert Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while News desert adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the community and geographic boundary, population and language, local-information needs, qualifying outlet and original-reporting criteria, publication frequency, staffing and beats, access and affordability, ownership, time period, data source, and threshold are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of News desert. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Opaque set Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime while the source-domain invariant supplies the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Opaque set adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the planar body and boundary, allowed barrier sets, line-crossing definition, intersection convention, connectedness, total-length measure, coverage proof, lower and upper bounds and optimality status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Opaque set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Pancyclic graph Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pancyclic graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the finite graph and order n, directed or undirected cycle convention, simplicity, every integer length from three to n, witness cycles, Hamiltonian implication and vertex edge or bipancyclic qualifications are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pancyclic graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Piecewise syndetic set Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Piecewise syndetic set adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the ambient semigroup or natural numbers, subset, translate convention, finite witness or gap bound, arbitrary finite-pattern or long-interval quantifiers and equivalence with thick-intersection and partition-regular formulations are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Piecewise syndetic set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Reachability problem Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Reachability problem adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the state space and representation, initial and target states or sets, transition rules, path semantics, finite or infinite horizon, exact or approximate decision and complexity or decidability claim are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Reachability problem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Γ-space Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Γ-space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the topological space, cover family and openness, omega-cover finite-subset condition and exclusion, selected subfamily, gamma-cover eventual-membership condition, countability assumptions and equivalent combinatorial characterization are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Γ-space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Tarski's Plank Problem Domain-specific is a kind of Coverage / Reachability
**Coverage / Reachability** is the strict parent by specialization.The plank family must reach every point of the convex body, and any uncovered point defeats the premise. Tarski's theorem adds Euclidean plank geometry and a quantitative width lower bound; Coverage / Reachability is broader and carries no such metric cost. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Web navigation Domain-specific is a kind of Coverage / Reachability
The proposed strict upward parent is `prime:coverage_reachability`.prime:coverage_reachability is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Web navigation adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the information space and user goal, nodes and hyperlinks, global and local hierarchy, contextual and supplemental controls, labels and orientation cues, browser state, path and usability evidence are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Web navigation. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:coverage_reachability`. No live DAG mutation is authorized.
- Revocation Closure Prime is part of Coverage / Reachability
Complete reachability over the grant's actual live effect set is a strict constituent of Revocation Closure.The property fails if even one active manifestation or derivative lies beyond every revocation pathway, so the required target set must be covered by the issuer's invalidation mechanisms.
- Schema-Bounded Blind Spot Prime presupposes Coverage / Reachability
A schema-bounded blind spot exists only relative to an intended coverage claim connecting elicitation prompts or categories to the cases that should be surfaced.Coverage / Reachability supplies a source set, a required-target set, and the obligation that every target be reached. Schema-Bounded Blind Spot adds the deeper failure in which the finite schema helps define the visible target set, leaving an out-of-schema case absent from the very audit that would reveal the gap.
Hierarchy paths (2) — routes to 2 parentless roots
- Coverage / Reachability → Completeness
- Coverage / Reachability → Surjectivity → Function (Mapping)
Neighborhood in Abstraction Space¶
Coverage / Reachability sits in a moderately populated region (49th percentile for distinctiveness): it has near-neighbors but no dense thicket of synonyms.
Family — Coverage, Reachability & Completeness Gaps (9 primes)
Nearest neighbors
- Exposure Pathway — 0.74
- Access Catchment — 0.73
- Surjectivity — 0.73
- Bijectivity — 0.71
- Representational Structure Mismatch — 0.70
Computed from structural-signature embeddings · 2026-09-10
Not to Be Confused With¶
The nearest neighbour, and the easiest confusion, is traceability. Both relate two sets — sources and targets, artefacts and requirements — and both are diagnosed by walking a relation. But they assert opposite obligations on opposite directions. Traceability is a per-element provenance claim: each artefact can be linked back to the requirement or origin it serves, so the relation is read source-by-source and its guarantee is that nothing is unaccounted for in its lineage. Coverage is a surjective completeness claim: every required target has at least one source reaching it, so the relation is read target-by-target and its guarantee is that no target is orphaned. A codebase can be fully traceable (every line maps to a requirement) yet have terrible coverage (many requirements exercised by no test), and vice versa. The invariants differ: traceability's invariant is the existence of a backward link from each artefact; coverage's is the existence of a forward link to each target. Conflating them lets a team cite a tidy requirements-traceability matrix as if it proved their test suite reached every requirement — two different relations on the same sets.
A second genuine confusion is with redundancy. Coverage is deliberately silent about pathway multiplicity: it is satisfied by exactly one source per target. Redundancy is precisely the claim coverage refuses to make — that more than one independent pathway exists, so that the loss of one does not open a gap. The two are stacked, not synonymous: redundancy presupposes coverage (you cannot have two pathways to a target that has none) but adds a resilience guarantee coverage never offers. The practical hazard is reading a green coverage report as robustness. A system where every target is reached by exactly one pathway is coverage-complete and single-fault-fragile at once; the prime's monotonicity tells you adding pathways only helps, but only the redundancy lens tells you how many you need for the failure model you face.
A third worth separating is completeness in its general sense. General completeness is the unqualified "nothing is missing," a property whose meaning depends entirely on what "missing" ranges over. Coverage is a sharpened, structural species of it: completeness of a reaching relation, in the surjective direction, relative to an explicit target set, and monotone in the source set. The sharpening is what makes coverage auditable in minutes where general completeness invites endless argument — but it also means a coverage claim is only as honest as its declared target set. The dishonest move the prime names (shrinking T so gaps fall outside scope) is invisible if one reasons in the loose vocabulary of "is it complete?" and obvious once one insists on coverage's relativity to a named T.
For a practitioner the distinctions are operational. Ask traceability questions to audit provenance and impact ("if this requirement changes, what must change?"); ask coverage questions to audit reach ("is every requirement exercised by something?"); invoke redundancy when a single pathway is an unacceptable single point of failure; and never let a coverage percentage stand in for either provenance or resilience. The three relations can each hold or fail independently, and a system's safety case usually needs all three argued separately.
Solution Archetypes¶
Solution archetypes in the catalog that build on this prime — directly (this prime is a source ingredient) or as a related prime.
Built directly on this prime (5)
- Endpoint Fan-Out Fulfillment: Design the deconsolidation, local staging, routing, service-mode, access, evidence, and recovery layer that turns efficient trunk flow into verified endpoint completion.▸ Mechanisms (21)
- Address or Endpoint Validation — Checks each endpoint's identity, location, eligibility, connectivity, and access prerequisites before anything is dispatched, so effort is only spent on endpoints that can actually be served.
- Community Access Point — Stands up a trusted local place — staffed with people who know the community — where endpoints can get assisted pickup, connectivity, identity help, or translation to complete a service they couldn't finish alone.
- Demand Aggregation Window — Briefly holds compatible low-density requests until enough accumulate to serve them together as one efficient cluster, instead of dispatching each sparse request on its own.
- Dynamic Route Optimization — Continuously recomputes routes and assignments from live demand, capacity, traffic, priority, and failure signals, so the fan-out adapts to conditions on the ground instead of following a fixed plan.
- Endpoint Completion Dashboard — Puts verified endpoint completion — not trunk throughput or dispatch — at the center of the view, exposing the gap between what was sent and what actually arrived, sliced by segment.
- Endpoint Cost-to-Serve Analysis — Estimates the full cost of successfully completing service at each class of endpoint — including the last-mile share that trunk-level accounting hides — so the true economics of the edge become visible.
- Exception Queue — Pulls the endpoint cases that don't fit the standard flow into a dedicated queue with its own capacity and clock, so the main line keeps moving and the oddballs still get resolved.
- Failed-Attempt Recovery Workflow — Turns a failed endpoint attempt into a classified, routed recovery — diagnosing why it failed and sending it to correction, an alternate mode, a reschedule, or escalation — so one miss doesn't become a permanent non-completion.
- Geospatial Service-Area Mapping — Turns endpoint locations, travel times, terrain barriers, and service deserts into one spatial picture that shows where the fan-out is hard and where local staging could sit.
- Local Dispatch or Field Team — Standing local operational capacity — people who know the ground — assigned to work the last leg, clear on-site obstacles, and close the exceptions no ticket can specify.
- Local Inventory or Edge Cache — A forward-placed buffer of the frequently-needed goods, data, or capability held close to endpoints, so the common request is served locally — fast, and still served when the trunk is slow or down.
- Local Partner or Agent Network — Delegates endpoint completion to trained third-party local actors under an explicit contract that defines what 'done' means and where the system's responsibility hands off to theirs.
- Long-Tail Support Tier — Runs a deliberately lower-volume but still reliable service mode for niche users, rare configurations, and low-frequency needs the mainstream offering drops.
- Micro-Hub or Pickup-Point Network — Local nodes where consolidated trunk flow is broken down and staged for short final legs or self-collection — relocating the handoff off the doorstep to a dense, efficient point.
- Mobile Service Unit — A self-contained unit that travels to sparse or hard-to-reach endpoint clusters, bringing the goods, equipment, or expertise to recipients instead of requiring them to come to a fixed point.
- Multimodal Delivery Switching — Maintains a portfolio of delivery modes and moves an endpoint from one to another — home, pickup, mobile, partner, assisted, remote — when its conditions, cost, or repeated failures change which mode fits.
- Proof-of-Completion Capture — Captures just enough verifiable evidence that an endpoint was actually served — a signature, photo, scan, or confirmation — proportionate to the stakes, so completion is provable without over-collecting.
- Route Clustering and Territory Design — Groups scattered endpoints into service clusters and territories that lift route density and balance workload, while protecting latency limits, capacity, equity, and the sparse tail that clustering tends to strand.
- Scheduled Service Window — Carves out protected, recurring time to repair, patch, replace, and clean up endpoints so upkeep never has to fight live demand for the same capacity.
- Targeted Outreach Campaign — Goes out and finds the specific endpoints that are stuck — missing information, blocked by an access barrier — and proactively removes the blocker so they can complete, instead of waiting for them to come to the system.
- Transparent Cross-Subsidy Schedule — An explicit, reviewable rule that funds high-cost or essential endpoints out of pooled system revenue, making the who-pays-for-whom of universal service visible instead of hidden.
- Exposure Pathway Interruption: Map how a hazard can reach a vulnerable target, then break or verify the route rather than treating risk as a diffuse attribute.▸ Mechanisms (16)
- After-Action Pathway Update — After an incident or near-miss, rebuilds the source-pathway-receptor model to add the route that was actually used and the links that turned out to be cuttable.
- Barrier Interposition — Places a physical barrier across a chosen link in the route, adding one engineered layer whose only job is to stop the hazard from traversing that step.
- Buffer Zone Design — Reserves a band of space between a source and its receptors, sized so the hazard's reach in its carrier medium falls short of who must be protected.
- Contact Time Reduction — Shrinks exposure by cutting how long the receptor stays in contact at the interface, lowering cumulative dose without changing the concentration present.
- Exposure Sampling Transect — Lays a line of samplers from source outward to measure the real exposure gradient, so residual exposure is mapped where receptors actually are rather than assumed.
- Filtration or Scrubbing — Lets the carrier medium keep flowing but strips the hazard out of it in transit, so what arrives downstream is cleaned rather than blocked.
- Multi-Barrier Verification Drill — Exercises a layered defense by disabling one barrier at a time and checking that no path then reaches a receptor, proving the redundancy is real.
- Pathway Reachability Analysis — Treats exposure as a graph problem — computes whether a hazard can still reach a target after a proposed cut, and exposes the substitute routes that keep it reachable.
- Personal or Local Protective Control — Shields the receptor at the last line — worn or point-of-use protection on the specific contact interface — sized to who is most vulnerable and ready to deploy when exposure spikes.
- Risk Migration Review — Checks, after a control goes in, whether the hazard actually fell or merely moved — to a substitute route, downstream, or onto a more vulnerable population.
- Route Closure or Segmentation — Severs or compartmentalizes the specific links a hazard travels, then assigns an owner and a keep-closed cadence so a cut route cannot quietly reopen.
- Sentinel Receptor Monitoring — Places sensitive indicator receptors where a hazard would arrive first, so any breakthrough shows up on a canary before it reaches the population being protected.
- Source Elimination or Substitution — Removes the hazard at its origin or swaps in a benign substitute, so there is no source left to route anywhere — verified against a dose threshold, not just 'less of it.'
- Source Reduction Program — Lowers how much hazard enters the pathway at its upstream sources, so every barrier, buffer, and filter downstream has less to hold back.
- Vector or Carrier Control — Suppresses the living or physical carrier that ferries a hazard along the pathway, timed to its seasonal abundance — knock down the vector and the route it embodies collapses.
- Ventilation or Flow Redirection — Moves or dilutes the carrying medium — air or water — so its flow sweeps the hazard away from the receptor and holds concentration at the point of contact below the harmful dose.
- Receptive-Field Tiling Design: Cover a large input or problem space with bounded local responders whose fields are sized, overlapped, calibrated, and integrated so each region receives appropriate sensitivity without overwhelming every unit with the whole space.▸ Mechanisms (10)
- Coverage Heatmap Audit — Renders the field tiling as an intensity map so realized coverage, over-dense cells, and cold gaps are visible at a glance.
- Edge-Case Probe Suite — A curated battery of boundary, sparse, and long-tail inputs fired at the tiling to expose gaps, mis-thresholds, and seam conflicts.
- Field Calibration Review — A recurring meeting where field owners review misses, false activations, and boundary disputes, then retune thresholds and edges.
- Geofenced Service Coverage Grid — A map of bounded geographic zones, each assigned an accountable responder, with denser zones where demand runs hot.
- Multi-Scale Field Pyramid — Stacks coarse and fine field layers over the same input so broad context and local detail are both captured.
- Overlap Handoff Protocol — The rulebook for the seam between fields: who jointly handles, who takes final ownership, and how their outputs reconcile.
- Receptive-Field Map — The canonical blueprint: it names the input space, delineates each local field, and shows how the fields tile to cover it.
- Sliding-Window or Kernel Bank — A bank of local detectors dragged across the input, each firing when its patch matches, so patterns are found piece by piece.
- Specialist Routing Matrix — A live workflow that reads each case's attributes and dispatches it into the specialist field that owns it, branching on ambiguity.
- Unowned Input Alert — A live watchdog over the negative space that fires when an input arrives that no field confidently owns, and forces it to an owner.
- Target-Complete Mapping Design: Define the required target space and ensure every target has at least one valid, feasible, and verifiable source-side witness, with no silent gaps.▸ Mechanisms (18)
- Accessibility Reachability Test — Checks that each required target can actually be reached and used in practice by the people it is meant to serve — not just that a route exists on paper — and flags targets reachable only inequitably.
- Bipartite Coverage Matrix — Lays the required targets and the valid sources on two axes and marks every covering pair, so any target whose row is blank stands out as an uncovered gap.
- Capability–Case Crosswalk — Reconciles a catalog of what the organization can do against the list of cases it must serve, exposing prioritized cases that no capable, adequately-resourced provider actually covers.
- Coverage Counterexample Search — Actively hunts for a single required target that no valid source covers — a counterexample to the completeness claim — instead of tallying how much is covered.
- Coverage Dashboard — A live surface that shows current coverage against the required targets, weighted by priority, and lights up the moment a newly-added target has no witness yet.
- Graph Reachability Analysis — Models sources, intermediate steps, and targets as a directed graph and computes which targets are actually reachable, so any target hidden behind a broken dependency shows up as a provable gap.
- Periodic Coverage Recertification — On a fixed cadence, re-proves from scratch that every required target still has a valid witness — with an independent sign-off — so coverage that quietly decayed since last time is caught before it is assumed.
- Preimage Witness Generator — For a target that currently has no covering source, constructs at least one concrete witness — a route, capability, or artifact — that provably reaches it, turning a gap into a covered case.
- Redundancy N+1 Check — Removes one witness — or one shared dependency — from a protected target's coverage and rechecks that the target is still reached, proving the redundancy is real rather than nominal.
- Requirements Traceability Matrix — Threads every requirement through to the design, code, and verification that satisfy it, so any requirement with no downstream link — or no passing test — is a visible coverage hole.
- Scenario Enumeration Workshop — A facilitated session that deliberately enumerates the full space of cases the system must serve — surfacing rare, edge, and unthought-of targets before reality forces them onto the list.
- Service-Area Gap Analysis — Overlays required coverage on the actual usable reach of the available sources to expose the regions and groups no source can serve — and whether the gaps fall unequally.
- Set-Cover Analysis — Selects the smallest or cheapest set of sources whose combined reach covers every required target — turning 'cover everything' into a solvable optimization and exposing targets no source can reach.
- Source Capacity Load Test — Drives a source to the realistic peak demand of all its assigned targets to confirm it can actually serve at load — and that it degrades safely rather than silently dropping coverage when overwhelmed.
- Target-Space Difference Review — Diffs the required target set and mapping against their last certified baseline and treats every newly added or changed target as uncovered until a fresh witness proves otherwise.
- Test-Case-to-Requirement Linker — Binds each verification test to the specific requirement it exercises, creating a per-requirement witness record and exposing requirements with no test bound to them.
- Uncovered-Target Triage — Works the register of uncovered targets one by one, assigning each an accountable owner and a disposition — fix, defer, or authorized exclusion — so no gap sits unowned or silently dropped.
- Witness Validation Test — Executes a claimed witness under realistic conditions to confirm it actually reaches its target — turning a recorded link into dated evidence and unmasking phantom witnesses that exist only on paper.
- Vulnerability Hotspot Mapping and Hardening: Find where several independent vulnerabilities pile up in the same unit, validate the cluster, and harden that point before average-risk reasoning misses it.▸ Mechanisms (18)
- Capacity Buffer Prepositioning — Stocks reserve capacity next to the hotspots that will need it most, ahead of the window when a shock would overwhelm them.
- Common-Driver Decomposition — Tests whether the vulnerabilities stacked on a hotspot are genuinely independent or all traceable to one shared cause — so hardening targets the driver, not the symptoms.
- Equity Impact Review — Reviews who gets helped and who is left exposed when effort concentrates on the statistical hotspots, so hardening does not quietly abandon the already-disadvantaged.
- Exposure Pathway Breakpointing — Traces the route by which exposure reaches a hotspot and inserts a break in it, watching where the interrupted risk tries to reroute.
- Field or Operator Ground-Truth Walkthrough — Takes the mapped hotspot to the actual site and checks it against what the people who work there already know.
- Hotspot Tabletop Stress Test — Walks a cross-functional group through a scenario built to hammer the suspected hotspot, to watch how it fails before it fails for real.
- Intersectional Stratification Table — Cross-tabulates an outcome across intersecting attributes so the subgroup where several disadvantages coincide appears instead of being washed out by the average.
- Layered Risk Heatmap — Overlays exposure and susceptibility layers on one shared unit grid so the cells where several risks pile up light up as hotspots the average hides.
- Multiple-Testing Holdout Check — Re-tests a discovered hotspot on held-out data before anyone acts, so a cell that is only the worst of a thousand comparisons is not mistaken for a real one.
- Redundancy Insertion at Hotspot — Adds parallel or backup capacity at a hotspot so the weak point can fail without the system failing with it.
- Residual Hotspot Exception Review — Formally reviews the hotspots that cannot be fully fixed and signs off the leftover risk — with compensating controls and an expiry — instead of letting it hide.
- Resource Allocation Rebalancing — Redirects finite protection resources away from an even spread and toward the ranked hotspots, so effort lands where risk actually concentrates.
- Rolling Hotspot Recalibration — Re-scores and re-ranks the hotspot map on a fixed cadence against what actually happened, so the map tracks a moving risk landscape instead of freezing on its first version.
- Sentinel Site Monitoring — Watches a few carefully chosen high-risk sites continuously, so a hotspot turning active — or risk migrating to a new one — is caught early.
- Single-Point-of-Failure Elimination — Finds the lone component whose failure would take down the whole, and removes its singularity so no single element stays catastrophic.
- Spatial or Network Cluster Detection — Tests where high-risk units genuinely cluster in space or on a network, screening out the concentrations that are only chance, so hardening targets real hotspots.
- Targeted Hardening Sprint — Concentrates a cross-functional team on the single highest-priority hotspot for a fixed window, until it is measurably hardened, then rotates to the next.
- Vulnerability Index Construction — Fuses several vulnerability layers into one comparable score per unit, so the places where disadvantages pile up rank above anything a single metric would reveal.
Also a related prime in 2 archetypes
- Collision-Free Mapping Design: Protect source distinctions by ensuring that no two distinct inputs map to the same target unless an explicit, reviewed merge is intended.
- Dense-Subset Coverage Design: Use a smaller, explicitly spaced reference set so every relevant point in a larger domain has a nearby stand-in within an acceptable tolerance.
References¶
[1] Rosen, Kenneth H. Discrete Mathematics and Its Applications. 8th ed. New York: McGraw-Hill, 2019. Standard discrete-mathematics text defining a surjection (onto function/relation): a relation from S to T is surjective iff for every t in T there exists s in S with s related to t; covers the injection/surjection/bijection duality that generates standard bijection properties. registry ↩a ↩b
[2] Myers, Glenford J., Corey Sandler, and Tom Badgett. The Art of Software Testing. 3rd ed. Hoboken: Wiley, 2011. Standard reference defining statement, branch, and path coverage as the requirement that every code branch be exercised by at least one test. registry ↩a ↩b
[3] Kurose, James F., and Keith W. Ross. Computer Networking: A Top-Down Approach. 8th ed. Hoboken: Pearson, 2021. Standard networking text on routing and forwarding, including reachability information propagation so that every required destination is reachable across the routing fabric and unreachability is the design failure to detect. registry ↩
[4] Ko, Wonsik, and Robert A. Moffitt. "Take-up of Social Benefits." NBER Working Paper No. 30148, 2022 (in Handbook of Labor, Human Resources and Population Economics, ed. K. F. Zimmermann). Surveys incomplete take-up of social benefits worldwide — only ~30-80% of eligible populations receive targeted benefits versus ~100% for universal programmes — with administrative barriers and access frictions leaving eligible-but-unreached classes, the chronic coverage gap. registry ↩a ↩b ↩c
[5] Sandhu, Ravi S., Edward J. Coyne, Hal L. Feinstein, and Charles E. Youman. "Role-Based Access Control Models." IEEE Computer, vol. 29, no. 2 (1996): 38-47. Foundational RBAC model in which permissions to actions are granted through roles, framing coverage as every required action permitted by at least one role. registry ↩
[6] Wang, Lin, et al. "Using Curriculum Mapping as a Tool to Match Student Learning Outcomes and Social Studies Curricula." Frontiers in Psychology, vol. 13 (2022): 951696. Documents curriculum mapping as the practice of aligning every required learning outcome/competency to at least one course and identifying coverage gaps (uncovered competencies) and redundancies. registry ↩
[7] Clarke, Edmund M., Orna Grumberg, and Doron A. Peled. Model Checking. Cambridge: MIT Press, 1999. Standard text on reachable-state enumeration and reachability analysis in formal verification, including the dual obligation of proving bad states unreachable. registry ↩
[8] International Electrotechnical Commission. IEC 60812:2018, Failure Modes and Effects Analysis (FMEA and FMECA). 3rd ed. Geneva: IEC, 2018. Standard for FMEA, requiring that every documented failure mode be addressed by at least one mitigating treatment/control — coverage of the failure-mode set. registry ↩a ↩b