Analysis, Modeling & Optimization

← Back to Mechanisms by Form Family

A calculation, model, estimator, diagnostic, comparison, simulation, or optimization that transforms inputs into an inference, prediction, recommendation, or formal result.

1,159 mechanisms across 471 solution archetypes. Form describes the concrete thing a practitioner deploys, enacts, maintains, or convenes; it does not describe the problem, the solution move, or the originating domain.

Because this set contains more than 100 mechanisms, it is divided by solution family—the governing move the mechanism makes. This is a browsing subdivision only; it does not change the form classification. Click a family below to jump to its fully visible section, or click a column header to sort.

Solution family	Mechanisms	Description
Adaptation & Reconfiguration	17	Solutions that alter structure, parameters, roles, or behavior in response to changing conditions while preserving the system's purpose.
Aggregation & Synthesis	57	Solutions that combine many observations, judgments, signals, or parts into a useful whole while managing weighting, dependence, and loss of detail.
Alignment & Incentives	13	Solutions that make individual choices, rewards, responsibilities, or local objectives support a larger goal instead of working against it.
Allocation & Prioritization	5	Solutions that distribute scarce attention, effort, money, capacity, or opportunity among competing claims and make the order of service explicit.
Anticipation & Forecasting	17	Solutions that look ahead, surface plausible futures, identify leading indicators, or prepare options before a consequential state arrives.
Attention, Salience & Focus	12	Solutions that direct limited attention toward what matters, protect focus from interference, or deliberately change what becomes noticeable.
Boundary & Scope Control	17	Solutions that define, move, or police what is inside a problem, system, role, claim, or responsibility and what remains outside it.
Buffering & Reserves	35	Solutions that absorb variability, delay, shocks, or temporary imbalance through slack, queues, inventories, reserves, or intermediate storage.
Calibration & Tuning	39	Solutions that compare behavior with a reference and adjust parameters, thresholds, mappings, or tolerances until performance falls within an acceptable range.
Causal Diagnosis	6	Solutions that distinguish symptoms from causes, compare explanations, localize a fault, or identify the intervention point responsible for an outcome.
Classification & Taxonomy	3	Solutions that sort cases into meaningful classes, establish membership criteria, or organize concepts so distinctions can guide action.
Communication & Signaling	6	Solutions that convey meaning, intent, state, or credibility across people or systems while accounting for interpretation, noise, and strategic response.
Comparison & Evaluation	11	Solutions that place alternatives, cases, or outcomes against shared criteria so differences become visible and judgments become defensible.
Compression & Simplification	38	Solutions that reduce complexity, detail, or dimensionality while retaining the structure needed for the current decision or task.
Constraints & Guardrails	19	Solutions that prevent unacceptable states or actions by encoding limits, invariants, preconditions, safe envelopes, or error-proofing rules.
Containment & Isolation	15	Solutions that keep faults, hazards, conflicts, contamination, or overload from spreading by separating regions, flows, or responsibilities.
Coordination & Synchronization	17	Solutions that align interdependent actors, tasks, clocks, states, or handoffs so joint work progresses without collision or drift.
Cost, Value & Pricing	17	Solutions that expose economic value, opportunity cost, price, return, or burden so choices reflect what is gained, spent, or displaced.
Decomposition & Modularity	14	Solutions that split a difficult whole into coherent levels, modules, roles, or subproblems that can be understood and changed more independently.
Decoupling & Interfaces	21	Solutions that reduce harmful dependency by inserting contracts, adapters, abstractions, or replaceable boundaries between interacting parts.
Deliberation & Conflict Resolution	2	Solutions that structure disagreement, negotiation, arbitration, or collective judgment so incompatible views can reach a workable resolution.
Diversity & Exploration	9	Solutions that preserve variety, generate alternatives, widen the search space, or prevent premature convergence on one approach.
Emergence & Self-Organization	13	Solutions that shape local rules, interactions, or environmental cues so useful global order can arise without direct central specification.
Error Prevention & Correction	1	Solutions that remove opportunities for mistakes, detect invalid states, repair deviations, or make failures easier to reverse.
Evidence, Inference & Validation	98	Solutions that gather, test, triangulate, or qualify evidence so claims and decisions match what the observations can actually support.
Feedback & Regulation	15	Solutions that sense the effects of action and use the result to stabilize, steer, damp, amplify, or otherwise regulate subsequent behavior.
Flow & Routing	9	Solutions that direct material, information, demand, work, or traffic through paths and stages to improve movement and avoid congestion.
Governance & Accountability	7	Solutions that allocate decision rights, oversight, responsibility, transparency, and consequences so power remains answerable and action-owned.
Identity, Reference & Matching	5	Solutions that establish what an entity is, bind records to the right referent, resolve names, or match cases without confusing near-equivalents.
Integration & Composition	2	Solutions that assemble parts into a functioning whole, reconcile interfaces, and verify that combined behavior preserves required properties.
Knowledge, Memory & Provenance	12	Solutions that capture, retain, retrieve, transfer, and trace knowledge or records so later users can recover both content and origin.
Learning & Scaffolding	5	Solutions that sequence practice, feedback, examples, and support so capability grows and transfers beyond the original learning setting.
Lifecycle & Maintenance	4	Solutions that manage creation, operation, upkeep, renewal, retirement, and accumulated burden across the useful life of an artifact or system.
Mapping & Transformation	76	Solutions that translate between representations, coordinate systems, scales, formats, or states while preserving the relationships that matter.
Measurement & Observability	31	Solutions that make hidden state inferable through instruments, indicators, probes, sampling, or diagnostic views with known limits.
Negotiation & Strategic Interaction	13	Solutions that account for other agents' incentives, reactions, commitments, bargaining power, and counter-moves when outcomes are interdependent.
Normalization & Standardization	6	Solutions that create comparable scales, shared formats, common baselines, or repeatable conventions across otherwise inconsistent cases.
Optimization & Search	31	Solutions that explore alternatives under objectives and constraints, prune infeasible regions, and improve a candidate toward a chosen criterion.
Ordering, Sequencing & Dependencies	32	Solutions that arrange steps or events according to precedence, causality, readiness, or dependency so work happens in a valid order.
Participation, Norms & Culture	4	Solutions that shape belonging, legitimacy, shared expectations, collective practice, and the willingness of people to contribute or comply.
Planning & Staging	11	Solutions that turn an intended outcome into phases, milestones, option points, and coordinated preparations before execution.
Prediction & Simulation	33	Solutions that use models, scenarios, experiments, or synthetic environments to estimate behavior before committing in the real system.
Quality Assurance & Release	4	Solutions that verify fitness, coverage, conformance, and readiness before an output is accepted, shipped, or trusted downstream.
Recovery & Restoration	5	Solutions that return a damaged, degraded, or interrupted system to service through repair, rollback, reentry, regeneration, or reconstruction.
Redundancy & Fault Tolerance	3	Solutions that preserve service when parts fail by duplicating capability, diversifying failure modes, or providing independent alternate paths.
Reframing & Sensemaking	32	Solutions that change the interpretive frame, surface hidden assumptions, or organize ambiguous experience into a more useful account.
Representation & Modeling	109	Solutions that construct schemas, models, diagrams, abstractions, or formal descriptions that make structure available for reasoning.
Resource Efficiency & Conservation	13	Solutions that reduce waste, preserve scarce stocks, recover usable value, or improve the useful output obtained from finite resources.
Risk, Robustness & Uncertainty	34	Solutions that make uncertainty explicit, limit downside, preserve acceptable behavior across variation, or prepare contingencies for adverse outcomes.
Scaling & Capacity	18	Solutions that match capability to load, grow or shrink safely, and manage how structure and performance change with size.
Scheduling & Pacing	7	Solutions that choose timing, cadence, duration, rate, or work-in-progress so demand and action remain temporally compatible.
Selection & Filtering	16	Solutions that admit, retain, rank, or reject candidates according to fitness, relevance, quality, or another discriminating rule.
Substitution & Fallback	11	Solutions that replace unavailable or unsuitable means with alternatives while preserving the essential function, contract, or outcome.
Thresholds & Phase Change	18	Solutions that detect, create, avoid, or govern nonlinear transitions when accumulating conditions cross a consequential boundary.
Tradeoffs & Decision Support	49	Solutions that expose competing objectives, preference structure, stopping rules, and consequences so a choice can be made under constraint.
Transmission, Propagation & Networks	10	Solutions that shape how signals, behaviors, effects, or resources spread through channels and network topology over space or time.
Variation & Experimentation	32	Solutions that deliberately vary conditions, compare trials, preserve controls, and learn from differential outcomes without overclaiming.

Adaptation & Reconfiguration

Solutions that alter structure, parameters, roles, or behavior in response to changing conditions while preserving the system's purpose.

17 mechanisms · View full solution family

• Adaptive Window Re-estimation — Keeps a live window estimate current as evidence arrives — narrowing the uncertainty band and forecasting when the window will close — so timing rides the latest data instead of a frozen prior.
• Agent-Based Niche Simulation — Runs the co-shaping loop forward in silico with many adaptive agents, so you can watch which environmental changes stay viable — and which get gamed — before committing them for real.
• Basin-of-Attraction Mapping — Sweeps many starting conditions to chart which attractor a system tends toward and where the basin boundaries lie, keeping the uncertainty visible.
• Benchmark Deconstruction Grid — Arrays several successful sources against a shared feature grid so the design logic that recurs across all of them separates from the quirks local to any one.
• Escalation Archetype Mapping — Maps a runaway tit-for-tat between two parties as the Escalation archetype — two balancing loops coupled through relative position — so the rivalry can be diagnosed instead of fought.
• Fixes That Fail Diagnosis — Diagnoses a problem that keeps relapsing as Fixes That Fail — a quick fix whose delayed side effect quietly recreates the very symptom it relieved.
• Form–Function Decomposition — Pulls a candidate convergent form apart into surface appearance, functional role, performance advantage, and failure behavior, then sets the threshold at which two cases count as the same solution.
• Leverage Point Matrix — Ranks candidate places to intervene in the diagnosed loop by how much structural change each buys, so effort goes to high-leverage sites instead of the obvious low-leverage ones.
• Limits to Growth Diagnosis — Diagnoses stalled growth as Limits to Growth — a reinforcing engine running into a balancing constraint — and locates the binding limit that caps it.
• Merkle-Tree Divergence Scan — Compares two replicas by exchanging a tree of range hashes, zeroing in on exactly which keys differ while transferring almost no data.
• Multiple-Origin Evidence Weighting — Assembles the heterogeneous evidence for a recurrence — independence, pressure match, sample diversity, negative cases, performance — and weights it into a single graded probability of genuine multiple origin.
• Opponent or Partner Response Simulation — A model that plays the interaction forward — you move, the other side responds per a model of its incentives, and both payoffs are scored — to reveal counter-moves before you commit.
• Pressure Similarity Matrix — A case-by-dimension grid that scores how similar the pressures — costs, constraints, incentives, affordances, selection pressures — actually were across cases, to test whether the recurrence tracks a shared problem space.
• Receptivity-Curve Estimation — Estimates the shape of a system's receptivity across its developmental state — where it peaks, how steeply it falls, whether it ends in a cliff or a tail — so a window can be located rather than assumed.
• Reciprocal Adaptation Scenario Planning — Builds a small set of divergent futures in which the other side adapts differently, so strategy is chosen to be robust across how the coupling might evolve — not optimized against today's opponent.
• Shifting the Burden Diagnosis — Diagnoses a deepening reliance on a symptomatic quick fix as Shifting the Burden — where the easy relief crowds out and atrophies the fundamental solution.
• Workflow Fit Analysis — Maps how the design intersects with existing routines, handoffs, tools, timing, and exception paths.

Aggregation & Synthesis

Solutions that combine many observations, judgments, signals, or parts into a useful whole while managing weighting, dependence, and loss of detail.

57 mechanisms · View full solution family

• Administrative Record Linkage — Joins existing registries and ledgers through a secure crosswalk to reveal units and cut the fieldwork the enumeration would otherwise need.
• Agent-Based or Ensemble Simulation — Builds a population of heterogeneous agents from the bottom up to test whether their varied micro-behavior actually reproduces the macro equilibrium.
• Banzhaf Power Index — Measures each participant's voting power as how often their switch is the vote that flips a coalition from losing to winning, counted equally across every possible coalition.
• Bootstrap Association Interval — Resamples the data many times over to see how much the correlation would wobble on a different draw, turning a single coefficient into an interval that shows whether it is solid or noise.
• Capture-Recapture Check — Estimates how many units were never seen from the overlap between two independent enumeration passes, without treating either as the final list.
• Cohort Analysis — Groups individuals by a shared starting point so their later trajectories can be compared as units instead of case by case.
• Collision Analysis Matrix — Cross-tabulates inputs against outputs to expose where distinct inputs collide on the same output and where the mapping's uniqueness fails.
• Committee Scoring — Has multiple reviewers score, rank, or classify cases against a shared rubric, then combines the scores into a decision input.
• Composite Indicator — Combines several disparate measures into one weighted index so many dimensions can be tracked or ranked as a single number.
• Composition-vs-Transformation Dashboard — Displays how much of an aggregate shift is composition versus within-unit transformation and routes the decision to the matching intervention lever.
• Constraint-Solver Backsolve — Encodes the output condition and domain as constraints and derives the complete set of inputs that satisfy them, with a guarantee that none is missed.
• Covariance or Factor Model — Explains a whole web of correlations as a few shared drivers plus what is left over, separating co-movement that is systematic from co-movement that is idiosyncratic.
• Covariance Selection-Term Calculation — Isolates the selection channel by computing the covariance between a unit's value and its change in relative weight — a single statistic whose sign says whether high-value units gained share.
• Dashboard Rollup Formula — Encodes how many low-level metrics roll up through the org hierarchy into one headline number while keeping every underlying exception one click away.
• Data Binning — Cuts a continuous or high-cardinality variable into a few labeled bands so cases can be compared and acted on by band rather than by exact value.
• Decomposition Residual Reconciliation Workflow — Takes the leftover after selection and transmission are subtracted from the observed change and attributes it to unmatched units, scale drift, or normalization rather than substance.
• Deterministic Pairwise Accumulation — Pins floating-point reductions to one fixed pairwise summation path so the same inputs give bit-identical totals no matter how many workers run, trading peak scheduling freedom for reproducibility and a tighter error bound.
• Diversified Forecast Pool — Combines forecasts from multiple forecasters, methods, horizons, or data feeds to support planning under uncertainty.
• Ensemble Model — Combines multiple predictive models into one composite predictor whose output depends less on any single model specification.
• Entry/Exit Normalization Protocol — Fixes how entrants and exiters enter the weights so that churn in the population does not masquerade as real change in the weighted mean.
• Fiber Cardinality Count — Reports how many inputs map to each output — the size of the fiber — along with how much to trust that number.
• Grouped Reporting Table — Presents many records as one summary row per group, with the same records re-pivotable along different grouping dimensions.
• Intersection Matrix — Cross-tabulates candidate outputs against every parallel filter at once, exposing the joint survivor set and the exclusions that several filters overdetermine together.
• Inverse Lookup Query — Answers an output back to its inputs by querying a reverse index, returning every input already filed under the target value.
• Lag-Correlation Matrix — Correlates each variable against time-shifted copies of itself and others, so a relationship that shows up only at a delay — a lead or a lag — stops being averaged into zero.
• Lineage or Panel Correspondence Matrix — Maps which units in the first state correspond to which in the second — continuing, entered, exited, split, or merged — so selection and transmission can be told apart at all.
• Median, Trimmed-Mean, or Quantile Rule — Summarizes a single distribution with an order-statistic rule chosen so outliers, skew, or the tail survive the compression instead of being averaged away.
• Minimal Winning Coalition Enumeration — Lists every coalition that wins but would lose if any single member left, exposing the players who sit in all of them (indispensable) and none of them (powerless).
• Model Averaging — Pools predictions or parameter estimates from several models using equal or performance-based weights.
• Multi-Source Intelligence Synthesis — Combines evidence streams from different collection methods, observers, instruments, or records to reduce single-source blind spots.
• Nonlinear Dependence Screen — Runs form-agnostic dependence statistics to catch relationships a linear or rank coefficient scores as near-zero, so real structure isn't dismissed as no-relationship.
• Omission Pattern Analysis — Reads a body of surviving output against the space of what could have appeared, cataloguing the topics, sources, and viewpoints that go missing or converge — in a systematic, not random, pattern.
• Organizational Rollup — Rolls individual work, risk, or metrics up the responsibility hierarchy so each management level sees an owned summary it can drill back down.
• Output-to-Input Traceback Map — Traces an observed output back through the mapping to the input states compatible with it, naming what the forward projection discarded and how to act while the ambiguity stands.
• Partial-Correlation or Residual Probe — Measures how much of an association survives once you hold other variables fixed, separating a direct link from one that exists only because both variables track a third.
• Permutation Null and Multiplicity Check — Builds a chance baseline by shuffling the pairing and corrects for how many correlations were examined, so the largest coefficient in a big matrix isn't mistaken for a real one.
• Pivotality Counterfactual Matrix — Lays every participant against every relevant scenario in a grid and marks each cell where that participant's presence or absence would flip the outcome — a maintained map of who is pivotal, and when.
• Price Equation Decomposition Table — Lays out every unit's weight and value in both states as a ledger and recomposes the weighted-mean change into an exact selection term plus a transmission term.
• Quorum Sensitivity Table — Tabulates how the outcome and the set of decisive members shift as attendance rises and falls against a quorum threshold — exposing who becomes pivotal, and who becomes decisive simply by staying away.
• Randomized Repetition and Error Amplification — Runs a probabilistic verifier many independent times and combines the verdicts, driving a merely-likely-correct check down to any chosen, arbitrarily small error probability.
• Scenario Ensemble — Tests a candidate decision against a small set of discrete, qualitatively distinct plausible futures to see whether it holds up across all of them.
• Segment Stratification Table — Splits the data into meaningful subgroups and estimates the association within each, so a pattern that holds overall but reverses inside every subgroup — or vice versa — cannot hide.
• Selection–Transmission Sensitivity Analysis — Re-runs the selection–transmission split under alternative windows, unit definitions, and weighting schemes to report how stable the verdict is before it drives a decision.
• Sensitivity-to-Mapping-Change Review — Perturbs the mapping, threshold, or parameters and watches which inputs enter or leave the preimage, exposing how fragile the set is and warning downstream users where it will move.
• Shapley–Shubik Power Index — Scores each participant's a priori voting power as the share of all coalition orderings in which they are the pivot who tips the group past the winning threshold.
• Simulation Ensemble — Runs many stochastic simulations with perturbed inputs to reveal the distribution of outcomes and their sensitivity to assumptions.
• Spatial or Regional Aggregation — Groups locations into regions or zones so geographic patterns become visible, while guarding against masking local variation and boundary artifacts.
• Stakeholder Power–Interest Matrix — Plots each stakeholder on a two-by-two of how much power they hold against how much they care, so engagement effort is aimed where both run high.
• Summary Statistics — Compresses many observations of one variable into a few descriptive numbers — center, spread, and extremes — that stand in for the whole set.
• Supervision Ratio Model — Derives the target ratio of overseers to supervised units by measuring oversight load and adjusting the baseline for complexity and risk.
• Temporal Rollup — Aggregates timestamped events into periods — hours, days, quarters, seasons — at a grain that matches the decision, while preserving the spikes that matter.
• Tree Reduction — Combines partial summaries up a balanced tree so a long serial fold collapses into a logarithmic-depth parallel reduction, folding empty branches through a defined identity.
• Variance Decomposition Table — Splits the spread hidden beneath an equilibrium into named sources — within-group, between-group, temporal, measurement — so you can see what kind of heterogeneity it is.
• Weight-Sweep Sensitivity Table — Re-runs an existing composite score across a plausible range of weights and records where the ranking holds and where it flips.
• Weighted Moment Accumulator — Carries count, weighted sum, and higher moments as sufficient statistics so means and variances merge exactly across any grouping, avoiding average-of-averages bias through a numerically stable combine.
• Weighted Voting Simulation — Encodes the actual weighted decision rule and runs it across many coalition and quorum scenarios to reveal how outcomes hinge on the threshold — and how far real decisive power diverges from nominal vote weight.
• Within-Unit Change Assay — Measures the transmission channel directly by pairing each continuing unit's before and after value and averaging the within-unit change, ignoring composition entirely.

Alignment & Incentives

Solutions that make individual choices, rewards, responsibilities, or local objectives support a larger goal instead of working against it.

13 mechanisms · View full solution family

• Backcasting from Purpose — Fixes the desired end state and works backward from the future to build the pathway of means and milestones that would have to be true to reach it.
• Barrier Decomposition — Splits one undifferentiated wall of avoidance into typed drivers — risk, cost, effort, capability, identity, social exposure — so each gets the treatment it actually needs.
• Center-Surround Filter — Re-expresses every location as its own activation minus a weighted average of its surround, so uniform regions cancel and only edges survive.
• Chokepoint or Gateway Analysis — Identifies positions through which many flows, decisions, routes, or dependencies must pass.
• Co-Occurrence Weighting Pipeline — Counts how often units appear together inside a defined window and re-weights the raw tallies so that frequency artifacts don't masquerade as meaningful association.
• Counterfactual Welfare Comparison — Compares the proposed intervention to credible alternatives and the no-action path, separating actual distributional change from baseline choice.
• Interior-Lines Route Model — Compares travel, communication, coordination, or redeployment times from central versus peripheral positions.
• Market Entry Positioning Matrix — Compares entry points by reach, defensibility, switching cost, channel access, timing, and adjacency to future options.
• Network Centrality Analysis — Computes whether a node has reach, brokerage, shortest-path, hub, or bridge value inside a network.
• Outcome-Driven Design — Fixes the beneficiary's desired outcome first, then judges every design choice by how much it contributes to that outcome rather than by feature appeal or convention.
• Overton-Window Position Scan — Maps currently sayable policy or discourse positions and identifies structurally advantaged locations for advocacy or coalition formation.
• Rumor and Amplification Trace — Maps where a blame story is spreading and which channels are amplifying it, separating the social pressure system from the causal facts.
• Value-Weight Sensitivity Analysis — Varies welfare weights, thresholds, and discount assumptions to test whether the decision remains acceptable under reasonable normative alternatives.

Allocation & Prioritization

Solutions that distribute scarce attention, effort, money, capacity, or opportunity among competing claims and make the order of service explicit.

5 mechanisms · View full solution family

• Contribution Net-Value Review — Weighs a contribution's expected benefit against its full lifetime coordination cost to judge whether it is genuinely net-additive — and recommends accept, reshape, redirect, defer, or decline.
• Derived Eligibility or Status Answer — Answers the consumer's actual question with a computed predicate or status — 'meets the income threshold: yes' — returned live in place of the underlying record, so the source releases a conclusion instead of the data behind it.
• Duty-Priority and Harm Comparison — Compares authority, nonwaivable duties, affected-party harm, reversibility, and delay under each priority.
• Layer-Placement Fitness Check — Scores each candidate layer against the requirement it would have to own — variety, expressiveness, security, lifecycle cost, governance — and names the layer that can carry the capability well.
• Simultaneous Feasibility and Capacity Test — Compares time, timing, attention, competence, authority, and resources under realistic peaks.

Anticipation & Forecasting

Solutions that look ahead, surface plausible futures, identify leading indicators, or prepare options before a consequential state arrives.

17 mechanisms · View full solution family

• Adoption Bottleneck Mapping — Enumerates and sequences the concrete integration, training, procurement, trust, standards, and regulatory frictions that gate near-term impact — and attaches a watch-trigger to each.
• Compounding Trajectory Modeling — Projects how a small early change could accumulate over long horizons through reinforcing loops — cost-decline learning, network effects, standardization, and complementary innovation — as a nonlinear curve, not a straight line.
• Credit Assignment Trace — Traces a delayed outcome back to the specific earlier cue or action that actually earned it, over the right time window, so the credit lands on the true cause and not on whatever happened to be nearby.
• Decision–Execution Lead-Time and Margin Calculation — Subtracts observation, deliberation, authorization, mobilization, execution, stabilization, verification, and uncertainty margin from scenario closure.
• Disruption Trajectory Map — Plots the incumbent and entrant value curves on the axis customers actually buy on, and marks where — and under what assumptions — the entrant is hypothesized to cross into good-enough.
• Forward-Model Prediction — Computes, from a standing model of the system plus the current context, the exact observation the system's own action should produce this cycle.
• Interaction Term Construction — Manufactures combined features — products, ratios, or conditionals of two or more raw inputs — to expose a joint effect that neither input reveals alone.
• Lag & Window Feature Extraction — Collapses an event or sensor stream into decision-time summaries — lags, rolling averages, counts over a trailing window — using only information available at the moment of prediction.
• Offset-Adjusted Impact Evaluation — Judges the intervention on the effect that survives anticipatory offset — specifying the intended net effect up front and evaluating realized outcomes against it after subtracting what targets pre-empted or displaced.
• Pre-Implementation Response Simulation — Projects, before launch, how forward-looking targets will adjust — building the offset counterfactual and segmenting targets by their capacity to respond — so the plan's expected effect is discounted for pre-emption.
• Precision-Weighting Update Rule — Sets the gain on each incoming signal in proportion to its estimated reliability, so precise evidence moves the system and noisy evidence is discounted.
• Precommitment What-If Simulation — Before committing, runs the candidate action across a library of hypothetical scenarios and compares the predicted gap in each, so the choice is stress-tested against a range of futures rather than a single forecast.
• Predictive Scheduling Rule — Sets the timing and sequence of a planned action from a forecast, so its effect lands inside the target envelope when the disturbance arrives — the schedule is pre-shaped, not reacted into.
• Reference-Class Forecasting Workbook — A step-by-step worksheet that defines the forecast object, selects a comparable class, and pulls the estimate toward that class's actual outcome distribution by a documented adjustment.
• Reversal-Cost and Feasibility-Curve Estimation — Estimates full reversal cost, duration, capacity, completion probability, residual damage, and burden across time and scenarios.
• Temporal-Difference Update Rule — Updates an estimate from the gap between successive predictions — bootstrapping off the next step rather than waiting for the final outcome — and propagates that error back across the delay.
• Three-Point Estimate with Base Rates — Replaces a single-number estimate with an optimistic, most-likely, and pessimistic triad in which the likely and pessimistic legs are pulled to comparable-case base rates.

Attention, Salience & Focus

Solutions that direct limited attention toward what matters, protect focus from interference, or deliberately change what becomes noticeable.

12 mechanisms · View full solution family

• Benchmark Comparison — Places a focal case next to a reference case or peer set so relative standing, gaps, or outliers can be interpreted.
• Blocked Dependency Trace — Follows one stalled ticket, request, or negotiation hop by hop through what each party is waiting on, until the trail loops back and reveals the circular wait hiding across teams.
• Decay Curve Fitting — Fits delayed-probe observations to a practical decay curve and half-life, turning scattered readings into a timing model good enough to act on.
• Decay Segment Comparison — Contrasts decay curves across cohorts to reveal who fades fastest and why, so timing is not set by a misleading population average.
• Dependency Conflict Detection — Identifies software, infrastructure, or workflow dependencies that cannot safely be combined because versions, resource assumptions, or side effects conflict.
• Paired Case Comparison — Uses two or more matched real cases with an explicit frame so an analyst can infer a relation across cases.
• Policy Package Design — Combines rules, incentives, investments, enforcement, and supports so policy elements address one another’s gaps and side effects.
• Safe-State Admission Check — Evaluates whether admitting a new task, transaction, customer, claim, or process keeps the system in a state with at least one feasible completion sequence.
• Salience-Significance Matrix — Scores each item twice — how much attention it grabs and how much it actually matters — so the loud-but-trivial and the quiet-but-critical sort into different corners.
• Sample Frame Reconstruction — Rebuilds the population and the selection filter a visible sample was drawn through, so 'the cases I can see' stops standing in for 'the cases that matter.'
• Treatment Interaction Analysis — A method for evaluating whether an intervention's effect changes under different co-treatments, conditions, populations, or moderators.
• Wait-For Graph Analysis — Draws every participant as a node and every 'is waiting for' as a directed edge, then finds the cycle that proves the system is deadlocked and marks where it must be cut.

Boundary & Scope Control

Solutions that define, move, or police what is inside a problem, system, role, claim, or responsibility and what remains outside it.

17 mechanisms · View full solution family

• Binning and Discretization Scheme — Converts a continuous variable into a fixed set of ordered intervals by choosing, as a reusable rule, how many bins to cut and where their edges fall.
• Boundary Sensitivity Analysis — Perturbs each cutpoint by plausible amounts and counts how many cases — and how much downstream consequence — flip, exposing where a boundary is fragile.
• Category-Predicate Separation — Breaks a challenged universal claim into its quantifier, subject category, and asserted property so membership can be judged separately from the property in dispute.
• Change-Point Segmentation — Places segment boundaries where an ordered signal statistically shifts — a change in mean, variance, or rate — so cuts fall at the data's own joints rather than at chosen values.
• Clustering-to-Boundary Workflow — Turns exploratory clusters into an operational segmentation by naming the groups, stabilizing them, and translating fuzzy membership into a reproducible boundary rule.
• Conservative Estimate — Deliberately biases the input assumptions — load high, yield low, schedule long — so the estimate itself carries hidden headroom against being wrong.
• Effective Configuration Diff — Computes the fully-resolved effective settings for a node and labels each value with where it came from, so you can see what was inherited versus overridden locally.
• Image-Region Segmentation Pipeline — Derives candidate region boundaries directly from image data — modeling the pixel field and letting empirical contrast, texture, and learned features propose where the seams fall.
• Lifecycle Assessment — Extends the accounting boundary across a product's whole life — extraction, production, use, and end-of-life — so burdens hidden in one stage cannot be quietly optimized into another.
• Lineage Impact Analysis Report — Traces a proposed ancestor change forward to every descendant it would touch, so the blast radius — and the inherited risks it disturbs — is known before the change ships.
• Material-Fact Comparison Matrix — Compares the current and prior cases on rationale-linked factual dimensions and records which differences are material and which are not.
• Nested Quantifier Parse — Parses a multi-quantifier claim into an explicit quantifier order so ∀∃ is never read as ∃∀.
• Score-Banding Model — Groups an ordered score into a small set of named, meaningful bands — deciding how many bands the decision can sustain and what each band is actually allowed to claim.
• Source–Target Mapping Note — A working ledger that maps each source feature to 'transfers / does not transfer,' recording which resemblances a comparison invites and which it must fence off — and which rival sources were rejected.
• Stress-Test Margin Check — Applies simulated and historical adverse scenarios to an already-designed margin to check whether it actually survives the cases it is meant to cover.
• Structural Safety Factor — Multiplies the expected load by a deliberate factor to set an allowable limit well below the failure point, so ordinary uncertainty and variation never reach it.
• Whole-System Problem Definition — Replaces a local symptom with a statement of the interdependent whole that produces it, so the problem is defined at the scale where its causes actually live.

Buffering & Reserves

Solutions that absorb variability, delay, shocks, or temporary imbalance through slack, queues, inventories, reserves, or intermediate storage.

35 mechanisms · View full solution family

• Actuarial Pool-Size Model — Solves a closed-form actuarial formula for the smallest independent-exposure count at which aggregate claim volatility falls to the pool's stated stabilization target.
• Administrative Break-Even Calculator — Weighs the pool's fixed and variable running costs against its expected volatility-reduction benefit to find the membership below which overhead eats the gain.
• Age-Weighted Value Score — Collapses many keep-or-expire signals into one comparable number per layer by discounting each layer's standing value along a decay curve tied to its age.
• Capacity-Aware Dispatch Optimizer — Recommends which reserve unit to commit to which competing front by scoring front priority, response windows, route time, compatibility, local-cover floors, and turnaround into a ranked deployment — while leaving the commit to a human.
• Claims Experience Credibility Analysis — Measures how much weight the pool's own loss history can bear versus an external benchmark, and revises the threshold only once experience becomes statistically credible.
• Cohort or Vintage Analysis — Compares entering groups by common start period, design, supplier, policy, or exposure at equivalent maturity.
• Contribution Waterfall Decomposition — Reconciles aggregate change to legacy stock, entering contribution, exits, mix, price, base, and residual effects.
• Copula Tail-Dependence Check — Models whether extreme losses co-occur more often than average correlation suggests, by fitting the pool's joint tail separately from its individual margins.
• Crossover Scenario Projection — Projects a conditional range for aggregate flattening, convergence, or reversal under alternative contribution and turnover scenarios.
• Decay-Curve Fit and Half-Life Estimate — Fits observed strength across time or distance to a decay model, reporting the half-life, regime changes, uncertainty, and the predicted point where strength crosses the usable threshold.
• Demand Segmentation ABC/XYZ Matrix — Classifies every item by volume and by demand variability, so each class can be given its own push-pull posture instead of one averaged forecast.
• Dependency Tree Static Analysis — Resolves the full transitive dependency graph of an inherited codebase from its manifests — without running it — to expose the layers of borrowed code the project rests on but never wrote.
• Diversification Ratio Calculation — Compares aggregate pool risk with the sum or average of standalone risks, collapsing 'is this pool really diversified?' into one number — and the effective count of independent bets behind it.
• Exposure Accumulation Map — Maps concentration in geography, technology, supplier, factor, or shock source by tallying total pooled exposure behind each shared feature until hidden single points surface.
• Extreme-Value Threshold Model — Fits a separate model to the exceedances above a high threshold, so the extreme layer is described on its own terms rather than by whatever curve fits the bulk.
• First-Difference or Derivative Estimate — Estimates directional change from discrete differences or a continuous derivative approximation.
• Fraud Risk Decay Model — Estimates how the probability of fraud or misuse for a flagged actor falls over time and events, producing a projected decay curve with a confidence band per risk class.
• Heavy-Tail Simulation Scenario Set — Runs Monte-Carlo simulation under deliberately fat-tailed, correlated assumptions so the model actually produces the rare catastrophes that thin-tailed sampling almost never draws.
• Lead-Time / Inventory Trade-off Curve — Plots inventory cost against achievable lead time for each candidate boundary, exposing the real price of speed.
• Max-Flow Analysis — Computes the greatest volume that can move from source to sink under edge capacities, and names the min-cut — the saturated links whose combined limit sets the ceiling.
• Min-Cost Flow Model — Routes a required flow from supplies to demands at least total cost, choosing the cheapest feasible allocation over a capacitated network subject to conservation.
• Monte Carlo Pool Simulation — Draws thousands of synthetic loss histories with correlation built into the generator to find the pool size at which the target still holds once exposures are allowed to move together.
• Multi-Commodity Flow Model — Represents several distinct flow classes over one shared network — each with its own sources and sinks — coupled only where they compete for the same edge capacity.
• Postponement Strategy Matrix — Evaluates how far final differentiation can be delayed, choosing the latest-useful generic intermediate and the step to postpone.
• Rare-Event or Importance Sampling — Deliberately oversamples the rare, high-consequence region and re-weights the draws, so a simulation actually observes the tail instead of almost never drawing it.
• Relay and Repeater Placement Model — Places intermediate renewal points along a route to cover weak regions while minimizing handoff count, latency, cost, and correlated failure.
• Reservoir Mapping Review — Maps where a system's retained load enters, settles, concentrates, and eventually surfaces — turning a diffuse buildup into a named set of reservoirs, sources, and interactions you can act on.
• Retrospective Synthesis — Distills many incidents or episodes into a small set of recurring patterns and forward commitments — deliberately letting individual detail recede within a loss budget, while reviewing whose cases get represented so the lessons are not skewed.
• Reverse Stress Test — Fixes the failure as a given — 'assume we have already broken' — and searches backward for the scenarios and hidden thresholds that would produce it, catching fragilities forward planning never imagines.
• Rolling Marginal-Contribution Curve — Estimates leading-edge direction by smoothing a declared sequence of entering units, cohorts, or periods.
• Stress Test and Reverse Stress Test — Runs the system against severe tail scenarios to check it survives — then runs the logic backwards to find the smallest scenario that would break it.
• Stress-Correlation Scenario — Re-estimates pooling benefit under crisis-state co-movement by positing a common shock and rewriting the pool's correlations to the ones that shock would impose.
• Tail-Index Estimation — Estimates how fast the tail decays — the tail index — telling you how heavy the tail is and, crucially, which moments (mean, variance) are even finite.
• Traffic Assignment Model — Predicts how trips spread across a road or transit network by modeling travelers who each choose their own fastest route, until no one can gain by switching — a user equilibrium.
• Travel-Time Matrix — Tabulates the full response time from each candidate reserve location to each front under normal, degraded, and surge conditions, turning 'centrally positioned' from a claim on a map into a checkable number.

Calibration & Tuning

Solutions that compare behavior with a reference and adjust parameters, thresholds, mappings, or tolerances until performance falls within an acceptable range.

39 mechanisms · View full solution family

• Allometric Normalization Table — Divides a raw metric by a reference size raised to the scaling exponent so entities of very different sizes land on one comparable, size-neutral index.
• Breakpoint Sensitivity Sweep — Scans across size to find where the exponent changes, marking the breakpoints and the range within which a single scaling law can be trusted.
• Capacity Planning Model — Translates a forecast of future demand into the servers, staff, budget, and review capacity it will require, against known limits and a deliberate buffer.
• Convergence or Asymptotic Behavior Check — Watches the correction terms as orders are added to tell an expansion that is homing in from one that is only asymptotic — and finds the order where truncation is optimal.
• Coordination Cost Modeling — Estimates how communication, sync, and approval burden grows as actors and dependencies multiply — often super-linearly with pairwise ties, not linearly with headcount.
• Counterfactual Value-Delta Table — Pairs each plausible nearby alternative with the signed value difference from what actually happened, so magnitude and polarity are explicit rather than assumed.
• Cross-Scale Benchmark Panel — Assembles a like-for-like population spanning many sizes and ranks it on a size-adjusted metric using an imported scaling exponent.
• Delta Term Isolation — Names the exact departures between the real target and the chosen baseline, turning 'it's more complicated than that' into an explicit, labeled set of perturbation terms — each tagged by the symmetry it breaks or preserves.
• Diagnostic Threshold Calibration — Sets a clinical test's cutoff by weighing a missed diagnosis against the harms of over-testing, with the disease's prevalence in the screened population front and center.
• Drill-Down Root Signal Review — Starts from an aggregate shift and traces it downward, level by level, to the local signals that account for it — owned by someone accountable for the read.
• Ecological Disturbance Mapping — Maps how a local ecological disturbance spreads through habitat connectivity and seasonal timing until it tips a larger system into a new regime.
• Financial Contagion Tracing — Follows stress hopping node-to-node along counterparty and confidence links to find where a circuit-breaker or backstop cuts the chain.
• Finite-Sample or Exact Interval Check — Replaces an asymptotic interval formula with an exact or small-sample-corrected construction that provably honors the nominal level at finite n, and compares the two side by side.
• First-Order Correction Pass — Computes the single leading correction to the baseline — the linear-response term that captures most of the departure at least cost — and folds it back into a first improved answer.
• Incident Blast-Radius Analysis — Bounds the set of users, services, and regions a live incident is actually reaching right now, so responders contain the right thing instead of the whole system.
• Individual / Team / Organization Level Selection — Walks a problem down the nested organizational ladder — individual, team, unit, enterprise — to find the level where the cause is generated and leverage is tractable.
• Infrastructure Cascade Analysis — Traces how a single infrastructure fault cascades through engineered functional dependencies, where the failure front stops, and where islanding cuts it off.
• Infrastructure-vs-Behavior Intervention Comparison — Puts changing the person beside changing the environment for the same problem, comparing each option's causal pathway and time lag.
• Leverage-Point Screening Matrix — Scores each candidate scale of action on fixed criteria — leverage, feasibility, latency, evidence — and ranks them, handing the shortlist to whoever makes the call.
• Log-Log Regression Fit — Fits a straight line to size and response on log-log axes so the slope reads off the scaling exponent and its uncertainty from cross-scale data.
• Log-Log Scaling Check — Estimates a scaling exponent empirically by regressing log against log across orders of magnitude, and flags where the straight line bends.
• Marketing Spend Response Curve — Fits a saturation curve to spend-versus-response data to find the band where extra budget starts reaching un-receptive audiences.
• Near-Miss Distance Scorecard — Scores how close an actual case came to a value-changing alternative across named proximity dimensions, anchored to the factual outcome record.
• Nonparametric Resampling Interval Check — Reuses the observed sample itself — via bootstrap, permutation, or jackknife — to build a benchmark interval that assumes no parametric model, then compares the closed-form interval against it.
• Policy Intensity Band — Sets policy strength within an effective and legitimate range.
• Proximity Signal Backtest — Checks against history whether past near-miss proximity signals actually foreshadowed later harm, learning, or improvement, and recalibrates the signal that did not.
• Queueing Simulation — Models arrivals, service times, and capacity to predict how waiting time and backlog explode as utilization approaches its limit — capturing the effect of variability, not just averages.
• Reference Class Comparison — Anchors a specific case's confidence to the observed base rate of a comparison population of similar past cases, correcting an inside-view heuristic toward the outside view.
• Reliability Diagram or Calibration Curve — Plots stated confidence against observed frequency across a holdout set as a single curve, so the shape and direction of miscalibration are visible at a glance.
• ROC or Precision–Recall Threshold Review — Charts a model's whole false-positive/false-negative frontier across every candidate cutoff, then selects and monitors an operating point once an external cost judgment says which error is worse.
• Rolling Window Comparison — Quantifies how much the target, state, and error distributions have drifted by comparing a recent window against earlier ones — turning gradual staleness into a measured magnitude rather than a yes/no event.
• Simulation Rescaling Sweep — Runs a model across a planned range of scales to hunt for curvature, thresholds, and saturation before anything is built or deployed at full scale.
• Staffing Marginal Output Analysis — Estimates whether the next hire, shift, or coordination layer still adds more throughput than the coordination overhead it drags in.
• Stratified Rollup Analysis — Summarizes upward while keeping strata intact and each stratum's own baseline attached, so an aggregate cannot hide a vulnerable subgroup or a fattening tail.
• Subgroup Coverage Calibration Table — A table that reports nominal versus realized coverage broken out by subgroup, site, period, or risk stratum, so local undercoverage cannot hide inside a healthy overall average.
• Successive-Order Refinement — Climbs the correction ladder order by order, recomposing baseline plus accumulated terms and stopping when the residual falls inside its error budget — or when adding orders stops paying.
• Supply-Chain Shock Analysis — Follows a disruption at one supplier, route, or node through inventory buffers and replenishment lead times to the moment it becomes a wider shortage.
• Systemic Risk Tracing — Traces how a local exposure turns system-wide not by traveling but through correlated exposure and concentration — many actors quietly sharing one fragility that fails all at once.
• Validity Boundary Scan — Sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.

Causal Diagnosis

Solutions that distinguish symptoms from causes, compare explanations, localize a fault, or identify the intervention point responsible for an outcome.

6 mechanisms · View full solution family

• Counterfactual Sensitivity Probe — Removes, delays, or intensifies each factor in turn and asks whether the outcome would still hold, ranking causes by how much the result depends on them.
• Influence and Leverage Diagnostic — Finds the individual observations whose presence most changes the fitted model — high-leverage, high-influence points — so a result resting on a handful of rows is exposed before it's trusted.
• Multicausal Factor Matrix — Lays every candidate cause into one grid — a row per factor, columns for family, scale, role, and weight — so the whole causal field can be compared at a glance.
• Posterior-Predictive Residual Check — Simulates replicated datasets from the fitted model and asks whether the observed residuals look like data the model itself would produce.
• Quantile-Quantile Residual Check — Plots ordered residuals against the quantiles of their assumed distribution, turning wrong tails and skew into a telltale bent line.
• Residual-versus-Fitted Plot — Plots each residual against the model's fitted value (or a predictor) so leftover curvature and changing spread show up as visible shape.

Classification & Taxonomy

Solutions that sort cases into meaningful classes, establish membership criteria, or organize concepts so distinctions can guide action.

3 mechanisms · View full solution family

• Edge-Case Analysis — Works a corpus of hard, borderline, and novel cases to expose where a category boundary is arbitrary, underspecified, or out of step with what the category is for.
• Feature Pyramid or Hierarchical Model — Represents input at multiple levels of resolution so broad structure and fine detail can be processed in order.
• Prototype Embedding Map — Projects examples into a spatial map so the category's center, its multiple sub-clusters, and how membership thins toward the edges become visible at a glance.

Communication & Signaling

Solutions that convey meaning, intent, state, or credibility across people or systems while accounting for interpretation, noise, and strategic response.

6 mechanisms · View full solution family

• Alternative-Metaphor and Countermetaphor Comparison — Compares candidate source frames and literal accounts on understanding options values emotion and decisions.
• Effect-Chain Tracing — Follows an utterance's consequences forward as a causal chain — immediate reaction to downstream behavior to lasting consequence — and marks where the effect that actually landed diverged from the effect the speaker sought.
• Layer Separation Reframing — Reframes a disputed utterance from one fused verdict into separate questions — what the words said and what act they performed on a preserved record — so each layer can be judged on its own terms instead of collapsed into a single yes-or-no.
• Literal Content Parsing — Splits a message into what it literally asserts or asks and what it merely presupposes, so the presupposition surfaces as a claim in its own right instead of riding in unexamined.
• Morphological Option Matrix — Splits the problem into independent design dimensions, lists the values each can take, and crosses them into a grid of whole-solution combinations the original frame never enumerated.
• Source–Target Structure and Correspondence Matrix — Aligns objects relations processes forces roles scales constraints evidence and confidence.

Comparison & Evaluation

Solutions that place alternatives, cases, or outcomes against shared criteria so differences become visible and judgments become defensible.

11 mechanisms · View full solution family

• Alternative-Benchmark Sensitivity Grid — A grid comparing conclusions across plausible benchmarks, factor sets, horizons, or reference populations.
• Before/After Analysis — Distinguishes a changed state from its prior state by holding the earlier condition as a baseline and reading the difference the intervening change actually made.
• Benchmark Attribution Report — A report that decomposes raw performance into benchmark return, exposure effect, residual effect, and unexplained noise.
• Case-Mix Risk Stratification Table — A table or dashboard that groups cases by baseline severity or exposure before comparing outcomes.
• Deviation Residual Table — Displays the predicted or expected pattern against the observed case evidence so the magnitude and type of deviation are explicit.
• Fairness-Standard Comparison Table — Applies candidate standards to the same decision and displays reasons, winners, burdens, conflicts, and uncertainty.
• Multi-Factor Performance Model — A model that estimates expected performance from multiple risk exposures and treats residual performance as candidate abnormal performance.
• Omitted Variable Probe — Searches for variables, mechanisms, constraints, or contextual features absent from the original explanatory frame.
• Precedent Analysis — Lines a current case up against specific prior decided cases and asks whether it is relevantly like them — so a decision rests on 'we handled the last one this way and nothing relevant has changed,' or an explicit, defensible distinction.
• Product or Option Comparison Matrix — Scores the available options against the features, costs, risks, and fit conditions that actually matter to this decision, so a choice among many becomes defensible.
• Style-, Sector-, or Case-Matched Benchmark — A benchmark constructed from comparators matched to style, sector, case mix, mandate, or exposure profile.

Compression & Simplification

Solutions that reduce complexity, detail, or dimensionality while retaining the structure needed for the current decision or task.

38 mechanisms · View full solution family

• Aggregation Rules — Combines multiple variables into a composite value, category, score, or state so decisions are made over fewer dimensions.
• Baseline Model — Provides a simple initial model used as the reference point for later refinements, comparisons, and failure analysis.
• Capacity Forecast — Converts a forecast of future load into the resource capacity it will require, then starts the long-lead provisioning so the capacity is in place before the peak arrives.
• Confidence Interval — Replaces a single exact-looking estimate with a range produced by a stated procedure, so the sampling uncertainty around the number travels with the number instead of being rounded away.
• Context Segmentation — Cuts a pooled dataset along chosen conditions — site, channel, cohort, time — at a deliberately chosen granularity, so variation hidden inside the average becomes visible per slice.
• Cumulative Contribution Curve — Plots how fast the outcome accumulates across ranked contributors, exposing the knee where the vital few give way to the trivial many.
• Defect-Cause Prioritization — Sorts defects and failures by cause so improvement starts with the handful of causes behind most of the rework — then re-ranks once they are fixed.
• Demand Forecasting — Estimates how much of something will be demanded in a future period by decomposing demand into its drivers, and re-runs the estimate each cycle as fresh actuals arrive.
• Dimensionality Reduction — Dimensionality reduction reduces variables or features; coarse-graining groups elements into higher-level units and preserves inter-unit behavior.
• Embedding Projection — Maps complex objects into a dense low-dimensional vector space where geometric proximity encodes similarity, so retrieval, clustering, and neighborhood search become usable — at the cost of axes no one can read individually.
• Exploratory Data Analysis — Opens an unfamiliar dataset with plots, summaries, and transformations to reveal its distribution shape, clusters, and outliers before any model or hypothesis is imposed.
• Feature Clustering — Groups variables that move together into a handful of modules and lets one representative stand in for each group, shrinking a redundant column space without inventing new axes.
• First-Principles Model — Builds the initial model from fundamental relations, constraints, or causal claims rather than from accumulated details.
• Forecast Range — Communicates a future estimate as a range or a small set of scenarios rather than one point number — carrying the assumptions the range depends on and the triggers that mark when it has gone stale — so nobody plans against a single guess about an unknowable future.
• Mathematical Idealization — Represents a real situation using simplified variables and relations so reasoning or calculation becomes possible.
• Mesoscale Simulation — Models intermediate units — cells, cohorts, corridors, patches — where behavior lives that both micro-detail and macro-averages miss, and runs them forward to check it.
• Minimum Description Length Penalty — Scores competing models by their total description length — the bits to encode the model plus the bits to encode its residual error — and selects the most compressive, so added machinery must pay for itself in fit.
• Model Calibration Increment — Adds calibration detail only when model error or decision sensitivity justifies the additional parameter, dataset, or fitting effort.
• Multi-Method Porometry — Estimates pore-size distribution, accessible volume, throat sizes, and surface area by triangulating complementary probes — each biased differently — instead of trusting any single instrument's number.
• Organizational Unit Model — Represents an organization at the team-or-unit scale so coordination behavior that individual logs and company averages both hide becomes visible.
• Policy-Scale Analysis — Reasons at population or institutional scale for public decisions while validating that the aggregate does not erase subgroup harms, escalating to finer review where it might.
• Probability Estimate — States the likelihood of a specific outcome as an explicit probability — and, crucially, exposes that number to being scored against what actually happens, so a forecaster's confidence can be checked for calibration rather than taken on faith.
• Problem Abstraction — Restates a messy problem in terms of the essential variables, constraints, and relations that matter for solving it.
• Reference-Class Forecast — Forecasts a case by locating the class of comparable past cases and reading their actual outcome distribution, replacing the optimistic inside view with a base rate drawn from how similar efforts really turned out.
• Root-Cause Variation Mapping — Traces observed variation back to its candidate physical and process sources and judges which are controllable, so the team learns whether the spread is even addressable.
• Sensitivity Check — Varies the variables a simplification fixed or dropped to see whether the decision it supports actually changes — separating omissions that are harmless from ones that are decision-critical.
• Simple Baseline Model — Provides a low-complexity model or design that more complex candidates must outperform or justify exceeding.
• Simulation Refinement Ladder — Adds simulation detail in layers, such as finer resolution, stochastic effects, heterogeneity, spatial structure, feedback, or operational constraints.
• Staged Simulation Validation — Validates a simulation one refinement at a time — each resolution increase, added coupling, or expanded parameter set must reproduce the coarser model where it was valid, fit the compute budget, and prove its regime of validity before it is accepted.
• Stripped-Down Simulation — Simulates the central relationship with minimal variables before adding heterogeneity, stochasticity, spatial detail, or full operational realism.
• Subgroup Analysis — Tests whether an apparent between-group difference is real enough — by evidence bar, sample adequacy, and governance — to treat as structure rather than an artifact of small numbers.
• Summary Index Construction — Combines many indicators into a single defensible score by normalizing them to a common scale and applying a transparent, contestable weighting — trading drill-down for one number people can rank and act on.
• Tomographic Pore-Network Imaging — Reconstructs the real three-dimensional void network from X-ray slices — actual connectivity, constrictions, and dead ends — instead of trusting a bulk average.
• Top-Driver Analysis — Ranks the causes or segments behind an outcome and tests which of the top few are actually worth intervening on.
• Topology Optimization for Void Placement — Computes where material must stay and where it can become void, searching layouts that hit the functional targets at least mass while keeping the load path intact.
• Toy Model — Uses an intentionally simplified model to reveal the main dynamics before realistic complications are introduced.
• Trend Projection — Extends an observed pattern in a single series forward over a horizon, carrying a band that widens with distance, to answer where a quantity is heading if its recent behavior continues.
• Variance Analysis — Decomposes total spread into its named sources so effort targets the variation that actually dominates, not the variation that is merely loudest.

Constraints & Guardrails

Solutions that prevent unacceptable states or actions by encoding limits, invariants, preconditions, safe envelopes, or error-proofing rules.

19 mechanisms · View full solution family

• Access Dependency Heat Map — Ranks who is most exposed to an access tie — high dependence, few substitutes — so scrutiny, remedies, and unbundling effort land where refusal is least free.
• Algorithmic Relaxation — Relaxes exact optimization or constraint satisfaction so a usable answer can be produced within time, computation, or information limits.
• Analogical Path Transfer — Imports a route structure that already works in another domain, then tests whether the two problems share the deep structure the transfer relies on before adopting it.
• Back-of-Envelope Estimate — Produces a rough calculation quickly by using simplifying assumptions, rounded values, and transparent arithmetic to check scale or feasibility.
• Backward Deadline Pass — Propagates a deadline or milestone constraint backward through a task network to derive local windows and slack.
• Case-Split Elimination Table — Lays the supposition's exhaustive, mutually exclusive cases in a table and drives each row to contradiction, so the negation survives in no case and the claim closes.
• Cut-Set or Separator Analysis — Identifies edges, variables, interfaces, or boundary conditions whose resolution separates the network into subproblems.
• Domain Reduction Pass — Iteratively narrows possible values, options, quantities, or time windows by applying propagated constraints.
• Feasibility Sensitivity Probe — Perturbs the feasibility and cost assumptions to see whether the winning option and its dominance ranking survive — or hang on one fragile estimate.
• Functional Analysis — Identifies what a pattern currently does for different actors or systems, while treating function as an observation rather than proof of intent.
• Institutional Genealogy — Traces how a rule, practice, category, or institution developed over time so current function is not mistaken for original purpose.
• Legal or Regulatory Pathway Search — Classifies which constraints in a rule system are absolute versus procedurally waivable, then finds a legitimate alternative pathway — waiver, exemption, or demonstration route — that respects the rule's purpose.
• Minimal Unsat Core Analysis — Shrinks an unsatisfiable constraint set to a minimal subset whose members truly clash, so the impossibility is pinned to a few named premises rather than blamed on the whole system.
• Rough Order-of-Magnitude Estimate — Approximates by powers of ten or broad scale classes when exact values are unavailable or unnecessary.
• Route-Finding and Topology Search — Maps the network, space, or dependency graph as a topology and searches it for a route around a blocked edge, keeping a fallback path in reserve.
• Sensitivity Probe — Varies key assumptions or inputs to see whether the approximate conclusion changes materially.
• Simplified Simulation — Simulates a reduced version of the system that captures enough behavior to guide the decision.
• Status Quo Costing Sheet — Refuses to treat 'do nothing' as free — prices the status quo as a real option with ongoing costs, residual risks, and forgone value.
• Surrogate Model — Uses a cheaper model to stand in for a more expensive, slower, or inaccessible model while tracking where the substitute is valid.

Containment & Isolation

Solutions that keep faults, hazards, conflicts, contamination, or overload from spreading by separating regions, flows, or responsibilities.

15 mechanisms · View full solution family

• Bayesian Network Markov Blanket Extraction — Reads a target's minimal screening interface straight off a graphical model — its parents, its children, and its children's other parents — so the boundary is derived from structure rather than guessed.
• Causal Loop Diagram — Draws the pressure behind a hazard, the feedback loops that regenerate it, and the delays between them, so a control can be aimed at the loop rather than the symptom it displaces.
• Cross-Subsidy Budget — Makes the transfer from source to sink an explicit line item — how much surplus each source can spare after protecting itself, where it goes, and whether the resulting subsidy is fair — so support is a decision, not a leak.
• Cycle Detection Pass — Finds groups of resources that keep each other alive by mutual reference yet are collectively unreachable — the cycles a reference count can never free.
• D-Separation Walkthrough — Walks the paths of a dependency graph to decide, by the d-separation rules, which variables a candidate boundary screens off — and which colliders would open a path if conditioned on.
• Entry Funnel Abandonment Analysis — Measures where and among whom entrants stall or quit along the crossing path, reading observed step-by-step behavior rather than the process's official design.
• Fault Tree Analysis — Decomposes a single system-level harm downward through logical gates until the transfer path — and the exact boundary where risk crosses out of the controlled unit — becomes explicit.
• Hidden-Variable Sensitivity Analysis — Asks how strong an unobserved variable would have to be to break the blanket's screening-off claim — quantifying the boundary's robustness to the confounders you cannot measure.
• Intervention Displacement Stress Test — A pre-deployment probe that grants the control its local success and asks the harder question — where would the blocked pressure go, who would absorb it, and how long until it surfaces — before you commit.
• Layered Control Matrix — Lays every control against every threat pathway in a grid so open pathways, single points of coverage, and merely-redundant layers become visible at a glance.
• Mass Balance — Applies conservation bookkeeping across a declared boundary so a hazard that 'disappears' from one channel must reappear as an outflow somewhere — and the unaccounted gap localises the leak.
• Metapopulation Model — Runs a network of coupled patches forward from their per-patch birth–death and dispersal rates to forecast whether the whole persists — and which patches are true sources versus occupied-but-doomed sinks.
• Reachability Graph Visualization — Renders the reference graph and its retention paths so a human can see what is keeping a resource alive and why it will not be reclaimed.
• Source–Sink Network Mapping — Maps the target as a network of sources and sinks so the low-contestation node that keeps reseeding the rest can be found and named — not just the biggest visible infestation.
• Structure-Learning Screen — Runs an automated structure-learning pass over the whole variable field to propose a dependency graph and a candidate Markov blanket — a fast first draft of the boundary, not a validated one.

Coordination & Synchronization

Solutions that align interdependent actors, tasks, clocks, states, or handoffs so joint work progresses without collision or drift.

17 mechanisms · View full solution family

• Adverse Selection Pool Segmentation — Sorts a mixed population into risk classes by observable proxies for the hidden type — so a party who can't see each individual's private risk can still price and pool fairly instead of being cream-skimmed by the worst hidden risks.
• Buffer and Float Allocation Model — Decides how much protective slack to place, and where, so variability is absorbed at the points that guard the outcome rather than padded evenly across every task.
• Causal Loop Delay Map — Annotates a feedback-loop diagram with the elapsed delay on each link, so you can see which balancing loop will overshoot or oscillate because its correction lands a cycle late.
• Critical Path Analysis — Finds the longest chain of dependent tasks that fixes the earliest possible finish, so coordination attention is spent on the dependencies that actually move the end date.
• Dependency Network and Critical-Path Map — Maps precedence, float, and alternative paths so the chain of activities that actually governs the finish date — and the slack that does not — becomes visible.
• Lead-Lag Cross-Correlation Analysis — Slides two coupled time series against each other to find the offset at which they best line up, recovering how far one leads or lags the other when neither signal shows the delay on its own.
• Organization–Artifact Topology Overlay — Lays the artifact's dependency map over the collective's communication map on a single frame, so the seams that should coincide but don't — and the ones that needlessly do — stand out.
• Policy Pathway Analysis — Follows one written policy provision downstream — into forms, thresholds, staff discretion, and notices — to show the participant burden it produces on the ground.
• Policy Resistance Map — Maps how a policy intervention changes incentives, expectations, or behavior in ways that push the system back toward the old pattern.
• Root-Cause Loop Analysis — Extends root-cause analysis beyond a one-way chain by asking how the effect feeds back into causes and keeps the problem recurring.
• Scenario or Simulation Testing — Tests whether the mapped loop could plausibly produce the behavior pattern under different assumptions, delays, or intervention choices.
• Sequential-Consistency Trace Protocol — Records the interleaved history of operations and checks it against a single program-order-respecting total order, flagging any execution no such order can explain.
• Social Determinants Mapping — Maps the upstream living conditions — housing, food, transport, work, neighborhood — that shape a downstream outcome, and shows which groups the conditions burden most.
• State-Machine Cycle Detection — Models the coupled actors as one state machine and finds the non-progress cycle in its reachability graph — the exact set of states they keep revisiting.
• Structural Leverage Analysis — Compares candidate intervention points by depth, coupling, amplification, tractability, and risk, and records why one point was chosen over the visible alternatives.
• Systems Harm Analysis — Follows a person or group across the several institutions whose separate rules compound into harm no single agency owns, and asks what the interaction — not any one part — produces.
• Temporal Scenario and Stress Test — Runs a timing design through adverse what-if conditions — surges, stalls, reorderings, desyncs, and overlaps — before deployment, to find where the schedule breaks while breaking it is still cheap.

Cost, Value & Pricing

Solutions that expose economic value, opportunity cost, price, return, or burden so choices reflect what is gained, spent, or displaced.

17 mechanisms · View full solution family

• Barrier Height Estimation — Sizes the activation barrier — the upfront effort and friction that must be paid before a change becomes self-sustaining — so it can be weighed against the payoff.
• Break-Even Activation Model — Prices the activation decision by combining upfront cost, probability of crossing, timing, and post-threshold benefit into an explicit break-even condition.
• Capital Budgeting Comparison — Compares proposed capital uses against the next-best use of funds, capacity, or risk-bearing ability.
• Competing Estimate Simulation — Simulates the whole field of rival estimates to see where the winning bid lands in that distribution — quantifying how much winning implies you overshot, and flagging when correlated information makes the overshoot worse.
• Counterfactual Non-Activation Comparison — Compares activation against delaying, doing nothing, pursuing a lower-barrier alternative, or investing in a different threshold-crossing opportunity.
• Cumulative Volume Cohort Analysis — Groups output into cohorts by cumulative experience and compares them under controlled conditions, so a cost or quality gain can be credited to real learning rather than scale, accounting, or an easier mix of work.
• Discounted Cash-Flow Table — Displays period-by-period flows, discount factors, and present-value contributions.
• Experience Curve Model — Fits the power-law between cumulative volume and unit cost into a single learning rate and a forecast — and flags when the curve is flattening and extrapolation should stop.
• Net Present Value Model — Computes discounted net value for an option from projected time-stamped consequences.
• Policy Alternative Analysis — Requires a policy choice to name the public goods, constituencies, or outcomes displaced by the chosen intervention.
• Real-Options Cross-Check — Tests whether waiting, staging, or preserving reversibility changes the decision.
• Reference-Class Bid Review — Places a pending bid's estimate inside a class of comparable past contests and reads off the base-rate outcome and the typical field of rivals, producing a debiased, outside-view input before any winning-conditional correction.
• Scenario Sensitivity Grid — Shows how conclusions vary across plausible rates, horizons, timing assumptions, or value bases.
• Sensitivity and Scenario Sweep — Tests whether the activation recommendation changes under different assumptions about costs, adoption rate, benefit timing, failure probability, and maintenance burden.
• Shadow Pricing — Imputes a price for a scarce resource or unpriced harm and applies it only inside decisions and plans—never billing anyone—so choices weigh a cost the market does not yet charge.
• Time-and-Motion Study — Decomposes a repeated task into standard, timed work elements so a unit's cost is measured element-by-element — turning a vague sense of slowness into a map of where the seconds actually go.
• Winner's-Curse-Adjusted Bid Model — Computes what a common-value estimate is worth conditional on it having won — the expected value given that yours was the highest bid — and returns a valuation shaded to that corrected figure.

Decomposition & Modularity

Solutions that split a difficult whole into coherent levels, modules, roles, or subproblems that can be understood and changed more independently.

14 mechanisms · View full solution family

• Aggregation Sensitivity Test — Varies the aggregation and bridge-rule assumptions to reveal how much a whole-level result is an artifact of how the parts were combined.
• Bottom-Up Simulation — Executes formalized part states and interaction rules forward to see whether whole-level behavior actually emerges from the bottom up.
• Dimension Weight Sensitivity Panel — Sweeps the weights assigned to each dimension across plausible and stakeholder-specific values, and reports how stable the ranking is — exposing which conclusions are robust and which are artifacts of one weighting.
• Dimensioned Comparison Matrix — Lays comparands out as rows and dimensions as columns, scores every cell on a common scale, and reads a ranking or dominance relation off the completed grid.
• Finite-Element Bending Simulation — Numerically predicts where stress and strain concentrate as a part is bent, so the fold can be seen to pass or crack — with a map of exactly where — before anything is built.
• Interaction Graph Analysis — Maps which parts act on which as a network of nodes and interaction edges, so the relational structure behind a whole-level pattern becomes visible.
• Matched Case Comparison Sheet — Pairs each comparand with a case matched on the background variables you are not interested in, so the surviving difference is attributable to the one factor you are — turning a messy comparison into a near-controlled one.
• Medium Translation Diff — Lays the same content in its source and target media side by side to surface what each medium's constraints add, drop, or distort in the move.
• Mesoscale Simulation / Digital Twin — Builds a mechanistic multi-scale model of the arrangement that predicts macro behavior and lets you perturb structure virtually.
• Multifunction Material Architecture — Tunes a material's bulk composition and microstructure so one material system bears several functions, then models where the composition trade-offs fight each other.
• Porosity & Connectivity Mapping — Maps the void network and its connectivity so the percolation topology that governs transport becomes an explicit, registered feature.
• Remote Pair Correlation Test — Tests whether two distant variables co-move beyond what local dynamics or a common-cause baseline would predict, and labels the result correlation — not proof of a path.
• Statistical Multiplexing Admission Model — Bets that bursty streams rarely peak at the same instant, and computes how many can be admitted onto one channel sized below their combined maximum — with an explicit fallback for the moments the bet loses.
• Structure-Property Matrix — Tabulates which arrangement features drive which macro properties, and how sensitively, into an explicit empirical structure-property lookup.

Decoupling & Interfaces

Solutions that reduce harmful dependency by inserting contracts, adapters, abstractions, or replaceable boundaries between interacting parts.

21 mechanisms · View full solution family

• Abstract Interpretation or Model Checking — Decides a property soundly on a finite abstraction of an otherwise-undecidable system, trading exactness for a guaranteed answer that never misses a real violation.
• Adaptation Delta Mapping — Maps the smallest set of changes that make an inherited feature actually fit its new function — and, just as important, the parts that must be left untouched.
• Bounded-Domain Exhaustive Search — Turns a question that is undecidable in general into a decidable one by fixing a finite bound and mechanically checking every case inside it.
• Computational Complexity Analysis — Once a problem is known solvable in principle, measures how its cost grows with input size to place it in a complexity class and separate the tractable from the merely computable.
• Constructive Algorithm and Correctness Proof — Settles a problem on the decidable side by exhibiting an actual algorithm and proving it both total and correct — the proof and the procedure are one object.
• Diagonalization Impossibility Proof — Proves that no algorithm can decide a class by constructing, from any candidate decider, a self-referential input on which it must be wrong.
• Edge Transect Mapping — Drives a measured line through a single edge to profile how conditions change across it and read off the edge's true width.
• Edge-Effect Impact Assessment — Estimates how far the edge's influence reaches into each interior and what it destroys or creates there, sorted into a ledger of edge risks and opportunities.
• Halting-Problem Reduction — Proves a target problem undecidable by wiring a known-undecidable problem (canonically the halting problem) into it, so effort on a universal solver stops before it starts.
• Hardware or Controller Synthesis — Lowers a behavioural description into a physical or controller realization — gates, an FPGA image, or PLC logic — under hard timing, area, and power constraints set by the target technology.
• Interface-Cost Accounting — A method for separating the real cost of maintaining boundaries from the value those boundaries preserve.
• Many-One Reduction Proof — Transfers a problem's decidability or hardness verdict along a single total computable map that preserves membership, exhibiting the mapping itself as the proof.
• Proof by Counterexample — Refutes an over-broad universal claim — that some method handles an entire class — by exhibiting one well-formed instance on which it demonstrably fails.
• Query-Plan Lowering and Optimization — Lowers a declarative query into a physical execution plan, letting a cost model choose freely among result-equivalent plans — not just a correct plan, the cheap one.
• Refinement-Calculus Derivation — Derives a program from its specification by a chain of small, individually correctness-preserving refinement steps, each licensed by a law of the calculus — so the code is correct by construction.
• Semi-Decision with Explicit Unknown — Runs a sound one-sided recognizer that confirms YES when it can, but returns an explicit UNKNOWN at a declared resource bound instead of looping forever or faking a NO.
• Shadow Displacement Accounting — A counterfactual accounting method that estimates what incumbent activity would have remained without the entrant.
• Theorem-Prover-Guided Search — Uses an automated or interactive prover to search for and mechanically check the proof or certificate a boundary claim rests on, recording the verified guarantee and any open residue.
• Traffic Assignment or Flow Equilibrium Model — A model that compares decentralized path choice with coordinated network performance under capacity scenarios.
• Turing-Reduction Analysis — Asks whether a problem becomes solvable given an oracle for another, placing it among the degrees of relative computability rather than in a flat decidable/undecidable split.
• User Equilibrium vs System Optimum Analysis — A method for measuring whether local choice incentives diverge from whole-network performance.

Deliberation & Conflict Resolution

Solutions that structure disagreement, negotiation, arbitration, or collective judgment so incompatible views can reach a workable resolution.

2 mechanisms · View full solution family

• Multiple-Anchor Comparison — A method for comparing several plausible references so the first anchor does not dominate.
• Structured Forecasting Panel — Uses repeated expert estimates, feedback, and uncertainty summaries to assess future events, timelines, or probabilities.

Diversity & Exploration

Solutions that preserve variety, generate alternatives, widen the search space, or prevent premature convergence on one approach.

9 mechanisms · View full solution family

• Annealing or Perturbation Schedule — Allows controlled temporary worsening or variation injection to cross barriers, then gradually raises convergence pressure so the search settles into a good basin.
• Coarse Landscape Sampling — Samples diverse regions at low resolution before spending evaluation budget on detailed local improvement.
• Cross-Output Cost Attribution Model — Compares separate-production cost with shared-input cost after governance, integration, and exception costs are included.
• Morphological Matrix — Lays the problem out as a grid of independent parameters and their options, then generates ideas by systematically combining across cells.
• Objective Surface Sketch — Creates a visual or tabular approximation of how value changes across candidate configurations so the terrain's gross shape can be seen at a glance.
• Opportunity Landscape Mapping — Charts a newly opened space before you fan into it — confirming the opening is real, mapping its distinct niches, and bounding how widely to branch.
• Parameter Sweep and Sensitivity Grid — Varies key inputs across planned ranges to reveal regions where results are stable, fragile, discontinuous, or high leverage.
• Random Restart Plan — Restarts search from diverse independent initial positions when outcomes are highly path-dependent or local-optimum risk is high, then keeps the best.
• Response Surface Model — Fits an approximate model of objective response across input variables to identify gradients, interactions, and candidate optima at unsampled points.

Emergence & Self-Organization

Solutions that shape local rules, interactions, or environmental cues so useful global order can arise without direct central specification.

13 mechanisms · View full solution family

• Cellular Automata Rule — Implements the archetype in simulation or modeling by assigning each cell a local state-update rule and observing the resulting aggregate pattern.
• Component-Merge Simulation — Simulates candidate additions on a model of the substrate to estimate where the spanning threshold lies, how uncertain it is, and which additions merge the most mass.
• Connected-Component Scan — Applies the functional-connection rule to the current substrate and computes which nodes actually form one component, exposing the true partition into disconnected islands.
• Contradiction Traceback — A procedure for tracing an apparent contradiction back to the self-referential path that generates it.
• Dependency Cut-Set Review — Analyzes the dependency structure to find the minimal set of links whose removal isolates harm, telling you exactly where a breakpoint or safety gate should sit.
• Effective Founder Contribution Analysis — Estimates the realized or expected descendant contribution of founders after unequal reproduction, copying, recruitment, attrition, and network influence.
• Incident Pattern Mining — Analyzes many incidents, near misses, support cases, or complaints to discover system-level patterns no single incident reveals.
• Interaction Matrix Mapping — Lays out constituent types against constituent types in a grid, filling each cell with the rule that governs whether — and how — those two kinds may meet.
• Positive Deviance Inquiry — Locates the local actors who already succeed under the same constraints as everyone else, then reverse-engineers what actually makes their practice work.
• Robot Action-Space Mapping — Maps the actions a robot can actually execute in its environment — reachable, collision-free, within its own limits — so the intended action lies inside the feasible space and the harmful ones fall outside it.
• Task and Capability Analysis — Decomposes the goal into the actions it requires and checks each against what the agent can actually perceive, reach, and do — locating where the task outruns the agent's capability.
• Temporal Contact Scheduling — Makes a network spannable through time by scheduling intermittent contacts so a time-respecting sequence of links carries flow across the whole domain within the deadline — even when the links are never all up at once.
• Weak-Signal Aggregation — Combines small, ambiguous local signals so a faint system-level pattern can become visible before it is obvious.

Error Prevention & Correction

Solutions that remove opportunities for mistakes, detect invalid states, repair deviations, or make failures easier to reverse.

1 mechanism · View full solution family

• Dependency Closure Traversal — Walks the dependency graph outward from a change to compute the transitive set of everything reachable — the affected closure — in an order safe to revalidate in, halting where a stop condition holds.

Evidence, Inference & Validation

Solutions that gather, test, triangulate, or qualify evidence so claims and decisions match what the observations can actually support.

98 mechanisms · View full solution family

• Abnormal-Return / Residual Model — Compares observed returns or outcomes to a baseline model to detect unexplained opportunity after information release.
• Absolute Risk Difference Translation — Converts a relative effect into a concrete per-person difference — an absolute risk change and number-needed-to-treat — by grounding it in the baseline event rate.
• Arbitrage Opportunity Scan — Searches for cross-price, cross-market, or cross-instrument gaps that should disappear if the information set is incorporated.
• Baseline Comparison — Compares actual outcomes with a pre-action baseline, expected trend, benchmark, or no-action projection when direct controls are unavailable.
• Bayesian Diagnosis — Combines a base rate or pretest probability with test evidence to revise the plausibility of a condition, cause, or hidden state.
• Bonferroni-Like Correction — Stiffens each test's significance bar in proportion to how many tests share the family, so that clearing it stays hard even after many simultaneous attempts.
• Bootstrap-Like Checks — Resamples the observed data with replacement to see whether an estimate holds still — gauging stability without trusting a parametric error formula.
• Candidate-Family Comparison Grid — Lays credible distribution families and assumption-light baselines side by side and scores them on support, rationale, tail behavior, and complexity so the family choice is argued, not defaulted.
• Capture-Recapture Defect Estimation — Estimates how many defects remain unfound by treating the overlap between two independent inspection passes as a mark-recapture sample.
• Causal Diagramming — Draws the assumed causal structure — exposure, outcome, confounders, mediators, colliders — as a diagram, so the decision of what to control is made from the assumptions before the data, not by the data after the fact.
• Causal-Temporal Trace — Lays the narrative's events, actors, and causal claims onto one timeline so anachronisms and causal-capacity mismatches surface — the places where the story needs something to happen before the thing that makes it possible.
• Claim-Lattice Mapping — Externalizes a sprawling narrative into an explicit graph of its claims and the support, implication, and constraint links between them, so the story can be reasoned about as a structure instead of felt as a flow.
• Closed-Form Power Calculation — Solves the sample-size or power equation analytically, returning required N or expected power for a standard, well-characterized test in a single evaluation.
• Common Factor or Random-Effect Model — Estimates the shared rater, batch, or instrument component as a latent factor or random effect and shrinks each dimension's estimate toward the group by its precision.
• Confidence Interval Propagation — Carries a raw estimate's uncertainty through the standardizing transformation so the reported effect keeps a valid interval instead of collapsing to a point.
• Confidence Update Worksheet — A structured record of prior confidence, stream-specific likelihoods, dependency discounts, contradictions, and sensitivity that resolves to a single bounded confidence claim.
• Constant Comparison Matrix — Compares each new case against prior cases and the current categories, forcing every difference into a model revision.
• Contradiction Timeline — Places inconsistent statements, records, and observed events on a timeline to distinguish memory, framing, drift, and strategic revision.
• Controlled Before–After Contrast — Compares the change over the same interval in the treated group against a comparison group, reporting the difference as the controlled effect rather than the raw rebound.
• Correlation or Regression Coefficient Transformation — Converts association estimates — correlations and regression slopes — into comparable effect-size units, and inter-converts between the correlation and mean-difference families.
• Cross-Market Information-Leakage Check — Compares related markets or instruments to see whether information appears in one signal before another.
• Discriminating Test Matrix — A grid crossing rival hypotheses against pieces of evidence, scoring each cell for consistency and each row for reliability — so effort goes to the observations that actually separate the rivals rather than to evidence that fits them all.
• Distributional Sensitivity Grid — Runs each plausible family, tail, dependence, and parameter choice all the way through to the final decision output to see whether the conclusion actually moves.
• Doubly Robust Missingness Adjustment — Combines outcome modeling with response weighting so estimates can remain consistent if one of the two model components is correctly specified.
• Emic-Etic Contrast Matrix — A grid that places the same cases under both the emic and the etic account at once, so correspondences, partial matches, and outright breaks between the two become visible cell by cell.
• Failure Tree Analysis — Traces an undesired top event down through the combinations of component failures and enabling conditions that can produce it.
• False Discovery Rate Control — Ranks a whole family of results and draws the significance line to hold the expected share of false discoveries below a chosen rate, trading a little purity for far more power.
• Forensic Scenario Reconstruction — Builds and compares scenarios that could have produced observed traces while preserving uncertainty about alternatives.
• Full-Information Maximum Likelihood Path — Uses likelihood-based estimation with incomplete observed data when model and missingness assumptions are appropriate.
• Hedges Correction Application — Multiplies a standardized mean difference by a small-sample correction factor to remove the upward bias that inflates effect sizes in tiny studies.
• Inference-to-Best-Explanation Matrix — Compares candidate explanations against explanatory fit criteria and records the provisional winner.
• Instrumental Variable Strategy — Uses an external variable that shifts the exposure but has no other path to the outcome, isolating a slice of exposure variation that is free of confounding — including unmeasured confounding.
• Interrupted Series with Pretrend Check — Fits the pre-event trend and seasonality of a single series, then tests whether the outcome shifts level or slope at the event beyond what the extrapolated pretrend and a transient spike predict.
• Inverse-Probability Weighting Model — Weights observed cases by modeled response probability to reduce bias from differential observation when covariates support the response model.
• Lagged-Response Regression — Tests whether old information still predicts later price or signal movement after the supposed incorporation window.
• Leakage Sensitivity Grid — Sweeps a ladder of assumed contamination strengths the source cannot be measured at, and reports the level at which each conclusion breaks.
• Likelihood Ratio for Non-Detection — Quantifies how much less likely the null finding is under target presence than target absence.
• Likelihood-Ratio Reasoning — Updates beliefs by comparing how likely the evidence is under one possibility versus another.
• Market-Microstructure Order-Book Probe — Uses quotes, depth, spreads, order flow, and liquidity to test whether available information appears in trading behavior.
• Matched Case Comparison — Pairs cases or periods that are similar on key attributes so differences in outcomes can be interpreted relative to a more credible counterfactual baseline.
• Matched Comparison — Pairs each exposed unit with unexposed unit(s) alike on the measured confounders, so the compared groups are balanced on those variables by construction before any outcome is examined.
• Matched Extreme-Case Comparator — Builds a comparison group selected by the same extreme threshold and watched on the same schedule, so shared reversion shows up as movement the treated group did not cause.
• Median-Based Summaries — Reports the middle and the spread with order statistics — median, quantiles, IQR — so a few extreme values can't dominate the typical-case claim.
• Memory Source Probe — Interrogates one recalled item at the moment of recall for its source cues, then applies a rule to classify where it actually came from.
• Meta-Analytic Effect Harmonization — Brings many studies' effects onto one common metric and quantifies how much they genuinely disagree, so a body of evidence can be synthesized without erasing real heterogeneity.
• Minimal Important Difference Anchoring — Judges a standardized effect against an externally established threshold of meaningful change, so magnitude is read as important-or-not rather than merely large-or-small.
• Minimum Detectable Effect Table — Reverses the sample-size question — for a design whose size is already fixed by budget or population, tabulates the smallest effect it can detect at the target power.
• Minimum Detectable Presence Table — States the smallest detectable target level, effect size, defect rate, incidence, or trace intensity.
• Missingness Indicator Matrix — Creates response indicators and pattern tables that show which records, variables, waves, or sensors are absent.
• Model Comparison Table — Lays the same question's answers side by side under strong and assumption-light frames, turning method disagreement into a visible, decidable finding.
• Modus Tollens Checklist — Runs a single conditional through the strict logical form — rewrite 'if A then B' as 'if not-B then not-A', confirm B is absent, and only then conclude A is false.
• Multilevel Modeling Review — Reviews whether a nested-data claim needs partial pooling — borrowing strength across groups so small subgroups are neither over-trusted nor erased.
• Multiple Imputation Workflow — Creates multiple plausible completed datasets, analyzes each, and combines estimates while preserving imputation uncertainty under the stated assumption.
• Multitrait-Multimethod Matrix — Crosses several traits with several measurement methods so that agreement which replicates across methods can be told apart from correlation manufactured by the shared method.
• Multiverse Analysis Report — Runs the analysis across every defensible analytic choice at once and shows the whole spread of results, exposing whether the headline depends on one lucky path.
• Negative Case Analysis — Studies the cases that do not fit a theory and uses them to revise its boundary and confidence, rather than defending the theory or throwing it out.
• Negative-Case Scan — Actively hunts the comparable cases where the solution did not emerge or did not work, and lets those failures recalibrate how strong the convergence really is.
• Network Position Review — Examines actors' network positions to separate structural centrality and status from a real information advantage.
• Nonparametric Tests — Compares groups or distributions with distribution-free tests chosen against a named assumption threat, not by software default.
• Operating Characteristic Curve — Plots detection probability across the full range of plausible true effects, replacing a single power number with the whole sensitivity profile of the design.
• Pattern-Mixture Sensitivity Model — Models outcomes by missingness pattern and varies unobserved departures to explore MNAR-sensitive conclusions.
• Permutation Tests — Builds an exact null by reshuffling the labels the hypothesis says are exchangeable, replacing a distributional assumption with a randomization one.
• Post-Announcement Drift Analysis — Looks for predictable movement after public disclosure, suggesting delayed or incomplete incorporation.
• Posterior Risk Estimation — Produces a revised probability or risk score after combining baseline risk with new indicators.
• Poststratification or Reweighting — Corrects an aggregate whose sample composition differs from the target population by reweighting subgroups to a declared, auditable population basis.
• Power Sensitivity Grid — Recomputes power across a grid of alternative variance, attrition, and compliance assumptions to expose designs that only clear the bar under optimistic inputs.
• Predictive Replication Check — Simulates replicate datasets from the fitted model and asks whether they reproduce the observed shape and dependence the decision relies on.
• Prior Sensitivity Analysis — Compares posterior conclusions under several plausible priors to see whether decisions are dominated by starting assumptions.
• Range Proof — Proves that a private numeric value lies within an accepted range without revealing the value itself.
• Rank-Based Methods — Replaces raw values with their order positions so an inference leans on defensible ranking rather than unverified metric distance.
• Reliability-Based Reversion Simulation — Simulates the follow-up movement you would see with no treatment at all — from measurement reliability and the selection threshold — to give expected reversion a numeric range.
• Resampling Robustness Audit — Re-estimates the conclusion across bootstrap or jackknife resamples to expose how much it rests on finite-sample luck or a handful of observations.
• Residual Correlation Diagnostic — Recomputes the correlation matrix after the shared source has been stripped out and keeps only the associations that survive the adjustment.
• Risk Ratio or Odds Ratio Standardization — Expresses a binary event outcome as a relative ratio between two groups, computed on the log scale so the multiplicative effect can be compared and combined.
• Robust Statistics — Estimates with outlier-resistant methods whose conclusions survive a handful of extreme observations, then reports what that resistance costs.
• Robustness Check — Perturbs the assumptions, inputs, segments, and specification behind a result to see whether the pattern holds steady or was propped up by one fragile arrangement.
• Rule-to-Observation Matrix — Crosses every candidate rule against every observation actually gathered, flags the cells where a required consequence is missing, and marks which cells could not have shown it anyway.
• Scenario Contrast — Contrasts a focal path with one or more explicitly described alternatives, often in strategy, planning, design, or historical interpretation where controlled testing is impossible.
• Selection-Model Sensitivity Analysis — Models the response process jointly with the outcome to examine how non-ignorable missingness would affect estimates.
• Sensitivity Analysis by Group — Re-runs the aggregate under alternative groupings, weights, windows, and exclusions to see whether the conclusion survives the choices that produced it.
• Sensitivity Analysis for Unmeasured Confounding — Asks how strong an unmeasured confounder would have to be to explain away the observed effect, converting an unanswerable 'what if something is hidden?' into an explicit robustness threshold.
• Sequential Forecast Update — Revises a forecast as new observations arrive while preserving a record of prior forecast states and reasons for movement.
• Shrinkage-Aware Expectation — Pulls a noisy extreme estimate partway back toward the group mean by an amount set by its unreliability, so a single spike is not treated as the case's true level.
• Simpson's Paradox Check — Tests whether an aggregate relationship reverses or materially changes once a confounder or composition variable is conditioned on — the fingerprint of a Simpson reversal.
• Simulation-Based Power Analysis — Estimates power for a complex or nonstandard design by repeatedly generating synthetic datasets under an assumed effect and running the actual planned analysis on each.
• Standardized Mean Difference Calculation — Rescales a difference between two group means into standard-deviation units so effects measured on unrelated continuous instruments land on one common axis.
• Statistical Adjustment — Models the outcome (or exposure) as a function of the measured confounders alongside the exposure, so the exposure's estimated effect reflects its relationship net of those variables.
• Stratified Analysis — Splits the data into strata within which a confounder is held roughly constant, estimates the exposure-outcome relationship inside each, then interprets or pools the stratum-specific results.
• Stratified Analysis Protocol — Splits an aggregate into pre-declared strata and compares each subgroup's pattern against the pooled figure, so hidden heterogeneity surfaces before the claim is trusted.
• Succinct Zero-Knowledge Proof System — Implements compact proofs of computation, membership, possession, or constraint satisfaction under a formal proof system.
• Synthetic Control Method — Builds a weighted comparison case from multiple units when a single natural control is unavailable, often in policy, economics, public health, or regional intervention evaluation.
• System Archetype Matching — Compares an observed system's behavior against a catalog of known feedback-structure archetypes, proposes the closest match, then holds it provisional until its boundary of fit and a fresh pair of eyes confirm the structure is really there.
• Theoretical Gap Matrix — Maps the model's open gaps against candidate cases to rank which case would teach the most next.
• Tipping-Point Analysis — Shows how extreme missing outcomes or response-process assumptions would need to be before the substantive conclusion changes.
• Triangulation Dependency Matrix — Cross-tabulates the evidence streams against shared dependency dimensions — data source, instrument, analyst, assumptions, incentives, timing, theory frame — so independence that is only nominal becomes visible at a glance.
• Variance Partitioning Report — Splits each dimension's variance into true-signal, shared-source, dimension-specific, and noise shares, carries each share's precision, and rewrites the claim to match.
• Warranty and Failure-Return Analysis — Mines the stream of returned and warranty-claimed units — traced back to their production batch — to infer real field reliability and expose latent defects a lab test never saw.
• What-If Analysis — Uses a structured hypothetical prompt to define an alternate condition and reason through likely outcome differences; it becomes Counterfactual Comparison only once the alternate is plausibility-checked and used for disciplined comparison.

Feedback & Regulation

Solutions that sense the effects of action and use the result to stabilize, steer, damp, amplify, or otherwise regulate subsequent behavior.

15 mechanisms · View full solution family

• Audience-Channel Matrix — Maps every intended and unintended receiver of a planted signal across each channel, then scores where it is most likely to be exposed, re-enter friendly systems, or be trusted by one's own side.
• Bayesian Dose Forecasting — A forecasting method that updates exposure-response predictions as new observations arrive.
• Bayesian State Estimation — Infers the system's hidden state and its uncertainty by recursively updating a probabilistic estimate as each noisy observation arrives.
• Clickstream Deviation Scan — Mine product telemetry at population scale for the loops, exits, repeated searches, and shortcut clicks that mark where users deviate from the intended flow.
• Compartmental PK/PD Model — A model that represents exposure as movement through one or more compartments before linking exposure to response.
• Effect-Compartment Lag Model — Inserts a hypothetical effect-site compartment so measured exposure and observed response can be separated by a modeled time lag.
• Exposure–Response Simulation — Runs candidate input regimens forward through the coupled exposure-response model to project their trajectories against the target window before any is tried live.
• Local Competition and Lateral Suppression Map — Models a field of competing local units in which each active unit suppresses its neighbors, sharpening the winner and the contrast across the field.
• Opponent Signal Subtraction Model — Models net output as the arithmetic difference between one activating and one inhibiting channel meeting at a single locus.
• Physiologically Based Exposure–Response Model — A mechanism-grounded model that uses explicit pathways or compartments to support exposure-response prediction and extrapolation.
• Policy Exposure–Response Sandbox — A what-if environment for testing how policy intensity and communication cadence translate into compliance, fatigue, and backlash before rollout.
• Population PK/PD Covariate Model — Represents systematic between-subject variability by tying model parameters to covariates, yielding population priors that individualize before any measurement.
• Sensitivity Analysis — Sweeps the model's inputs and parameters across their plausible ranges to find which ones actually move its decisions — and whether the model's added complexity earns its keep.
• Taint-Tracking Analysis — Tracks whether untrusted values can reach interpreter sinks without inertization or authorization.
• Training Load Response Forecast — Forecasts how training workload accumulates into fatigue and fitness before it shows up as performance or injury risk.

Flow & Routing

Solutions that direct material, information, demand, work, or traffic through paths and stages to improve movement and avoid congestion.

9 mechanisms · View full solution family

• Drift vs. Noise Test — Applies a formal significance test to a stretch of the path, refusing to call it a trend, streak, or skill until its displacement exceeds what a pure random walk would routinely throw up.
• 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.
• 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.
• Gradient Descent or Ascent Search — Reads the local slope of an objective surface and takes a step in the improving direction, repeating until the ground goes flat, to walk toward a better point without mapping the whole field.
• Opportunity Scoring Model — Estimates, for every case in a field at once, the expected marginal benefit of acting on it, producing a comparable score so effort flows to where the upside is greatest.
• Queue Analysis — Reads queue length, wait time, and service rate across a flow to locate the binding station and size how far work is backing up behind it.
• Random-Restart Schedule — Teleports a stalled or trapped walk back to a fresh random starting point on a set schedule, so no single dead-end region can hold the search forever.
• Random-Walk Simulation — Runs many synthetic copies of the walk forward from an assumed step rule to forecast how far it typically wanders, how fast, and how often it reaches the edges — before a single real step is taken.
• 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.

Governance & Accountability

Solutions that allocate decision rights, oversight, responsibility, transparency, and consequences so power remains answerable and action-owned.

7 mechanisms · View full solution family

• Five Whys with Stop Rule — Follows a causal 'why' chain down to the first level where a durable action can be taken, then stops on a named rule rather than chasing causes forever.
• FMEA Dependency Table — Adapts failure mode and effects analysis to dependencies — scoring each one's failure by severity, likelihood, and detectability to produce a ranked, mitigation-prioritized list rather than a flat inventory.
• Hohfeldian Relation Matrix — Lays every asserted position into a grid of its jural correlative and opposite, so a claim with no matching duty cell — or a liberty mistaken for a claim — becomes visible at a glance.
• Impact Analysis — Traces the blast radius of one specific dependency failing or changing — what breaks first, who is hit, how fast, and what substitutes remain — turning a depends-on relation into a concrete consequence.
• Refusal-Cost Scenario Test — Stress-tests each dependency by simulating a flat refusal and pricing the consequence, exposing which outside actors the decision owner cannot actually afford to say no to.
• Responsibility Attribution Matrix — Cross-tabulates each candidate agent against contribution, control, duty, and knowledge, then applies an explicit weighting rule to turn the grid into a graded, comparable responsibility reading.
• Rights-Conflict Scenario Table — Runs concrete combinations of actors, conditions, and scarce resources to reveal which rights collisions are real and which dissolve once scope is fixed.

Identity, Reference & Matching

Solutions that establish what an entity is, bind records to the right referent, resolve names, or match cases without confusing near-equivalents.

5 mechanisms · View full solution family

• Case-Based Reasoning System — Runs the full retrieve–reuse–revise–retain loop, but earns its keep at the revise step: it adapts a retrieved case's solution to the new case's specific differences rather than copying it.
• Feature Binding Matrix — Lays features and candidate objects on the two axes of a grid, scores each cell by cue, and flags where assignments collide — so a whole binding decision can be inspected at once.
• K-Nearest-Neighbor Case Matcher — Answers a new case by polling its k nearest stored neighbors and letting them vote, reading confidence straight off how much the neighborhood agrees.
• Predictive State Filter — Carries an entity's state forward through an observation gap as a probability distribution anchored on the last confirmed sighting, widening the uncertainty envelope as time passes so the estimate never masquerades as an observation.
• UUID or Random Token Generator — Fabricates identifiers that are unique by construction — drawn from a space so vast that no coordinator, lookup, or namespace is needed to keep any two from ever colliding.

Integration & Composition

Solutions that assemble parts into a functioning whole, reconcile interfaces, and verify that combined behavior preserves required properties.

2 mechanisms · View full solution family

• Incompatibility Root-Cause Analysis — Turns a failed combination into a durable composition rule by diagnosing why it failed and pushing the fix back into contracts and the registry.
• Research Synthesis Protocol — Selects and reconciles findings, models, and cases into one internally consistent knowledge product that answers a defined question and stands up to scrutiny.

Knowledge, Memory & Provenance

Solutions that capture, retain, retrieve, transfer, and trace knowledge or records so later users can recover both content and origin.

12 mechanisms · View full solution family

• Comparative-Case Attribution Test — Uses real cases where the actor varied under similar structures, or the structure varied under similar actors, as natural experiments that discriminate among competing attributions.
• Constraint-Loss FMEA — Enumerates the failure modes that removing a structure would unlock and scores each by severity, occurrence, and detectability to size the loss before the cut.
• Counterfactual Actor-Substitution Probe — Holds the structure fixed and asks what a plausible substitute, an absence, or a delay of the focal actor would have changed — bounding how replaceable the person really was.
• Hermeneutic Gap Analysis — Identifies missing shared concepts, categories, examples, or explanatory frames that prevent certain experiences from being recognized as actionable knowledge.
• Historical Rationale Reconstruction — Rebuilds the forgotten original rationale for a structure from records, change logs, and provenance — recovering why it was created rather than who remembers it.
• Network and Institutional Position Map — Charts positions, authority, brokerage, and selection in the relational structure to show which options a role afforded and how replaceable its occupant was.
• Process Tracing Across Levels — Reconstructs the causal chain by which a single decision propagates upward through individual, group, organizational, and institutional levels to the macro outcome, testing each link against the evidence it would have to leave.
• Process Tracing and Mechanism Discrimination — Tests drift, accumulation, threshold, shock, reorganization, replacement, and reframing against event sequences and counterevidence to name the change mechanism.
• Reconstruction Workspace or Replay Table — A workspace that replays independent evidence streams onto a shared timeline to reconstruct what happened, keeping the reconstruction visibly separate from the raw inputs.
• Simulation Trace Replay — Reruns captured or generated trajectories in a simulator outside the live system, filtering sim-to-real artifacts and probing whether what was learned transfers back to reality.
• Sleep-Dependent Consolidation Schedule — Times encoding and prioritizes material so the most valuable traces catch a full sleep cycle's offline consolidation.
• Structural-Constraint Relaxation Probe — Holds the actor fixed and loosens or tightens one structural condition at a time to see whether the actor's effect survives the change — measuring how conditional that effect really was.

Learning & Scaffolding

Solutions that sequence practice, feedback, examples, and support so capability grows and transfers beyond the original learning setting.

5 mechanisms · View full solution family

• Action Barrier Walkthrough — Walks the actual moment of action step by step to find exactly where knowing stops turning into doing, and names the kind of barrier that stops it.
• Business Model Pattern Mixing — Recombines revenue, cost, governance, and delivery structures from different business models into one operating concept whose economic feedback loops still cohere.
• Diagnostic Differential — Keeps several rival explanations live and drives toward the one discriminating test that separates them, updating each rival's likelihood as evidence lands.
• Habit Loop Mapping — Charts the existing cue → routine → reward loop so the association driving a behavior is visible before anything is changed.
• Interdisciplinary Model Synthesis — Fuses explanatory models from separate disciplines into one hybrid analytic frame, bridging their incompatible vocabularies into structure neither field had alone.

Lifecycle & Maintenance

Solutions that manage creation, operation, upkeep, renewal, retirement, and accumulated burden across the useful life of an artifact or system.

4 mechanisms · View full solution family

• Break-Even Sensitivity Analysis — Solves for the value of an uncertain parameter at which a lifecycle comparison flips — the crossover point where the preferred option stops being preferred.
• Burden-Shift Sensitivity Analysis — A method for testing whether circular redesign benefits hold under different assumptions and impact categories.
• Core / Emerging / Future Investment Buckets — Groups initiatives into present core, emerging transition, and future bets, then tallies the split so the portfolio can be reviewed as three comparable groups.
• Process-Based LCA Model — A model that estimates lifecycle inputs, outputs, and impacts for defined product or service alternatives.

Mapping & Transformation

Solutions that translate between representations, coordinate systems, scales, formats, or states while preserving the relationships that matter.

76 mechanisms · View full solution family

• Action-Angle Variable Substitution — Swaps the natural coordinates of a periodic system for actions that stay constant on each orbit and angles that advance at a fixed rate, turning bounded motion into uniform circulation.
• Aperture and Spatial-Frequency Design Rule — Sets the aperture and wavelength of an imaging system so a required spatial resolution is met, using the reciprocal-space relation between aperture size and resolvable spatial frequency as the design equation.
• Attack Graph Analysis — Maps the multi-step routes an adversary can chain from an entry point to a protected asset, exposing the sequences of conditions that make a whole attack conduct.
• Boolean SAT or SMT Path Search — Encodes the whole conduction logic as a Boolean or SMT formula and lets a solver either exhibit a dangerous state combination or prove that none exists.
• Burden–Benefit Balance Sheet — Tallies who bears the costs and who reaps the gains of an asymmetric relation, side by side, and marks the line past which the exchange stops being reciprocal.
• Classification Confusion or Error Matrix — Cross-tabulates the reference class against the realized class so systematic off-diagonal mass reveals where the equivalence relation lumps unlike cases together or draws a line between cases nothing can tell apart.
• Context Confusion Matrix — Tabulates how often each true context is served the wrong representation — a rows-are-truth, columns-are-selected grid that turns 'switching feels flaky' into a map of exactly which contexts get mistaken for which.
• Convolutional Feature Extractor — A software mechanism that applies kernels across a field to generate locally transformed feature maps.
• Curvilinear Field Mapping — Maps a wide angular field onto a curved coordinate surface — cylindrical, spherical, or fisheye — trading straight-line fidelity for angular coverage no flat plane can hold.
• Dead Reckoning Loop — Maintains a running position estimate by integrating heading and distance from a known fix, with no external reference — accurate in the short run, drifting in the long.
• Dual-Framework Concept, Relation, and Assumption Map — Models each framework's concepts, relations, evidence, assumptions, examples, and boundaries in its own terms — separately — before any cross-framework overlay.
• Ecological Scale Mapping — Maps nested spatial scales — organism, patch, watershed, region — and traces how a local ecological event travels outward along the physical flows that connect them.
• Ecological Scale Translation — Moves observations among plot, site, population, region, and landscape scales by routing through an intermediary scale, mapping spatial heterogeneity, and preserving the ecological relationship that must survive.
• Edge-Detection Kernel — A contrast-oriented kernel that turns local changes into an edge, boundary, or gradient response.
• Eigen-Direction Review — Reads the local model's structure to classify which directions decay, which amplify, and how they couple — turning a saddle into a labeled set of stable and unstable modes.
• Eigendecomposition Workflow — Takes an explicitly known linear operator and returns its complete set of invariant directions together with the scalar gain of each — the full modal picture the rest of the analysis reads from.
• Elastic-Net Embedding — Lays out the whole map by relaxing a two-term energy — each substrate point pulled toward the source data it should represent, while neighboring substrate points are pulled together — so the map fits the data and stays smooth at once.
• Exposure Overlay Map — Lays exposure as layers over a real map or asset register — which people, places, and threshold-sensitive facilities fall inside the impact zones, and who bears the burden — so exposure is read off geography and holdings rather than guessed.
• Fault Tree with AND-Gate Logic — Deduces, top-down through AND and OR gates, the combinations of basic failures whose conjunction is sufficient to cause the top event, and enumerates them as minimal cut sets.
• Gaussian Smoothing Kernel — A local smoothing method using a Gaussian-shaped kernel to reduce noise or fine-scale variation.
• Generating Function Derivation — Constructs a guaranteed-canonical change of variables by choosing a single generating function and reading the transformation off its partial derivatives.
• Granularity Tuning Rubric — A scored comparison of candidate class structures on actionability, error cost, and maintenance burden, converting the split-or-merge choice into an explicit weighing rather than a hunch.
• Graph Difference Review — Lays the before and after topology side by side as nodes and edges and computes the delta — the connections lost, added, weakened, or rerouted — so a transformation's structural changes are seen rather than assumed.
• 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.
• Identity Resolution Model — An inference model that weighs evidence across attributes to decide, with a confidence score, whether two records or names refer to the same real-world entity.
• Individual-to-Population Policy Translation — Turns individual-level evidence into population policy by mapping how the effect varies across subgroups, how new interactions appear at scale, and which populations the finding actually covers.
• Inverse Transform Backtranslation — Carries a result solved in the simplified frame back to the original variables and their real-world meaning, confirming the round trip returns exactly where it started.
• Lab-to-Field Translation — Carries a result from a controlled setting into live field conditions by re-deriving it against the noise, uncontrolled variables, behavior, and measurement drift the controlled setting held constant.
• Local Search with Backtracking — Explores one neighboring move at a time, marking dead ends and retracting a single step when blocked — depth-first search with undo.
• Local-National Policy Synthesis — Reconciles broad policy goals with regional, municipal, community, or site-level implementation evidence.
• Local-to-Global Risk Map — Charts how many small, individually-tolerable local exposures aggregate up a shared channel until, at some threshold, the risk changes form and becomes systemic.
• Macro-to-Micro Operational Translation — Turns a system-level goal, constraint, or risk pattern into unit-level actions that stay feasible and meaningful locally — without assuming every unit experiences the aggregate the same way.
• Magnification Function — Sets how much scarce substrate each source region receives as a function of its importance, so high-relevance regions are magnified with fine resolution and low-relevance regions are compressed.
• Manifold Learning Diagnostic — Tests whether a space actually has locally-simple, globally-curved manifold structure before committing to atlas modeling.
• Manufacturing Batch Trace Analysis — Links outputs to production batches using repeated defects, residues, material composition, or tolerance profiles.
• Map Registration and Alignment — Brings two independently-built maps into one shared coordinate frame by matching the anchors they hold in common, so a point in one map can be located in the other.
• Micro-to-Macro Model Translation — Builds aggregate variables up from individual or unit-level dynamics, checking where emergence, interaction, and distributional distortion make the whole behave unlike the sum of its parts.
• Minimal Cut-Set Enumeration — Reduces a fault model to the complete list of minimal condition-sets — each the smallest combination that, occurring together, completes a route to the hazard.
• Modal Stability Analysis — Classifies each mode as growing, decaying, oscillating, or steady under repeated transformation, splitting the spectrum into a stable set and an unstable set — a verdict that holds only inside the linearized regime it was taken in.
• Moving-Average or Boxcar Filter — A simple convolutional filter that replaces each position with an average over a local window.
• Multi-Level Policy Analysis — Follows a single rule downward through each governance layer to see how its intent turns into local incentive and behavior — then picks the layer where the rule should actually be set.
• Multidimensional Scaling Layout — Computes a low-dimensional layout in which the distances between placed items reproduce, as closely as possible, their dissimilarities in the source — built from a distance table alone.
• Multiscale Kernel Bank — A set of kernels with different support sizes or orientations used to compare local structure across scales.
• Neighborhood Trustworthiness and Continuity Metric — Scores how faithfully each point's map-neighbours match its true source-neighbours, separating the false neighbours a map invents from the real neighbours it tears apart.
• Network Spectral Centrality Analysis — Treats a network's connectivity as the transformation and reads the entries of its dominant eigenvector as node importance — ranking who sits in the network's dominant mode, and therefore where structural intervention bites.
• Ontology Alignment Session — A method for reconciling different conceptual models, category systems, or domain vocabularies that carve up reality differently.
• Organizational Level Mapping — Traces how a local workaround aggregates upward into an enterprise-level pattern, and how enterprise metrics press back down on the front line — through the incentives that connect the two.
• Pairwise Covering Array — Reduces large products while preserving coverage of every pair of axis levels.
• Perturbation-Response Map — Charts, region by region, what downstream damage follows when each part of the substrate is knocked out — turning 'what if this fails' into a readable footprint map.
• Perturbative Canonical Transformation — Removes a small coupling term order by order with a sequence of near-identity canonical maps, buying an approximate but structure-preserving simplification with an explicit validity range.
• Pilot-to-Scale Translation — Adapts a live pilot's findings to full deployment by separating the pilot conditions that were essential from those that were accidental, then re-basing the result against ordinary target-scale conditions.
• Power-Iteration Probe — Recovers just the single dominant mode of a transformation by applying it to a trial vector over and over — never forming or factoring the whole operator — and reads its own convergence rate off the spectral gap.
• 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.
• Principal Component Analysis — Finds the orthogonal directions of greatest variance in a cloud of data, turning many correlated measurements into a few uncorrelated modes ranked by how much they explain.
• Product Space Generator Script — Automatically generates cell tuples, keys, and counts from declared axes and levels.
• Propagation Simulation — Runs the regime shift forward through a model of the system to see how far and how fast consequences travel, where damping and buffers halt them, and which nested zones actually light up under dynamics rather than assumption.
• Quantum Uncertainty Budget — Partitions a measurement's total uncertainty into contributing terms — separating the irreducible conjugate (Heisenberg) floor from detector noise, back-action, and calibration error — so effort targets the term that actually limits precision.
• Reduced-Order Model — A small, runnable surrogate that keeps only a system's dominant modes, so its behaviour can be simulated, controlled, or explored in real time within the regime where the reduction holds.
• Residual Error Analysis — A comparison of expected and observed outputs after fitting, correction, or transformation.
• Residual Reconstruction Test — Rebuilds the original system from only the modes you kept and measures what is left over, turning 'how many modes are enough?' into a number you can hold to a tolerance.
• Reversible Encoder–Decoder Pair — A paired encoding and decoding mechanism whose output can be decoded back to the original input within scope.
• Scenario or Monte Carlo Joint-State Sampling — Samples many correlated joint states to estimate how often an entire route conducts at once — the rare-coincidence probability that no single-factor analysis reveals.
• Seasonal Variation Model — Maps how the work will read across the full cycle of time — day to night, season to season, dry to flood, empty to crowded — so its changing states are designed rather than suffered.
• Self-Organizing Map Training — Trains a fixed grid of prototype units by competitive learning so that, over many passes, neighbouring units come to represent neighbouring regions of the source.
• Sensor Fingerprint Analysis — Detects device-specific noise, calibration, dead-pixel, acoustic, or timing patterns.
• 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.
• Singular Value Decomposition — Factors any rectangular or non-normal mapping into paired input and output directions linked by non-negative gains, so even transformations that have no clean eigenvectors still get a modal decomposition.
• Solar Shadow and Reflection Study — Computes the sun's path over the site to predict exactly where and when shadows fall and light reflects — so a beam, silhouette, or glint becomes a designed event tied to a date and hour.
• Stencil Computation Template — A template for applying the same neighborhood computation at every grid or lattice position.
• Structure-Preserving Numerical Integration — Advances a Hamiltonian system in time with a discrete step that is itself an exact canonical map, so the simulation conserves phase-space structure and energy stays bounded over billions of steps.
• Stylometric Attribution Model — Estimates source likelihood from stable linguistic, formatting, rhythm, or choice-pattern features.
• System-of-Systems Causal Mapping — Maps a whole assembled from autonomous subsystems that are themselves complex, tracing how influence crosses their engineered interfaces to produce — and sometimes cascade into — whole-system behavior.
• Time-Bandwidth Product Calculation — Multiplies a signal's temporal width by its spectral width and compares the result to the transform-limited minimum, collapsing the whole time-frequency tradeoff into one dimensionless number.
• Topographic Error Measure — Reports the fraction of inputs whose best and second-best units are not neighbours on the grid — a single number for how often the map's local topology is broken.
• Transfer-Function Estimation — A method for estimating how inputs are transformed into outputs over an operating range.

Measurement & Observability

Solutions that make hidden state inferable through instruments, indicators, probes, sampling, or diagnostic views with known limits.

31 mechanisms · View full solution family

• Bayesian Cue Integration Model — Treats each simultaneous cue as a likelihood over a shared latent quantity and multiplies them against a prior, yielding a single posterior estimate and its uncertainty.
• Blind Source Separation — Recovers several unknown source signals from several mixed recordings using only statistical assumptions about the sources — chiefly independence — with no template and no known mixing.
• Calibration-Curve Residual Report — Fits an instrument's response against known reference standards and reads the leftover residuals to expose systematic bias and tie every later reading back to a traceable curve.
• Counterfactual State Correction — Reconstructs what the target's state would have been without the observation — from a baseline and control evidence — and subtracts the induced change to report a corrected or, when calibration is weak, a bracketed estimate that carries its own residual uncertainty.
• Deconvolution and Inverse Filtering — Reverses a known blurring or convolution — an instrument response, point-spread function, or channel — to recover the sharp signal that was smeared, at the price of amplifying noise.
• Factor-Structure or Latent-Model Check — Fits a latent-variable model to item responses to test whether their internal structure matches the construct's theorized dimensions — internal-structure evidence.
• Feature Selection — Narrows a wide set of candidate variables to the informative subset that carries the target, so the separator later operates in a frame where signal and nuisance can actually be told apart.
• Inverse-Variance Weighting — Pools independent estimates of one quantity by weighting each in exact inverse proportion to its variance, so the fused estimate is no less certain than its most precise input.
• Kalman Filter Update — Recursively fuses a model's prediction with each new measurement, weighting the two by their current uncertainties, to maintain a running estimate of a changing state and its covariance.
• Kalman or Particle Filter — Recursively estimates a hidden state over time by combining a model of how the state evolves with each noisy measurement, carrying an explicit, updated uncertainty at every step.
• Latent Variable Model — Posits a few unobserved factors that generate the many things you measure, names the target as one of them, and asks up front whether the data can pin it down at all.
• Limit of Detection Estimation — Pins down the low end of a method — the level at which a real signal can finally be told apart from blank and noise — so tiny readings aren't reported as exact numbers or silently rounded to zero.
• Matched Filtering — Detects and times a known signal shape buried in noise by correlating the observation against a template of that shape — the optimal linear detector once the noise is characterized.
• Measurement Uncertainty Budget Table — Lists every contributor to a measurement's uncertainty on its own row, sized in common units, and combines them into a single defensible total — showing not just how big the uncertainty is but where it comes from.
• Moving Average Smoother — Averages each point with its neighbours in a sliding window, so a slow trend survives while fast zero-mean fluctuation cancels — the simplest separator of level from jitter.
• Multi-Trait Multi-Method Matrix — Crosses several traits with several measurement methods so convergent and discriminant validity can be read off — and method variance separated from true trait variance.
• PCA-like Projection — Rotates correlated observations onto a few orthogonal directions of greatest variance and keeps the top ones, betting that the target dominates the variation and the nuisance scatters into the discarded tail.
• Proxy–Target Correlation Refresh — Periodically re-estimates the statistical association between proxy and freshly measured target, updating the recorded link assumption instead of trusting the original validation forever.
• Reference Range Flag — Labels a single observation as below, inside, or above a context-appropriate expected or acceptable range.
• Regression Detrending Model — Fits an explicit trend across the whole record and subtracts it, so that either the smooth trend or — more often — the leftover residual becomes the clean target.
• Regression Residualization — Removes the part of a signal that measured nuisance variables can explain — regressing them out and keeping the residual as the cleaned target.
• Residual Leakage and Whiteness Check — Tests whether what's left after extraction is structureless noise — leftover pattern in the residual means the target leaked out or nuisance leaked in.
• Risk Score Proxy Metric — Uses a composite score as an indirect estimate of risk, quality, eligibility, or likely behavior, requiring strong fairness and validity safeguards.
• Short-Time Fourier Transform Window Selection — Chooses the analysis window for a spectrogram — trading time resolution against frequency resolution — to set up the time-frequency frame in which a downstream filter can isolate the target band.
• Standardized Residual Score — Transforms an observed-minus-expected difference into a scale-adjusted, z-like residual so departures are comparable across units of different variability.
• Supervised Representation Learning — Learns a separator from labeled examples — fitting a representation that keeps target-linked variation and discards the rest, instead of deriving it from a known model of the mixture.
• Triangulated Proxy Panel — Combines several independent proxies of the same target and treats their disagreement as the divergence signal, with no single ground truth required.
• Uncertainty Budget Table — A structured table that inventories every uncertainty source, propagates each through the measurement model with its sensitivity coefficient and correlations, and combines them into a defensible expanded uncertainty for the reported result.
• Uncertainty Propagation Calculation — Carries the uncertainty of raw inputs through the formula that combines them, so a derived quantity inherits an honest error bar instead of acquiring fake precision on the way out.
• Wavelet Multiresolution Analysis — Re-expresses the signal across a ladder of scales at once, so structure living at one scale can be separated from nuisance living at another — then reconstructs the target from the scales that hold it.
• Weighted Ensemble Estimator — Blends many model forecasts of the same target using performance-based weights, discounting members that merely echo one another, into one estimate with a disagreement spread.

Negotiation & Strategic Interaction

Solutions that account for other agents' incentives, reactions, commitments, bargaining power, and counter-moves when outcomes are interdependent.

13 mechanisms · View full solution family

• Compound Risk Map — Groups interacting drivers into named clusters that compound into a larger risk or converge into an opportunity, then hands each cluster a strategic response.
• Distal Driver Scan — A structured search for remote events, policies, markets, ecologies, social dynamics, or infrastructure states that may shape the local condition.
• Exploitability Matrix Review — Lays out actions against opponent responses in a payoff matrix and computes how much a best-responding adversary could win against a proposed mix — the exploitability gap versus the minimax value.
• Fixed-Sum Payoff Matrix — Maps participant payoffs across strategies or outcomes in a single table and verifies whether the totals remain constant, confirming the interaction is fixed-sum.
• Lagged Indicator Analysis — An analysis that compares remote indicators, intermediate changes, and local outcomes across time windows to estimate delay and sequence.
• Nontransitive Scenario Simulation — A simulation or tabletop exercise that explores how cyclic dominance evolves across context changes, adaptation, and elimination events.
• Pairwise Influence Scoring — Imposes one comparable rubric on every driver pair — direction, strength, confidence, and timing — so heterogeneous judgments become sortable, weightable numbers other mechanisms can consume.
• Per-Rung Advantage Matrix — Scores, rung by rung, who is better off if the conflict settles there — exposing where you hold escalation dominance and where climbing would actually help the other side.
• Propagation Pathway Model — A causal, network, process, or flow model that simulates or traces how remote changes propagate toward local consequences.
• Randomized Patrol or Route Schedule — Generates unpredictable coverage schedules across space and time — routes, timings, checkpoints — that still satisfy coverage requirements and weight high-risk zones more heavily.
• Reversibility Horizon Review — Assesses when rollback, redesign, migration, exit, or compensation will become harder than continuation.
• Source Triangulation Matrix — Arrays each claim against its sources to test whether apparent corroboration is genuinely independent or just one interested origin echoed — and whether the source mix is balanced enough to trust.
• Stop-Point Preference Model — Models where the other party would rather stop, settle, or comply than climb further — its pain thresholds, its best alternative, and its need to save face — so the ladder can be aimed to land it there.

Normalization & Standardization

Solutions that create comparable scales, shared formats, common baselines, or repeatable conventions across otherwise inconsistent cases.

6 mechanisms · View full solution family

• Constant-Currency Bridge — Shows value changes before and after currency translation so operational and exchange effects are separated.
• Dimensionless Ratio Construction — Combines quantities into a ratio whose units cancel — a pure number that carries meaning across scales, but only when its parts are chosen to mean something.
• Nominal-to-Real Conversion Table — Converts nominal monetary amounts into constant purchasing-power values using a declared index and base period.
• Normalized Metric Design — Designs a metric on a comparable basis — indexed, standardized, or denominator-adjusted — so entities of different size or context can be set side by side honestly.
• Per-Capita or Per-Unit Conversion — Divides a total by a clearly chosen denominator — people, units, transactions — turning raw counts into rates so differently sized things can be compared.
• Translation-Effect Decomposition — Decomposes reported value change into operational, price-level, and currency translation components.

Optimization & Search

Solutions that explore alternatives under objectives and constraints, prune infeasible regions, and improve a candidate toward a chosen criterion.

31 mechanisms · View full solution family

• Admissible Heuristic Search — Uses a bound that never overclaims how good a branch could be, so the search can be steered and pruned hard without ever discarding the true optimum.
• Beam Search — Carries only a fixed number of the most promising partial candidates from one step to the next, trading the guarantee of finding the best path for a search budget that stays constant no matter how the space explodes.
• Birthday-Bound Calculator — Estimates the probability that any two of n randomly drawn values collide in a namespace of size k, using the closed-form birthday-bound approximation.
• Branch and Bound — Discards an entire region of a search tree the moment a bound proves it cannot hold a better solution than the best one already found — narrowing the search while provably keeping the optimum.
• Coarse Grid Search — Evaluates a bounded parameter or design space on a rough regular grid first, then places a finer grid around the most promising cells and repeats until improvement stalls.
• Collision Simulation Grid — Monte Carlo simulation that estimates collision exposure when draws are skewed, dependent, or partitioned and the closed-form birthday bound no longer holds.
• Constraint Matrix — Cross-references candidate options against every constraint in one grid, so the feasible region — and which combinations are simply ruled out — becomes visible at a glance.
• Constraint Propagation — Pushes known constraints through the remaining choices until some branch's options are emptied, proving it infeasible before anyone searches it.
• Decision Tree Pruning — Cuts branches out of a fitted model when held-out data shows they capture noise rather than signal — shrinking the model toward the size that generalizes best, not the size that fits training data best.
• Dijkstra-Style Frontier Expansion — Grows a solution outward by permanently settling the cheapest-reachable node next — safe precisely because every step's cost is non-negative.
• Epsilon-Net or Covering Grid — Constructs a finite or countable set of anchors so every point in a metric domain falls within a declared radius.
• Feature Selection Pass — Selects variables using relevance, redundancy, leakage, stability, and validation criteria.
• Greedy Set-Cover Heuristic — Repeatedly adds the candidate covering the most still-uncovered need per unit cost — cheap, transparent, and provably within a logarithmic factor of the smallest possible cover.
• Kruskal-Style Edge Acceptance — Considers candidate connections cheapest-first and accepts each only if it doesn't break a structural invariant — exactly optimal when the legal sets form a matroid.
• Loss Function Design — Translates desired model behavior into a mathematical penalty structure used during training or selection.
• Method Bias Matrix — Lays candidate methods side by side by the inductive bias each one carries — its assumptions, the structures it favors, and the regime where that bias turns into a blind spot — so selection can match bias to the problem's shape before anything is benchmarked.
• Multi-Resolution Search — Implements the archetype by scanning at multiple levels of resolution and escalating detail only where the lower-resolution pass indicates value, uncertainty, or risk.
• Multi-Scale Field Pyramid — Stacks coarse and fine field layers over the same input so broad context and local detail are both captured.
• Nearest-Neighbor Route Extension — Grows a path by repeatedly stepping to the nearest still-available point, letting the current endpoint alone decide the next move.
• Peephole Optimization — Slides a small window along a linear sequence and replaces short, locally-matched runs with cheaper equivalents — greedy, local, and swept to a fixpoint.
• Priority-Queue Step Selection — Keeps every feasible candidate in a priority queue and repeatedly commits the current best, re-prioritizing the rest as each commitment reshapes the residual state.
• Query Plan Rewriter — Rewrites a declarative query into one of many result-equivalent execution plans, then emits the plan a cost model estimates will be cheapest to run.
• Recursive Depth-First Backtracking — A recursive method that extends a partial state one commitment at a time and returns to the prior choice point when a branch cannot complete.
• Regularization Path Review — Sweeps a method's complexity penalty or prior across its whole range and reads how fit, generalization, and failure modes change along the path, so the inductive bias is set to match the problem instead of left at a default.
• Regularized Model Selection — Selects among candidate models using explicit complexity penalties or priors validated out of sample.
• Rewrite System with Confluence Tests — Runs a set of rewrite rules as a system and tests the two properties that make it trustworthy — that rewriting always halts (termination) and that order never changes the result (confluence).
• Sample Density Stress Test — Estimates whether evidence coverage is sufficient in the effective high-dimensional space.
• Search Tree Pruning with Refinement — Implements the archetype when a tree or hierarchy is explored shallowly first, then expanded more deeply along selected branches while keeping audit checks for pruned branches.
• Sorted Candidate Sweep — Scores and sorts every candidate once, then makes a single pass accepting each in order whenever it keeps the solution feasible — no re-scoring, no revisiting.
• Space-Filling Design — Places design points across a multidimensional domain to reduce large uncovered regions.
• Sparse / Low-Rank Prior — Imposes an explicit structural assumption that many effects are zero, low-rank, smooth, or otherwise constrained.

Ordering, Sequencing & Dependencies

Solutions that arrange steps or events according to precedence, causality, readiness, or dependency so work happens in a valid order.

32 mechanisms · View full solution family

• Autoregressive Dependency Map — A representation of how much the current state depends on one or more earlier values of the same state variable.
• Canonical Sort Order — Sorts items by a documented stable rule so later comparison or processing sees a consistent sequence.
• Comparative Case Constraint Check — Tests which candidate constraints actually bind by comparing cases that shared the constraint but diverged in outcome — the one that co-varies with the outcome is doing real work; the one present in both is not.
• Counterfactual Breakpoint Analysis — Rewinds a single case to its decision junctures and asks, at each, whether a plausibly available different choice would have broken the path — locating the moments where the outcome was actually contingent.
• Critical Path Method — A project-network method for identifying the dependency path that controls overall duration.
• Cross-Lagged Dependency Review — A review that tests whether changes in one variable tend to precede later changes in another variable.
• Delay Compensation Tuning Sheet — A worksheet used to select control, monitoring, or reinforcement timing while accounting for known process delays.
• Diff and Merge Ordering — Orders comparable elements before differencing or merging so changes reflect substance rather than incidental sequence.
• Distributed Lag Model — A model form that estimates influence spread across multiple prior time steps rather than assuming a single delay.
• Divide-and-Conquer Algorithm — A method that splits a problem into independent smaller cases of the same kind, solves each recursively down to a trivial base case, and merges the results — with a size measure that provably shrinks at every split.
• Economic Order Quantity Model — A formulaic inventory mechanism for balancing ordering or setup cost against holding cost.
• Hierarchical Task Decomposition — Repeatedly expands a compound task into a smaller network of same-kind subtasks, stopping only when every open task is a primitive the executor can perform directly.
• Impulse Response Trace — A trace showing how a one-time disturbance propagates through later states over short, medium, and long horizons.
• Institutional Veto-Point Review — Walks the formal rules of a decision process to find every point where an actor can block change, then maps who holds each veto and what they want — locating the institutional constraints that keep a policy or arrangement in place.
• Isotopic Fingerprint Analysis — Measures the stable-isotope ratios carried in a material to place its origin in the geography and geology those ratios record.
• Late-Materialization Query Plan — Carries lightweight column positions through a query and reconstructs full rows only at the end, for only the rows and columns that survive.
• Legal Issue Tree — A structured tree that breaks a legal claim into its elements, exceptions, and evidence questions, so a verdict can be assembled by resolving each leaf against the governing standard.
• Likelihood-Ratio Attribution Report — Turns a signature comparison into a calibrated likelihood ratio — how much more the evidence favors one origin than a stated alternative — with scope and limits attached.
• Lock-In Map — Catalogs the self-reinforcing mechanisms — network effects, infrastructure dependencies, and feedback loops — that make a system reproduce its current path, showing why the arrangement holds even when a better alternative exists.
• Marker-Horizon Correlation — Aligns separate sequences into one timeline using a distinctive shared layer, and pins that timeline to the calendar when the marker is independently dated.
• Model Tuning Loop — Implements refinement for statistical, machine-learning, or simulation models by adjusting model choices based on validation feedback and constraints.
• Predicate Pushdown — Moves a query's filters down to the data source so rows that cannot match are never read, decoded, or transmitted in the first place.
• Queue Simulation Sweep — A simulation that evaluates candidate batch sizes under stochastic arrivals, service times, and capacity.
• Recurrence Interval Histogram — A summary of observed intervals between repeated events, relapses, incidents, failures, purchases, or returns.
• Recursive Design Breakdown — Reduces a design problem into nested same-kind design problems, carrying system-level constraints and interfaces down into each part and integrating the parts back into a coherent whole.
• Reference Library Match — Looks a query signature up against a governed library of known-origin references and returns scored candidate matches — only as trustworthy as the library is current and representative.
• Relative Chronology Matrix — Stores every pairwise before/after/unknown relation with its evidence so contradictions can be detected and candidate causal transitions flagged.
• Spectral Signature Matching — Measures a material's full spectrum and matches its shape against a reference spectral library to identify what it is — and thereby where or when it could have come from.
• Topological Sort — An algorithmic method for ordering nodes in an acyclic dependency graph so prerequisites appear before dependents.
• Topological Sorting — Computes a linear order that respects every prerequisite edge in an acyclic dependency graph — and exposes the full set of orders that remain valid.
• Trace-Element Profile Matching — Fuses the concentrations of many trace elements into one multivariate profile and matches it to a specific source deposit or batch.
• Version-History Commit Graph — Reconstructs the true sequence of a codebase from parent-child commit edges — not timestamps — and surfaces rebases and rewrites that disturbed it.

Participation, Norms & Culture

Solutions that shape belonging, legitimacy, shared expectations, collective practice, and the willingness of people to contribute or comply.

4 mechanisms · View full solution family

• Discourse Analysis — Reads a body of talk and text for the recurring metaphors, labels, and storylines that make a category feel natural and legitimate, and surfaces the rival readings the dominant one crowds out.
• Institutional Analysis — Maps the policies, records, incentives, technologies, and authorities that make a social arrangement durable — the machinery that makes it costly to ignore and easy to reproduce.
• Practice Genealogy — Traces how a category or routine actually came to be — its contingent origins, the forgotten alternatives, and the moment it hardened into 'the way things are' — so present necessity isn't mistaken for timeless fact.
• Reputation Score or Standing Index — Aggregates a subject's weighted traces into one score, band, or standing index used to sort trust, access, ranking, or scrutiny.

Planning & Staging

Solutions that turn an intended outcome into phases, milestones, option points, and coordinated preparations before execution.

11 mechanisms · View full solution family

• Bayesian Value-of-Information Update — Recomputes the posterior and the expected value of the next observation after every signal, so continuation is judged against what one more look would actually change.
• Best-Demonstrated-Practice Comparator — Anchors the possible-outcome envelope on the best result actually demonstrated by a comparable unit somewhere, so the ceiling is an existence proof rather than a model.
• Cohort Transition Table — Follows fixed cohorts stage by stage over a stable window, keeping each cohort's own starting count as the denominator so drop-off is never blurred by mixing arrivals from different periods.
• Counterfactual Ceiling Probe — Estimates the theoretical ceiling by asking what the outcome would have been if identified losses were counterfactually removed, and carries the answer with an uncertainty band.
• Event Trace Process Mining — Reconstructs the actual paths people took from raw event logs, exposing the loops, skips, back-steps, and side-routes that a clean linear funnel silently assumes away.
• Feasible-Frontier Mapping — Derives the possible-outcome envelope from an explicit constraint model — what the system could reach given its real limits — rather than from any single achieved result.
• Loss-Channel Decomposition — Breaks a single measured realized-possible gap into named loss channels that sum back to the whole, so a lump deficit becomes an itemized account of where the outcome leaked.
• Real-Option Exercise Boundary — Prices the option of waiting under irreversibility, so a commitment is exercised, deferred, or abandoned at the point where holding out stops paying.
• Segment Funnel Comparison — Re-runs the same funnel separately within meaningful slices — channel, device, region, cohort, access group — to reveal whether a whole-funnel drop is really one segment collapsing at one stage.
• Theoretical Yield Benchmark — Establishes the theoretical or design maximum a process could yield, with the assumptions that make that ceiling defensible, so every later loss is measured against a fixed reference.
• Yield-Loss Balance Sheet — Forces the yield gap to close as an accounting identity — theoretical maximum minus realized output equals the sum of named loss channels plus a residual — inside one boundary and unit of account.

Prediction & Simulation

Solutions that use models, scenarios, experiments, or synthetic environments to estimate behavior before committing in the real system.

33 mechanisms · View full solution family

• Autoregressive Stochastic Sequence Model — Models a numeric sequence as a linear function of a fixed number of its own recent past values plus fresh noise, capturing short, fading memory.
• Bayesian Model Update — Turns each observed surprise into a revised belief — folding new evidence into a prior to yield a posterior over the model, along with honest uncertainty.
• Bootstrap Dependence Diagnostic — Puts honest, dependence-aware error bars on a statistic by resampling the data in blocks that preserve its dependence unit rather than as if points were independent.
• Change-Point and Regime-Switching Model — Models a process whose probability law is not fixed but breaks or switches over time, estimating when the law changed and how the regimes differ.
• Delta or Differential Encoding — Sends only the difference from what the receiver could already predict — so the wire carries change, not the whole picture each time.
• Empirical Distribution and Increment Fit — Fits the distribution of values or increments directly from data with no assumed parametric family, giving the assumption-light baseline every richer model must beat.
• Gaussian Process Function Model — Models an entire unknown function over a continuous index as one draw from a distribution over functions, defined by a covariance kernel that correlates nearby points and yields calibrated uncertainty.
• Innovation Residual Filter — Updates a running state estimate using only the innovation — the gap between predicted and measured — weighted by how much to trust the model versus the measurement.
• Likelihood-Ratio Frame — Separates the strength of the evidence from the probability of the hypothesis by expressing what a signal says as a ratio that updates a base rate rather than replaces it.
• Markov Chain Model — Models a system that moves among a defined set of states where the next state depends only on the present one, not on the path taken to reach it.
• Markov Chain Process Model — Models a system as hops among a finite set of discrete states whose next step depends only on the current state, captured in a transition matrix.
• Monte Carlo Simulation Method — Implements the archetype by drawing repeated random samples from input distributions and computing corresponding outputs.
• Operational Capacity Simulation — Samples variable demand, processing times, outages, or resource availability to estimate service-level and overload risk.
• Poisson Event Model — Models independent random events arriving at a steady average rate, yielding the distribution of how many occur in a window and how long you wait between them.
• Poisson Event-Process Model — Models point events as arriving independently at a constant average rate with no memory, giving the memoryless baseline that richer arrival models are tested against.
• Portfolio Risk Simulation — Samples asset, project, or option outcomes to estimate combined portfolio exposure and tail risk.
• Posterior or Simulation Predictive Check — Simulates replicate datasets from the fitted model and checks whether real-data summaries the model was not tuned on fall inside or outside the simulated spread, exposing misfit the likelihood hides.
• Probabilistic Risk Simulation — Uses sampled input combinations to estimate probabilities of losses, failures, threshold crossings, or unacceptable states.
• Random-Walk and Diffusion Model — Models a quantity as the running accumulation of many small random increments, making drift, spread, and the boundaries it may hit explicit and predictable in distribution.
• Rare-Event Stress Simulation — Estimates the probability and character of extreme, seldom-observed outcomes by simulating the model with techniques that deliberately over-sample the rare region, since plain simulation almost never produces the events that matter.
• Renewal and Point-Process Model — Models a stream of events through the probability law of the gaps between them, capturing whether arrivals are memoryless, aging, or clustered rather than assuming a constant rate.
• Residual Comparison Test — Interrogates the shape of the leftover residuals — against a null, a rival model, or a raw sample — to tell honest noise from a model that is quietly wrong.
• Residual Independence and Whiteness Test — Examines what the model failed to explain — its residuals — for any leftover autocorrelation or structure, since a correct model should leave behind only unpredictable white noise.
• Scenario Sampling Workflow — Generates many sampled scenarios so decision-makers can inspect representative, borderline, and tail cases.
• State-Transition Kernel — Specifies the probability of moving from each state to every other in one step — the transition law that propels a Markov-type process forward.
• Stationarity Check — Tests whether a process's statistical properties are holding still or shifting over time, delivering a verdict on the stationarity assumptions a model rests on.
• Stochastic Sensitivity Analysis — Analyzes simulated runs to identify which uncertain inputs or assumptions dominate outcome variation.
• Stochastic State-Space Model — Separates a hidden state that evolves stochastically from the noisy measurements of it, estimating the latent process and the observation error as two distinct sources of randomness.
• Stratified Rate Table — Splits an aggregate rate into subgroup rows, each with its own denominator, so subgroup-conditioned probabilities are compared side by side without the marginal hiding them.
• Temporal-Difference Update — Treats the signed gap between expected and realized value as a teaching signal, nudging value or policy estimates one step at a time as outcomes unfold — without waiting for the final result.
• Trajectory Ensemble Simulation — Generates many complete sample paths from the process model to reveal the full range of ways the future could actually unfold.
• Two-by-Two Probability Table — Lays two binary variables into four joint cells so P(A given B) and P(B given A) are computed from the same grid and can never be confused for each other.
• Uncertainty Propagation Model — Propagates uncertainty from input distributions through equations, process logic, or empirical models into output distributions.

Quality Assurance & Release

Solutions that verify fitness, coverage, conformance, and readiness before an output is accepted, shipped, or trusted downstream.

4 mechanisms · View full solution family

• Advection-Diffusion or Transport Modeling — Predicts how much of an input reaches the target — and how much washes out or piles up along the way — by modeling its advective and diffusive transport through the delivery path.
• Exposure Dose Curve — Maps how response changes across the full range of an input — from no effect, through the useful zone, to diminishing returns and harm — so any single level can be read off the curve.
• Inspection Cost-of-Quality Model — Compares prevention, appraisal, internal-failure, and external-failure costs to justify how much inspection to run and where to place it.
• Route–Form–Timing Optimization — Raises the fraction that arrives usable by changing how the input is delivered — its route, its form, and its timing — instead of increasing the amount supplied.

Recovery & Restoration

Solutions that return a damaged, degraded, or interrupted system to service through repair, rollback, reentry, regeneration, or reconstruction.

5 mechanisms · View full solution family

• Close Reading Table — Slows a reading to the level of the single mark — annotating each word, image detail, or gesture for what it does and the convention it invokes — before any larger framework is imported.
• Coherence Decay Curve — Estimates how fast a relational state degrades with exposure time, intensity, and context, and turns the crossing points into warning and action margins.
• Context Reconstruction Worksheet — Rebuilds the situation a text or act came from — its speaker, audience, moment, and the conventions then in force — so the reading is bound to the meaning it had there rather than the one it suggests now.
• Pragmatic Force Walkthrough — Recovers what an utterance is doing — asserting, ordering, promising, warning, joking — by walking its literal content through the situation and conventions that fix its force.
• Precedent Comparison Table — Bounds a reading by laying the current case beside authoritative prior readings and mapping, feature by feature, which precedent it actually resembles.

Redundancy & Fault Tolerance

Solutions that preserve service when parts fail by duplicating capability, diversifying failure modes, or providing independent alternate paths.

3 mechanisms · View full solution family

• Common-Cause FMEA — Extends failure mode and effects analysis by asking which single causes could defeat multiple redundant elements or controls at once.
• Diverse Data Source Triangulation — Combines independent data sources with different collection methods or bias profiles so the same informational function is not dependent on one fragile source.
• Fault Tree with Common-Cause Branching — Decomposes a top-level failure through logic gates to its basic causes, then adds shared-cause branches so a single event feeding several 'independent' paths becomes visible.

Reframing & Sensemaking

Solutions that change the interpretive frame, surface hidden assumptions, or organize ambiguous experience into a more useful account.

32 mechanisms · View full solution family

• Actor-Perspective Analysis — Reconstructs the situation from the standpoint of the actors, using their likely knowledge, incentives, risks, categories, roles, and constraints.
• Baseline Reference Swap — Re-expresses the same figure against different baselines, denominators, and comparison classes to reveal how much of a judgment rides on the chosen reference point rather than the underlying quantity.
• Close Reading Protocol — Uses structured attention to local language, form, sequence, and context to test and revise an interpretation.
• Closest-World Ranking Table — Orders candidate counterfactual worlds from nearest to farthest by how little they gratuitously depart from the actual world, dropping the incoherent ones.
• Counter-Narrative Comparison — Places the dominant grand narrative beside one or more alternative accounts to test focalization, causality, omitted actors, and scope.
• Counterfactual Sensitivity Matrix — Scores a set of alternative branches on fixed dimensions — plausibility, evidence support, scale-boundedness, and outcome-relevance — to separate the load-bearing counterfactuals from the merely vivid ones.
• Cross-Layer Scenario Comparison — Builds and compares alternative futures, each constructed by letting a different worldview or governing myth dominate, to reveal how the space of possible action shifts with the frame.
• Cross-Medium Scale Normalization — Translates a proportion system using perceptual, functional, and production anchors instead of one global multiplication factor.
• Disconfirming Condition Probe — Hunts for the observation that would count against the claim, and states the update the claim must undergo if that observation appears.
• Discourse / Worldview Analysis Memo — An analytic document that maps the assumptions, categories, and legitimating arguments of the frame already governing an issue — its origins and the rival frames it crowds out.
• Double-Bind Analysis — Diagnoses a communication or authority trap in which every available response is punishable, by exposing the level confusion between a message and the message about the message.
• Experience Prediction Matrix — Tabulates the experiences each rival claim predicts, exposing the conditions under which their predictions diverge.
• Failed-Search and Helpdesk Query Analysis — Mines the searches that returned nothing and the support tickets asking for things that already exist, reading them as recorded evidence of capabilities users wanted but couldn't find.
• Instrument Readout Mapping — Fixes the correspondence rule that says which instrument reading counts as which value of the property, extending sense-experience through a device.
• Legal Interpretation Memo — Documents candidate readings, governing context, precedent tensions, coherence tests, and remaining ambiguity.
• Level-of-Analysis Shift — Relocates a contradiction across levels of scale, system, or time until it reaches a level where the two claims no longer collide, then restates the problem there.
• Local / Global Analysis — Contrasts local cases, subgroups, or sites with aggregate system behavior so local variation and global trends can be interpreted together rather than confused.
• Media Framing Analysis — Compares public accounts for differences in framing, source selection, headline implication, causal emphasis, and omitted context.
• Micro / Meso / Macro Analysis — Compares individual or unit-level evidence, intermediate organizational or network patterns, and broad system-level behavior to locate the level at which the decisive pattern appears.
• Minimal-Difference Matrix — Lays actual against candidate worlds cell by cell so the single, smallest set of differing facts is visible at a glance.
• Multi-Observer Dependency Matrix — Lays observers side by side to separate genuine agreement from shared data, instruments, training, and incentives that only look like independent corroboration.
• Norm-Conflict Matrix — Lays the artifact's built-in assumptions against the host norm system dimension by dimension, so clashes become an explicit grid instead of vague unease.
• Organizational Level Analysis — Reframes workplace problems across individual, role, team, process, unit, enterprise, and ecosystem levels to avoid assigning causes at the wrong layer.
• Paired Micro/Macro Case Study — Analyzes one phenomenon twice — as a close case narrative and as an aggregated structural account — then produces an explicit ledger of what each resolution reveals and hides.
• Parameter Sweep Matrix — Systematically varies parameters, scale, or input conditions across a grid to locate the breakpoint where agreement gives way to divergence.
• Parametric Dimension-Constraint Model — Encodes ratios, limits, dependencies, and exception parameters so dependent dimensions update coherently.
• Polarity Mapping — Treats the contradiction as a permanent tension between two interdependent goods to be governed over time, not a problem to be solved once.
• Power-Effect Mapping — Marks how the story legitimates some actors, normalizes some outcomes, delegitimizes others, and makes certain alternatives seem unthinkable.
• Randomized Response or Privacy-Preserving Survey — Injects known random noise into each individual answer so that no single response reveals the person's true state, yet the population prevalence can still be recovered by removing the noise statistically.
• Ratio Ladder and Modular Scale — Generates a bounded sequence of related sizes from a base module and selected multiplier.
• Representation Fit Scorecard — Scores how well each candidate representation preserves the problem-first need across explicit fit dimensions, making tool choices comparable instead of habitual.
• Zoom-In / Zoom-Out Diagnosis — Deliberately narrows and widens the view of a problem, using each movement to ask what becomes visible, invisible, overemphasized, or actionable.

Representation & Modeling

Solutions that construct schemas, models, diagrams, abstractions, or formal descriptions that make structure available for reasoning.

109 mechanisms · View full solution family

Because this form-and-solution-family intersection contains more than 100 mechanisms, it is further divided by solution archetype.

Archetype overview

Solution archetype	Mechanisms	Description
Additive Measure-Space Design	2	Make size assignable and composable by declaring what subsets are measurable and how disjoint sizes add.
Coherent Linear Space Design	1	Declare a carrier, scalars, and linear operations so adding, scaling, decomposing, and interpolating elements have stable meaning.
Complement Space Mapping	2	Declare the universe, define the focal subset, and treat everything outside it as an explicit complement instead of an unexamined leftover.
Constraint Formulation	1	Turn implicit limits, requirements, and prohibitions into explicit constraints that shape the feasible solution space.
Discrete–Continuous Model Selection	5	Choose whether to model a process as discrete steps or continuous flow based on what must be measured, controlled, or decided.
Divergence-Convergence Cycle Orchestration	4	Alternate protected option expansion with evidence-led narrowing, using explicit gates and reopening rules so creativity and commitment strengthen rather than sabotage each other.
Emergent Similarity Partitioning	1	Find provisional groups by similarity when labels are not given, then validate and interpret the partition before using it.
Essentialism Audit	1	Audit fixed-essence assumptions so categories, people, groups, roles, or artifacts are not explained as if they have an inherent nature when variability and context matter.
Event-Log-Centered Modeling	3	Preserve happenings as the primary record and derive entity state, relationships, places, periods, timelines, and summaries as reproducible projections of the governed event log.
Evidence-Grounded Persona Proxy Design	1	Turn complex user or stakeholder evidence into a memorable persona proxy while preserving the boundary, provenance, uncertainty, and refresh rules that keep the proxy honest.
Exhaustive Disjoint Partition Design	2	Turn a whole into named blocks that cover everything once and only once.
Generated Span Closure Design	3	Declare the primitives and allowed operations, then make the whole generated possibility space explicit and auditable.
Grammar-Guided Structure Recovery	4	Recover the nested structure carried by a flat sequence by binding the input to a grammar, preserving spans, retaining competing parses when needed, and validating the selected hierarchy.
Implicit Assumption Surfacing	1	Make hidden assumptions explicit so they can be tested, revised, documented, or deliberately preserved.
Incompatible Requirement Set Resolution	6	When individually defensible commitments cannot all hold together, prove and localize the incompatibility, choose the smallest legitimate relaxation, and publish the guarantees and losses that remain.
Independent Generating Set Design	12	Define the space and combination rules, then choose the smallest independent set of generators that covers it completely and yields stable, unique, transformable coordinates.
Independent Generator Validation	8	Keep a generator set honest by testing whether every retained member contributes a direction, signal, or degree of freedom that the others cannot reproduce.
Inductive Validity Extension	1	Validate that a rule, guarantee, or process that works in a base case continues to hold as it extends step by step, recursively, or at larger scale.
Informal Structure Mapping	2	Reveal the unofficial relationships, workarounds, and influence paths that determine how work actually gets done.
Mental Model Mismatch Repair	1	Detect and repair mismatches between a person's mental model and how the system actually behaves.
Metric-Space Specification and Validation	3	Turn vague closeness into a validated distance function before using near/far relationships to search, cluster, route, threshold, or reason locally.
Network Motif and Pattern Discovery	6	Discover functionally meaningful recurring local graph structures by comparing observed subgraphs to suitable baselines.
Observational Equivalence Resolution	3	Resolve cases where different causes, states, agents, or models produce the same observations by adding discriminating observations, shifting frame, or preserving explicit ambiguity.
Phase-Space Mapping	3	Map possible system states and trajectories so reachable, forbidden, stable, and risky regions become visible.
Predicate Criterion Formalization	1	Make a vague condition usable by turning it into a domain-bound yes/no test with evidence, edge-case, and review rules.
Relational Grounding Verification	3	Verify whether an apparently absolute property is actually grounded in relations to a wider context, reference frame, measurement system, schema, or dependency field.
Representation-Invariant Reasoning	5	Identify equivalent descriptions, isolate what remains invariant, choose convenient representatives without mistaking them for reality, and verify that conclusions survive legitimate changes of gauge, coordinates, basis, encoding, or frame.
Reversible Operation Structure Design	2	Design the admissible operations of a system as a closed, associative, identity-bearing, invertible structure so composition and reversal stay reliable.
Shared Subset Intersection Mapping	1	Declare the collections and identity rule, then extract the elements common to all of them as a traceable shared subset.
Solution Space Bounding	1	Bound a potentially unbounded or enormous solution space so search becomes possible.
Stakeholder Mapping and Engagement	1	Identify affected and influential parties, then engage them according to their stakes, legitimacy, and decision relevance.
Structural Inversion Design	3	Reverse a declared structure under explicit invariants, recoverability, boundary, and round-trip rules.
Structure-Preserving Embedding Design	3	Embed a source system into a richer host so the source remains distinguishable, structurally faithful, and usable inside the host rather than merely translated or compressed.
Superposition Modeling and Interference Analysis	5	Combine compatible constituents under a validated linear rule and trace how coefficients, phase, measurement, and boundaries shape the observable whole.
Symbol-System Coherence in Visual Art	1	Keep the same visual sign pointing to the same intended meaning unless the work makes the change visible and purposeful.
Tacit Knowledge Elicitation	2	Draw out expert know-how that is used in practice but not yet articulated.
Textual Close-Reading Mode	3	Suspend premature paraphrase, inspect the artifact at its meaningful grain, and bind every larger interpretation to exact marks, relations, repetitions, placements, and omissions.
Universality Extraction	2	Compare heterogeneous cases, vary alleged incidental details, and extract the smallest actionable macro-structure that survives—together with the class and boundaries within which it transfers.

Additive Measure-Space Design

Make size assignable and composable by declaring what subsets are measurable and how disjoint sizes add.

2 mechanisms · View full solution archetype

• Normalization Constant Calibration — Sets or resets the scale anchor — total mass, unit, or probability total — that turns raw additive sizes into comparable, interpretable values.
• Probability Measure Construction — Builds a measure specialized to uncertainty — the whole space normalized to total mass one, disjoint events additive, each subset read as the probability of an event.

Coherent Linear Space Design

Declare a carrier, scalars, and linear operations so adding, scaling, decomposing, and interpolating elements have stable meaning.

1 mechanism · View full solution archetype

• Linear-Combination Membership Test — Decides whether a target element is reachable as an admissible linear combination of a given set — and returns the coefficients when it is.

Complement Space Mapping

Declare the universe, define the focal subset, and treat everything outside it as an explicit complement instead of an unexamined leftover.

2 mechanisms · View full solution archetype

• Inclusion/Exclusion Matrix — A grid of cases against criteria where every cell is an in-or-out mark, so a case caught by both an inclusion and an exclusion rule lights up as a conflict instead of hiding.
• Set-Difference Query — Computes the complement as data — takes the universe table minus the focal-subset rows and returns the actual out-of-set records, one row at a time.

Constraint Formulation

Turn implicit limits, requirements, and prohibitions into explicit constraints that shape the feasible solution space.

1 mechanism · View full solution archetype

• Optimization Constraint Model — Represents variables and constraints in a mathematical or computational model so solvers or analysts can search the feasible region.

Discrete–Continuous Model Selection

Choose whether to model a process as discrete steps or continuous flow based on what must be measured, controlled, or decided.

5 mechanisms · View full solution archetype

• Continuous Process Model — Represents change as smooth rates, flows, and gradients over time, so accumulation and gradual drift stay visible instead of collapsing into discrete events.
• Discrete Event Model — Represents a changing system as discrete events that occur at identifiable times and update state, so arrivals, handoffs, and jumps stay visible instead of dissolving into averages.
• Hybrid Discrete–Continuous Model — Represents a system as continuous variables evolving inside discrete modes, with explicit rules for when an event resets or redirects the flow.
• Quantization Rule — Converts a continuous value into bins, tiers, or categories with defined cut points, trading gradation for actionable, communicable levels.
• Sampling Interval Choice — Sets how often a fast-changing process is observed so the model captures the transitions that matter without drowning in noise or cost.

Divergence-Convergence Cycle Orchestration

Alternate protected option expansion with evidence-led narrowing, using explicit gates and reopening rules so creativity and commitment strengthen rather than sabotage each other.

4 mechanisms · View full solution archetype

• Assumption Reversal and Recombination — Generates structurally different options by naming a design's load-bearing assumptions, negating them, and recombining the fragments — so breadth comes from reframing, not from decorating one idea.
• Morphological Matrix, then Scoring — Decomposes a design into independent parameters, enumerates the grid of parameter-value combinations to force complete coverage, then scores the viable combinations — so generation is exhaustive before selection begins.
• Multi-Criteria Decision Matrix — Scores every shortlisted option against every weighted criterion in one matrix and sums to a ranking — making the trade-offs, the weights, and who owns them explicit and auditable rather than intuitive.
• Pairwise Option Comparison — Decomposes a hard many-option choice into a series of simple A-versus-B judgments, then assembles them into a ranking that also exposes inconsistent preferences.

Emergent Similarity Partitioning

Find provisional groups by similarity when labels are not given, then validate and interpret the partition before using it.

1 mechanism · View full solution archetype

• Embedding-Then-Clustering Pipeline — Represents cases as learned embedding vectors and clusters them in that space, so groups emerge from semantic proximity rather than hand-picked attributes.

Essentialism Audit

Audit fixed-essence assumptions so categories, people, groups, roles, or artifacts are not explained as if they have an inherent nature when variability and context matter.

1 mechanism · View full solution archetype

• Variability Analysis — Measures within-category spread, between-category overlap, subgroup differences, and interaction effects — and checks whether an apparent group difference is a measurement artifact — to show a fixed-essence claim does not fit the data.

Event-Log-Centered Modeling

Preserve happenings as the primary record and derive entity state, relationships, places, periods, timelines, and summaries as reproducible projections of the governed event log.

3 mechanisms · View full solution archetype

• Entity-Trajectory Projection — Derives one entity's path through time by gathering every event it took part in — resolving its identity across records and stitching cross-referenced layers into a single ordered trajectory.
• Periodization Projection — Derives named periods from the event log by cutting the timeline at the transformations that mark one regime turning into the next.
• Process Mining / Trace Analysis — Reconstructs the real process from event traces — discovering the actual control flow, its variants, and where reality deviates from the intended path — that the log reveals but no diagram admits.

Evidence-Grounded Persona Proxy Design

Turn complex user or stakeholder evidence into a memorable persona proxy while preserving the boundary, provenance, uncertainty, and refresh rules that keep the proxy honest.

1 mechanism · View full solution archetype

• Interview Cluster Synthesis — Groups qualitative observations into recurring need, constraint, behavior, context, or motivation clusters before composing the persona.

Exhaustive Disjoint Partition Design

Turn a whole into named blocks that cover everything once and only once.

2 mechanisms · View full solution archetype

• Equivalence-Class Partition Derivation — Builds the partition from an equivalence relation, so that disjoint blocks and full coverage are guaranteed by the relation's own properties rather than checked by hand.
• Graph-Coloring Partition Assignment — Assigns units to blocks so that any two units that must not share a block never do, using the fewest blocks the conflict structure allows.

Generated Span Closure Design

Declare the primitives and allowed operations, then make the whole generated possibility space explicit and auditable.

3 mechanisms · View full solution archetype

• Bounded Depth Generation Template — Generates all expressions up to a fixed operation depth and labels the result a truncated approximation, never a complete span.
• Closure Generation Workflow — Repeatedly applies the admissible operations to generators and their products until no new element appears, constructing the closed reachable set.
• Dependency Elimination Test — Tests whether each generator already lies in the span of the others, dropping the redundant ones down to a minimal generating set.

Grammar-Guided Structure Recovery

Recover the nested structure carried by a flat sequence by binding the input to a grammar, preserving spans, retaining competing parses when needed, and validating the selected hierarchy.

4 mechanisms · View full solution archetype

• Chart Parsing — Recovers every licensed parse at once by tabulating partial constituents in a chart and reusing shared sub-analyses, turning ambiguous input into polynomial-time work.
• Probabilistic Grammar Parsing — Weights grammar rules with probabilities and returns a ranked forest of candidate parses with a most-likely tree and a calibrated confidence, treating disambiguation as inference rather than a fixed rule.
• Recursive-Descent Parsing — Turns each grammar rule into a procedure and lets the call stack mirror the parse, recovering structure top-down by predicting which rule applies next.
• Shift-Reduce Parsing — Builds the parse tree bottom-up with a stack and a parse table — shifting tokens until a rule's right-hand side is complete, then reducing it, resolving attachment conflicts by declared precedence.

Implicit Assumption Surfacing

Make hidden assumptions explicit so they can be tested, revised, documented, or deliberately preserved.

1 mechanism · View full solution archetype

• Counterfactual Assumption Test — Asks what would change if a key assumption were false, reversed, or only locally true.

Incompatible Requirement Set Resolution

When individually defensible commitments cannot all hold together, prove and localize the incompatibility, choose the smallest legitimate relaxation, and publish the guarantees and losses that remain.

6 mechanisms · View full solution archetype

• Constraint-Satisfaction Solver Pass — Encodes the commitments as a formal constraint model and runs a solver that propagates them to a reduced feasible region — or mechanically detects that no joint solution exists.
• Minimal Unsatisfiable Core Extraction — Given a set already proven to have no joint solution, strips it down to a smallest subset that is still unsatisfiable — the irreducible knot of commitments that actually clash.
• Pareto Frontier Analysis — Maps the frontier of non-dominated designs among competing objectives, exposing the exchange rate between them so a priority choice can be made with eyes open instead of chasing an impossible all-at-once optimum.
• SAT/SMT Satisfiability Check — Encodes the whole commitment set as logical formulas and lets an automated solver decide, once and for all, whether any joint assignment satisfies them — returning a concrete witness or reporting that none exists.
• Scenario Sensitivity Sweep — Varies the uncertain inputs across plausible scenarios to learn whether the incompatibility is robust or an artifact of one assumption — and which assumptions, if they moved, would flip the verdict.
• Weighted MaxSAT or Soft-Constraint Optimization — When the commitments can't all hold, splits them into hard constraints that must never break and weighted soft ones, then computes the assignment that keeps every hard constraint while sacrificing the least-valuable softs.

Independent Generating Set Design

Define the space and combination rules, then choose the smallest independent set of generators that covers it completely and yields stable, unique, transformable coordinates.

12 mechanisms · View full solution archetype

• Basis Extraction from a Spanning Set — Given a redundant set that already covers the space, prunes it to a maximal independent subset that still covers everything — turning a pile of generators into an actual basis.
• Data-Adapted Basis Learning — Learns the basis from the data itself — fitting a small set of generators that reconstruct the observed objects with as few, as sparse, or as interpretable coefficients as possible.
• Dual-Basis Transform — Re-expresses the same object in a complementary (dual) basis so that questions that are hard in one representation become easy in the other.
• Finite-Element Basis Construction — Builds a basis for a function space out of many simple, locally-supported shape functions tied to a mesh, turning a complicated field over a domain into a finite list of nodal coordinates.
• Fourier-Basis Expansion — Represents any signal in a fixed, universal orthonormal basis of sinusoids, turning it into frequency coordinates that reconstruct it exactly.
• Full-Rank Eigendecomposition — Factors a square operator into its own eigenbasis, yielding a complete set of directions the operator merely rescales — and, when full-rank, a basis that spans the whole space.
• Gram–Schmidt Orthonormalization — Turns any independent set of vectors into an orthonormal basis for the same span by projecting each new vector off the ones already accepted and normalizing the remainder.
• Independent-Seed Basis Extension — Grows a partial, already-independent set into a complete basis by repeatedly adding only directions the current set cannot already reach.
• Modal Basis Identification — Identifies a system's natural modes — its characteristic shapes of motion, each with its own frequency — as a small, physically interpretable basis for how it behaves.
• Pivoted Row Reduction — Runs elimination with pivoting to expose a maximal independent subset of columns as an exact basis, discarding the rest as redundant and reading the rank straight off the pivots.
• Rank-Revealing QR Factorization — Orthogonalizes a matrix with column pivoting so the most independent, best-conditioned columns are chosen first as the basis and the numerical rank shows up as a break in the diagonal.
• Singular-Value Rank Diagnosis — Reads a matrix's effective rank from its singular-value spectrum, counting the values above a chosen tolerance as the number of genuinely independent directions.

Independent Generator Validation

Keep a generator set honest by testing whether every retained member contributes a direction, signal, or degree of freedom that the others cannot reproduce.

8 mechanisms · View full solution archetype

• Basis-Candidate Pruning Workflow — Walks a bloated candidate set down to a minimal independent core by cutting each member a dependency witness shows the rest already reproduce, re-testing after every single cut.
• Feature Collinearity Heatmap — Renders every pairwise association in a candidate set as a colour grid so near-duplicate members light up at a glance — a fast visual screen for redundancy before any model is fit.
• Gaussian Elimination Pivot Check — Row-reduces the candidate set to echelon form: the pivot columns are the independent members, and every non-pivot column arrives with the exact combination that rebuilds it.
• Gram-Schmidt Orthogonalization Trace — Feeds candidates in one at a time, subtracting the part each is already explained by the ones before it, so the leftover residual measures exactly how much new direction that member adds.
• Nullspace Dependency Certificate — Produces an explicit witness — the exact combination of candidates that cancels to nothing — proving one member is reconstructable from the others rather than merely scoring it as suspect.
• Rank-Revealing Decomposition — Factors the whole candidate set at once to read off how many independent directions it actually contains and which members form a spanning basis.
• Residualization Contribution Test — Regresses each candidate on all the others and keeps the residual, so what remains is exactly the part of that candidate the rest cannot reproduce.
• Singular-Value Threshold Scan — Reads the candidate set's singular-value spectrum and sets a tolerance below which a direction counts as noise, turning near-dependence into a numerical rank.

Inductive Validity Extension

Validate that a rule, guarantee, or process that works in a base case continues to hold as it extends step by step, recursively, or at larger scale.

1 mechanism · View full solution archetype

• Induction Proof — Implements the archetype in formal domains by proving a base case and showing that truth at one step implies truth at the next step.

Informal Structure Mapping

Reveal the unofficial relationships, workarounds, and influence paths that determine how work actually gets done.

2 mechanisms · View full solution archetype

• Informal Leader Mapping — Identifies and profiles the specific people who carry trust, advice, escalation, translation, or practical influence outside the formal hierarchy, tracing the authority that actually routes through them.
• Organizational Network Analysis — Builds a graph of advice, trust, information, and collaboration ties from relationship data, then analyzes its structure to expose brokers, isolates, and structural holes.

Mental Model Mismatch Repair

Detect and repair mismatches between a person's mental model and how the system actually behaves.

1 mechanism · View full solution archetype

• User Journey Diagnostics — Traces a whole sequence of touchpoints to find where a wrong expectation accretes, mapping the assumptions that build up when no single screen or message created the mismatch alone.

Metric-Space Specification and Validation

Turn vague closeness into a validated distance function before using near/far relationships to search, cluster, route, threshold, or reason locally.

3 mechanisms · View full solution archetype

• Distance-Choice Sensitivity Analysis — Perturbs the distance function and measures how much the resulting neighborhoods and decisions move, exposing conclusions that depend on an arbitrary metric choice.
• Graph Shortest-Path Metric — Defines distance as the shortest weighted path through a graph, so separation reflects real traversal structure rather than straight-line proximity.
• Triangle-Inequality Counterexample Search — Hunts for triples whose direct distance exceeds a detour, proving a candidate score violates the triangle inequality and is not a true metric.

Network Motif and Pattern Discovery

Discover functionally meaningful recurring local graph structures by comparing observed subgraphs to suitable baselines.

6 mechanisms · View full solution archetype

• Canonical Adjacency Encoding — Rewrites each subgraph into a relabeling-invariant key so structurally identical motifs collapse to one canonical form that can be indexed and matched.
• Graph Motif Mining Algorithm — Automates the search for recurrent subgraphs — taking a motif grammar and enumerating or sampling candidate instances at scale so discovery is systematic rather than eyeballed.
• Motif Enrichment Table — Lays observed against expected motif counts with effect size, uncertainty, and multiple-comparison control, turning a pile of counts into a defensible enrichment verdict and a cross-network profile.
• Random Graph Null Ensemble — Generates a population of synthetic comparison graphs from a chosen generative model to estimate how often each motif would appear by chance, together with its variance.
• Subgraph Census — Exhaustively enumerates every subgraph of a fixed size and tallies how often each canonical shape occurs, producing the complete observed-frequency table.
• Temporal Sliding-Window Motif Scan — Slides a time window across a dynamic network to track when temporal motifs appear, fade, and shift regime, so recurrence is read as a time series rather than a single total.

Observational Equivalence Resolution

Resolve cases where different causes, states, agents, or models produce the same observations by adding discriminating observations, shifting frame, or preserving explicit ambiguity.

3 mechanisms · View full solution archetype

• Causal Identification Probe — Separates rival causal stories for the same outcome by pairing the predictions each makes over naturally occurring variation, then reading which pattern the world actually shows.
• Forensic Discriminator — Resolves which generator produced a shared observation by hunting for a trace that only one candidate would have left behind.
• Frame-of-Reference Shift — Breaks an observational tie by re-viewing the same evidence from a different scale, grouping, or reference point, so a difference invisible in the original frame becomes visible.

Phase-Space Mapping

Map possible system states and trajectories so reachable, forbidden, stable, and risky regions become visible.

3 mechanisms · View full solution archetype

• Attractor Basin Analysis — Identifies regions that tend to pull system trajectories toward stable patterns, loops, equilibria, or recurrent behavior.
• Reachability Analysis — Tests which states can be reached from current conditions under available controls and constraints.
• Scenario State Map — Maps how different assumptions or futures change reachable states, transition paths, and intervention opportunities.

Predicate Criterion Formalization

Make a vague condition usable by turning it into a domain-bound yes/no test with evidence, edge-case, and review rules.

1 mechanism · View full solution archetype

• SQL WHERE Clause or Query Filter — Selects the subset of a population that satisfies the predicate, turning a criterion into set membership over stored records.

Relational Grounding Verification

Verify whether an apparently absolute property is actually grounded in relations to a wider context, reference frame, measurement system, schema, or dependency field.

3 mechanisms · View full solution archetype

• Counterfactual Relation Probe — Counterfactually removes a single suspected relation to see whether a claimed property survives its loss, isolating dependence one relation at a time.
• Reference-Frame Matrix — Lays a claim's properties against every relevant reference frame at once, so which are intrinsic and which are frame-relative becomes visible at a glance.
• Schema Context Diff — Diffs a schema or ontology across two contexts to expose where the 'same' field silently means different things.

Representation-Invariant Reasoning

Identify equivalent descriptions, isolate what remains invariant, choose convenient representatives without mistaking them for reality, and verify that conclusions survive legitimate changes of gauge, coordinates, basis, encoding, or frame.

5 mechanisms · View full solution archetype

• Coordinate or Basis Transformation — Translates quantities and relations between coordinate systems, frames, bases, or encodings.
• Gauge-Fixing Condition — Adds a disciplined representative-selection condition that removes specified redundant freedom without changing invariant content.
• Quotient-Space Construction — Represents the state space as equivalence classes rather than as every redundant description.
• Redundant-Variable Elimination — Removes non-identifiable directions after their transformation relationship and recovery path are established.
• Reference-Frame Sweep — Repeats analysis across selected frames or gauges to expose arbitrary-choice dependence.

Reversible Operation Structure Design

Design the admissible operations of a system as a closed, associative, identity-bearing, invertible structure so composition and reversal stay reliable.

2 mechanisms · View full solution archetype

• Group Action Model — Models an abstract group as acting on an external domain — each group element becomes a structure-preserving transformation of the states — so reachability and invariants can be read off the action.
• Rewrite and Cancellation Trace — Simplifies a long operation sequence step by step — regrouping under associativity and cancelling adjacent inverse pairs to the identity — leaving an auditable trace of how it reduced.

Shared Subset Intersection Mapping

Declare the collections and identity rule, then extract the elements common to all of them as a traceable shared subset.

1 mechanism · View full solution archetype

• N-Way Intersection Query — Computes the elements present in all N participating collections at once, as a single symmetric set operation over identity-matched members.

Solution Space Bounding

Bound a potentially unbounded or enormous solution space so search becomes possible.

1 mechanism · View full solution archetype

• Finite Horizon Assumption — Truncates an effectively unbounded time or depth axis at a defined horizon, so a search, forecast, or valuation can be computed instead of chased to infinity.

Stakeholder Mapping and Engagement

Identify affected and influential parties, then engage them according to their stakes, legitimacy, and decision relevance.

1 mechanism · View full solution archetype

• Influence/Interest Grid — A two-by-two artifact that plots each stakeholder by how much they are affected and how much they can shape the outcome, and reads an engagement posture off the quadrant.

Structural Inversion Design

Reverse a declared structure under explicit invariants, recoverability, boundary, and round-trip rules.

3 mechanisms · View full solution archetype

• Algebraic Inverse Construction — Derives the inverse of a formalizable mapping symbolically — fixing its valid domain, branch choices, and singular points — so the operator restores inputs by composition rather than merely resembling a reversal.
• Backward-Chaining Reconstruction — Reasons backward from an observed output through the rules that could have produced it, yielding a bounded set of candidate sources rather than one arbitrarily chosen preimage.
• Inside-Out / Outside-In Reframing Matrix — Lays the same structure out as both an inside-out and an outside-in description in one matrix, then checks cell by cell whether the reframing preserved meaning or quietly changed it.

Structure-Preserving Embedding Design

Embed a source system into a richer host so the source remains distinguishable, structurally faithful, and usable inside the host rather than merely translated or compressed.

3 mechanisms · View full solution archetype

• Coordinate Chart Mapping — Covers a source too curved or complex for one global frame with a family of local coordinate charts, each faithful on its own patch and stitched to its neighbors where they overlap.
• Graph Embedding — Maps the nodes of a relational graph to points in a host space so that connected or structurally similar nodes land near each other, turning topology into geometry.
• Vector Embedding Model — Places source items as points in a continuous host space and picks the metric that makes geometric distance stand in for a chosen relation, so structure becomes something the host can compute.

Superposition Modeling and Interference Analysis

Combine compatible constituents under a validated linear rule and trace how coefficients, phase, measurement, and boundaries shape the observable whole.

5 mechanisms · View full solution archetype

• Basis Expansion and Projection — Expresses a state as coordinates in a chosen basis by projection, then checks how completely the basis reconstructs it.
• Mode Decomposition and Recomposition — Separates a measured composite into modes, rebuilds it, and reports how uniquely the constituents can be recovered.
• Phasor or Complex-Amplitude Addition — Adds oscillations as complex amplitudes so relative magnitude and phase survive the sum instead of being discarded.
• Vector Linear-Combination Construction — Builds a composite by scaling valid constituent states and adding them under the space's lawful combination rule.
• Wave Superposition Simulation — Computes the combined wave field over space and time by superposing individual solutions on a discretized domain.

Symbol-System Coherence in Visual Art

Keep the same visual sign pointing to the same intended meaning unless the work makes the change visible and purposeful.

1 mechanism · View full solution archetype

• Motif Continuity Matrix — Tracks how motifs recur across images, scenes, products, panels, rooms, or episodes and whether their meaning remains stable.

Tacit Knowledge Elicitation

Draw out expert know-how that is used in practice but not yet articulated.

2 mechanisms · View full solution archetype

• Cognitive Task Analysis — Systematically decomposes a whole judgment-heavy task into the goals, cues, strategies, and decision points that drive it, producing a structured knowledge model that another practitioner could reproduce.
• Critical Incident Technique — Collects and dissects the rare high-information episodes — successes, failures, and near misses — where routine behavior broke, because those are the moments that reveal the judgment ordinary descriptions leave out.

Textual Close-Reading Mode

Suspend premature paraphrase, inspect the artifact at its meaningful grain, and bind every larger interpretation to exact marks, relations, repetitions, placements, and omissions.

3 mechanisms · View full solution archetype

• Diction, Syntax, and Punctuation Trace — Follows the load-bearing formal features — word choice, grammatical attachment, modality, negation, punctuation, and scope — wherever a small difference could change duty, agency, timing, or certainty.
• Motif Concordance and Recurrence Map — Indexes every occurrence of a chosen term or form and maps how its sense shifts from one appearance to the next, so recurrence is read as movement rather than counted as frequency.
• Parallel-Passage Comparison — Lines a passage up against comparable passages to learn whether a word, formula, or omission is conventional or exceptional before any weight is placed on it.

Universality Extraction

Compare heterogeneous cases, vary alleged incidental details, and extract the smallest actionable macro-structure that survives—together with the class and boundaries within which it transfers.

2 mechanisms · View full solution archetype

• Invariant Signature Induction — Iteratively proposes the smallest relational signature that explains a recurring macro behavior across aligned cases.
• Relational Case Normalization — Re-encodes heterogeneous cases as roles, relations, transformations, and boundary conditions so structural comparison is possible.

Resource Efficiency & Conservation

Solutions that reduce waste, preserve scarce stocks, recover usable value, or improve the useful output obtained from finite resources.

13 mechanisms · View full solution family

• Comparative LCA Model — Models the full physical resource burden — embodied, operating, replacement, end-of-life — of an efficient option against its counterfactual, per unit of service, so a smaller operating footprint isn't bought with a bigger hidden one.
• Compartment Model — Abstracts a system into a few well-bounded compartments linked by transfer rates, so accumulation and turnover follow from residence times instead of being watched flow by flow.
• Control Group Comparison — Compares treated units against otherwise-similar untreated ones to recover what total use would have been without the efficiency program — separating the real saving from the rebound and from what would have happened anyway.
• Embodied-Resource Payback Test — Checks whether the resource embodied in replacing or upgrading equipment is actually repaid by the in-use savings within the equipment's life — after real-world rebound is counted.
• Entropy-Generation or Loss-Rate Calculation — Quantifies loss rates for candidate hotspots using available thermodynamic, operational, or accounting data.
• Exergy or Available-Work Analysis — Compares the maximum useful work implied by input conditions with the useful work actually obtained.
• Full-Cost Accounting — Pulls the upstream, downstream, social, and environmental costs an efficiency decision leaves off-ledger back onto it — so the choice is judged on its full resource burden, not just the metered operating bill.
• Mass-Balance Table — Lays every measured inflow and outflow of a conserved quantity into one ledger so inputs minus outputs must equal the change in stock — and any residual is flagged, not buried.
• Material Flow Analysis — Traces a conserved substance across a defined system — inputs, stocks, transfers, and outputs — so every unit is accounted for from source to sink.
• Rebound Scenario Stress Test — Runs the efficiency intervention through a spread of rebound scenarios — from negligible to full backfire — before scaling, to see whether the intended saving survives the bad cases.
• Rebound-Leakage Boundary Review — Re-runs the efficiency outcome at successively wider category, supply-chain, geographic, and time boundaries to expose rebound that was merely exported or delayed past the original accounting line.
• System Dynamics Simulation — Turns a stock-and-flow structure into equations and runs it forward in time, so you can watch reservoirs fill, drain, and oscillate under a policy before trying it for real.
• Water or Resource Budget — Balances a specific resource over a defined boundary and period — sources in versus uses and losses out, against available storage — to see whether the account closes and whether it is over-committed.

Risk, Robustness & Uncertainty

Solutions that make uncertainty explicit, limit downside, preserve acceptable behavior across variation, or prepare contingencies for adverse outcomes.

34 mechanisms · View full solution family

• Actuarial Risk Model — Uses historical frequency, exposure, and cohort patterns to estimate expected loss and allocate premiums, reserves, safeguards, or inspection effort.
• Age-Conditioned Remaining-Life Table — Reads off expected remaining life given survival to the current age, so persistence is forecast from where the subject is now (not from birth) and you can see whether age helps or hurts.
• Bayesian Risk Update — Updates prior risk estimates with new evidence so the weight assigned to a risk changes as observations accumulate.
• 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.
• Cumulative Risk Horizon Table — Lays a tiny per-opportunity probability across the real number of opportunities in the horizon, turning 'practically zero' into a cumulative chance — and marking the point where prevention-only must give way to containment.
• Expected Value Calculation — Multiplies or otherwise combines probability and consequence on a common scale to rank options by expected gain, loss, or exposure.
• Expected-Value Review — Combines probabilities and consequences into a single expected value, anchored on base rates, so vivid losses and vivid upsides can be weighed on the same scale.
• Failure Mode and Effects Table — Adapts FMEA structure to assumption failure: one row per way a key premise could break, each rated for effect, severity, and detectability into a priority score, with a named mitigation.
• Failure Modes and Effects Analysis — A tabular method that scores each failure mode on shared severity and detectability scales — combined with an occurrence input — into a single ranked priority, so many heterogeneous failures can be triaged by a common number.
• Fault Tree with Repeated-Opportunity Branch — A top-down failure-logic tree with an added branch for the event recurring across many demands — compounding a small per-demand probability into a horizon-level one and exposing where the 'independent trials' assumption quietly breaks.
• Hazard-Shape Diagnostic — Reads whether the exit hazard rises, stays flat, or falls with age — the single fact that decides whether surviving longer is good news or bad news.
• Incident Pattern Review — A method that mines past incidents, near misses, tickets, and defects for recurring failure patterns, turning real base rates into likelihood estimates and observed precursors into detection signals for a new design.
• 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.
• Lifetime Distribution Comparison — Fits and pits rival lifetime distributions against each other to expose how much the remaining-life forecast hangs on which tail you choose to believe.
• 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.
• Probabilistic Forecast — Expresses future outcomes as probabilities or distributions so decision makers can weight responses rather than treating forecasts as binary predictions.
• Probabilistic Safety Analysis — Quantifies how a standoff could tip into catastrophe — modeling the event chains, failure and accident probabilities, and consequence paths — so mitigation lands where the real risk is, not where the fear is loudest.
• Probabilistic Safety Assessment — A whole-system probabilistic model that scopes exactly what counts as the adverse outcome, tests the independence assumptions simpler math takes for granted, and records the residual risk no control removes.
• Reference-Class Forecasting — Forecasts how long the subject will persist by placing it in a class of genuinely comparable cases and reading its lifetime off that class's distribution, instead of trusting a bottom-up guess.
• Repeated-Trial Probability Calculator — Converts a small per-opportunity probability and a large number of opportunities into the near-certainty of at least one occurrence over the whole horizon.
• Reverse Stress and Failure-Budget Test — Starts from an unsurvivable loss and works backward to find the failure combinations that could reach it — without ever assigning the event a probability.
• Risk Scoring Model — Combines many observed factors into a single calibrated score or tier that stands in for a hidden risk type and routes each candidate accordingly.
• Robust Statistics Method — Uses estimators built to stay accurate when data contain outliers, noise, or broken assumptions, so a decision keeps its validity instead of being swung by a few bad points.
• 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.
• Safety Factor Application — Sizes a margin by multiplying the expected demand — or dividing the rated capacity — by a conservative factor chosen from the uncertainty and the cost of failure.
• Scenario Stress Test — Constructs a bounded, internally coherent adverse future — a defined shock — and runs the plan's forward premises through it to see which ones break when the whole world moves at once.
• Sensitivity Analysis Workshop — A working session that systematically varies a model's numeric inputs to measure how far the conclusion moves with each — and how assumptions compound — ranking which quantitative premises the answer actually hangs on.
• 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.
• Stationarity Test — Tests whether the process that generated past lifetimes is still the same process, the precondition for treating survival so far as evidence about survival ahead.
• Stress Margin Simulation — Runs a model of the system across sampled combinations of stressed inputs — before any real unit exists — to predict where the margin is thinnest and how sensitive it is to each stress.
• Survival or Time-to-Event Analysis — Fits a lifetime distribution and hazard function from durations that include still-alive (censored) cases, turning a set of survivors and exits into an estimated curve of risk over time.
• Tolerance Stack-Up Analysis — Adds up the individually acceptable deviations of every part along an assembly chain to check whether their accumulation still stays inside the failure boundary — and budgets each part's share.
• User Research Synthesis — Turns interviews, usability observations, and support signals into decision-relevant product and service evidence.
• 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.

Scaling & Capacity

Solutions that match capability to load, grow or shrink safely, and manage how structure and performance change with size.

18 mechanisms · View full solution family

• Birthday-Bound Calculation — Turns an effective namespace size and an active draw count into a pairwise collision probability, so a space that still looks empty by occupancy can be seen as already risky by pair count.
• Capacity Investment Analysis — Compares a slate of candidate capacity-relief investments — internal densification and footprint expansion alike — on the capacity they yield, their cost, feasibility, and risk, to decide which to fund.
• Carrying Capacity Assessment — Estimates the recurring load a system can carry indefinitely — deriving it from how fast the substrate renews, how it degrades under load, and the uncertainty around both — rather than from what the system has managed once.
• Crossover-Point Calculation — Solves for the scale value at which two competing terms become equal, marking where dominance — and the right decision — switches.
• Decision Support Tool — Software that computes, filters, tracks state, and validates a recommendation while leaving the accountable judgment with the human and its logic inspectable.
• Diminishing Returns Detection — Detects a plateau by comparing each added unit of input against the extra output it buys, flagging the point where marginal response has flattened even while total output still looks healthy.
• Effective Independent Provider Count — Collapses a weighted, correlation-adjusted dependency portfolio into a single honest number — how many genuinely independent providers you effectively have, which is usually far fewer than you can name.
• Finite-Size Correction Check — Estimates the correction terms an asymptotic result drops, to judge whether they still bite at the finite size you actually operate at.
• Identifier-Space Capacity Check — For one specific identifier scheme, models its effective space, projects its lifetime draws, and returns a headroom verdict against a consequence-set collision budget.
• Infrastructure-Load Simulation — Simulates how a proposed density increase loads the shared support systems — utilities, circulation, queues, supervision — and where the next bottleneck or cascade will appear.
• Intensification–Expansion Lifecycle Model — Prices densifying-in-place against expanding-the-footprint across the full lifecycle — capital, operating, externality, resilience, and transition costs over time — so the two modes can be compared, not sloganed.
• Lead-Time Stress Simulation — Replays a planned reach against surges and shocks in supply lead time and demand to find where the line breaks and how much buffer survives it.
• Line-of-Support Capacity Model — Computes what a support line actually delivers to the front at a given reach, after subtracting what the line spends feeding, guarding, and running itself.
• Pathway Breakpoint Mapping — Traces the causal chain by which a stressor actually reaches a vulnerable unit, then finds the breakpoints where the chain can be severed so exposure is contained instead of left to propagate.
• Ratio Limit Test — Establishes which of two candidate terms dominates by evaluating the limit of their ratio as the scale variable grows.
• Scenario Factor Stress Test — Pushes the stressor and the three factors to adverse-but-plausible scenarios to see which combinations make vulnerability spike — and whether today's priorities survive the uncertainty.
• Stock-Flow Diagnostic Map — Diagrams which underlying stock a flow lever actually acts through, and the range over which that stock still responds, so a dead lever can be traced to a stock outside its window rather than to insufficient force.
• Vulnerability Hotspot Overlay — A layered map that stacks the exposure, sensitivity, and capacity factors in space to reveal where they coincide — the hotspots — and rolls cell-level scores up to the units decisions are made in.

Scheduling & Pacing

Solutions that choose timing, cadence, duration, rate, or work-in-progress so demand and action remain temporally compatible.

7 mechanisms · View full solution family

• Age-Structured Projection Model — Projects a replenished stock forward one age class at a time, so today's cohort sizes surface as tomorrow's abundance or gap instead of hiding inside a single healthy-looking total.
• Cohort-Echo Scenario Simulation — Runs the age structure forward under many randomized entry-condition scenarios to produce a fan of delayed echoes — the range of booms, gaps, and bottlenecks a given cohort pattern could cast years downstream.
• Counterfactual Branch Probe — Actively tests whether a supposedly-open alternative path is still reachable — by varying one assumption at a time — so 'we still have options' is verified rather than assumed.
• Environmental Time-Constant Estimate — Measures how fast the environment itself changes — its characteristic time constant — so every internal clock has a real yardstick to be matched against.
• Lead-Time Decomposition Map — Splits total response time into its segments — prepare, authorize, move, implement, propagate, take effect — so the stage that actually delays the outcome becomes visible and addressable.
• Maturity Ladder Analysis — Constructs the calendar of obligations, renewals, resource releases, conversion windows, and gap periods.
• Rolling-Window Aggregation — Summarizes the most recent span of observations into one figure, then slides the span forward one step at a time.

Selection & Filtering

Solutions that admit, retain, rank, or reject candidates according to fitness, relevance, quality, or another discriminating rule.

16 mechanisms · View full solution family

• Agent-Based Experiment or Simulation — Plays the arms race forward in silico — a population of heterogeneous adaptive variants meets a candidate barrier portfolio over many rounds, so escape dynamics surface in simulation before they surface in the field.
• Bayesian Sensor-Fusion Filter — Carries a running posterior over the target state through time, fusing each new noisy reading by its likelihood against a predicted prior.
• Binary Feature-Vector Encoding — Represents cases through mostly-zero indicator vectors with a few active dimensions.
• Coordination Cost Accounting — Puts a running price on the meetings, handoffs, waiting, and rework that dividing work creates, so the coordination tax can be weighed against the specialization gains.
• Correlation or Covariance Audit — Measures how much nominally separate elements co-move, converting a raw count of signals into the far smaller number of effectively independent ones.
• Crowd Estimation Protocol — Treats many independent human estimates as a noisy element population and decodes their pattern, while actively protecting the independence and calibration that make a crowd informative.
• Decoder Calibration Curve — Plots the decoder's stated confidence against observed outcomes on labeled cases so systematic over- or under-confidence becomes visible and correctable.
• Ensemble Feature Readout Model — Reads a high-dimensional vector of learned features and sub-model outputs as a joint pattern of evidence for a target, preserving their disagreements and correlations rather than averaging them.
• L1-Regularized Representation Learning — Penalizes dense activation so learned representations use fewer active features.
• Multi-Pressure Tradeoff Matrix — Lays out the several selection pressures acting at once against the traits they reward, making visible where optimizing for one quietly degrades another — so the loop chooses its fitness function instead of backing into one.
• Overcomplete Dictionary Learning — Learns a large pool of basis atoms while representing each input with only a small subset.
• Risk-Adjusted Pricing — Sets each entrant's price to their assessed risk so no hidden type enters a flat premium that quietly subsidizes them — and sets the deliberate cross-subsidy range the pool is willing to hold.
• ROC or Precision–Recall Surface Review — For classification and screening contexts, evaluates the tradeoff surface created by threshold or strictness changes.
• Selection-Differential Cohort Analysis — Compares survival or persistence across exposed and unexposed cohorts to test whether the barrier is actively selecting for the escape variant, rather than merely coinciding with a drift it never caused.
• Sparse Dictionary or Basis Learning — Learns or defines a set of basis elements so any input can be re-expressed as a small, informative pattern of active elements — most stay silent.
• Weighted Decoder Model — Transforms the current joint pattern into an estimate by applying calibrated per-element weights and response curves in a single cross-sectional pass.

Substitution & Fallback

Solutions that replace unavailable or unsuitable means with alternatives while preserving the essential function, contract, or outcome.

11 mechanisms · View full solution family

• Borel Resummation — Removes factorial coefficient growth in a Borel transform and reconstructs a value through a justified inverse integral, treating its contour ambiguity as a nonperturbative signal.
• Borel–Padé Resummation — Continues a Borel-transformed series by rational (Padé) approximation from finitely many coefficients, reading its Borel-plane poles to reconstruct a divergent expansion.
• Conformal Borel Mapping — Maps a cut Borel domain to a disk to improve transformed-series convergence, using an assumed singularity geometry as an explicit, testable input.
• High-Temperature Series Resummation — Continues a high-temperature expansion toward the critical point by biasing the continuation with known critical scaling, and stops where new critical structure takes over.
• Indifference Map — Draws the contours of bundles a specific decision-maker treats as equally good, mapping the subjective equivalence region under current, explicitly provisional assumptions.
• Matched Asymptotic Expansion — Builds separate approximations in regions with different dominant balances and joins them through a consistent overlap into one composite.
• Model Complexity Penalty — Penalizes added parameters, features, rules, or tuning unless the additional performance gain generalizes and justifies the extra complexity.
• Padé Approximant — Replaces a truncated power series with a rational function that reproduces its coefficients, extending usefulness toward poles while flagging spurious ones across an ensemble of shapes.
• Renormalization-Group Improvement — Reorganizes scale-dependent and logarithmic terms using a flow equation, resumming large logarithms instead of computing more fixed orders.
• Sequence Acceleration Transform — Recombines a sequence's own partial sums to cancel a diagnosed leading remainder or damp oscillation, without changing representation.
• Strong-Coupling Extrapolation Check — Tests a reconstruction's strong-regime behavior against a single known exact limit of the same system, passing or failing its extension into that regime.

Thresholds & Phase Change

Solutions that detect, create, avoid, or govern nonlinear transitions when accumulating conditions cross a consequential boundary.

18 mechanisms · View full solution family

• Change-Point Detection Test — Identifies candidate structural breaks that should be modeled separately rather than absorbed into a smooth trend.
• Customer Segmentation Model — Partitions the demand side into explicit, bounded segments and reads how much complete value each one actually needs, so entry is a chosen slice rather than an undifferentiated claim on the whole market.
• Differencing Transform — Transforms a series into changes between observations to remove some classes of persistent level trend.
• Domain-Morphology Imaging — Turns the separated structure into measured numbers — domain size, shape, connectivity, and how the interfaces are moving.
• Gradient and Flux Map — Lays out, for a coupled pair or a whole network, what quantity wants to move and which way, and where along the contact the useful driving difference is strong, collapsed, leaking, or spuriously amplified.
• Growth-and-Crash Stock-Flow Model — Ties growth, peak, crash-conversion, clearance, and recovery delay into one causal stock-and-flow model, so the size of the coming crash load can be read off the size of the stock.
• Interpolation — Estimates the values between known points so a curve, motion, schedule, or interface passes through the gap along a defined path instead of snapping.
• Market Stress Indicator — Combines liquidity, volatility, and funding signals into one index and estimates where — with wide, honest uncertainty — the boundary between an orderly market and a stressed regime actually sits.
• Model Fitting Loop — Repeatedly adjusts a model's parameters against an error signal until fit stabilizes, with held-out checks guarding against converging on noise.
• Pinch Analysis and Heat Integration — Stacks all the hot and cold streams of a whole system into composite curves, reads off the pinch to fix a provable maximum-recovery target, and trades the minimum approach against area and cost.
• Quality-Control Limit Adjustment — Recomputes control and action limits on a process chart when the process's own capability or measurement noise has genuinely changed.
• Receiver Operating Characteristic Review — Lays out the whole menu of achievable operating points — sensitivity against false-positive rate — so a threshold can be chosen with the full tradeoff in view.
• Residual Stationarity Check — Checks whether residuals after trend handling are stable enough for the intended analysis.
• Risk Score Threshold Recalibration — Moves the score boundary that routes cases to auto-approve, review, or deny when a deployed model's population or performance has drifted, keeping a human channel for contested cases.
• Rolling-Window Trend Estimate — Estimates trends over moving windows to detect local trend shifts without assuming one global trend.
• Seasonal Adjustment Procedure — Separates periodic cycles from trend and residual movement when recurring seasonal effects are expected.
• Symmetry Labeling Matrix — Lays parallel cases out as rows and their describable dimensions as columns, so the cells left empty for the default case make the hidden norm visible at a glance.
• Transect and Gradient Mapping — Reads the transition zone along cross-cutting survey lines to reveal its composition gradient, its true depth, and where each interior actually ends.

Tradeoffs & Decision Support

Solutions that expose competing objectives, preference structure, stopping rules, and consequences so a choice can be made under constraint.

49 mechanisms · View full solution family

• Budget Allocation Model — Distributes a fixed pot of money across competing programs by weighting each against declared strategic priorities under ceilings and mandates.
• Budget Set Reconstruction — Rebuilds the set of options a chooser could actually afford and reach at the moment of choice, so a selection can be read as a preference rather than as a constraint.
• Choice Bundle Normalization — Re-expresses every option as a common-unit bundle of attributes and prices, so trade-offs made on different occasions can be compared on the same footing.
• Conjoint or Discrete Choice Model — Reconstructs demand from the ground up by making people choose among attribute bundles, recovering how much each feature — including price — is worth.
• Constraint Satisfaction Search — Explores the space of discrete combinations to find any assignment that violates no constraint, driven by feasibility rather than an objective.
• Constraint Sensitivity Report — Documents, from a fixed baseline, how the objective responds as each constraint or capacity is varied across a credible range — and what each level of relief would cost.
• Crew Scheduling Model — Builds legal duty bundles that cover every required shift under labor rules, minimum staffing, and equitable distribution of work.
• Cross-Elasticity Matrix — Maps how demand for each item responds to price changes in every other item, exposing which goods are substitutes, which are complements, and where demand merely moves rather than disappears.
• Demand Curve Estimation Workbook — The auditable ledger that assembles every observed cost-quantity-segment observation into a single, uncertainty-tagged demand schedule.
• Dynamic Programming / Value Iteration — Solves for the optimal policy by sweeping a value array with discounted one-step-lookahead backups until the values stop changing, then reading the greedy action off each state.
• Dynamic Programming Method — Solves an optimization problem by decomposing it into overlapping subproblems, solving each exactly once in dependency order, and recombining the stored results into the whole.
• Facility Location Model — Chooses which whole sites to open so that demand is covered at acceptable cost and distance.
• Fixed-Cost Amortization Plan — Spreads a large fixed investment across a growing volume of units so average cost falls as the base grows — and pins the volume threshold at which the investment pays for itself.
• Hold-vs-Retreat Scenario Stress Test — Projects the hold-cost curve forward under several plausible futures and compares the net value of holding against retreating, so the case to withdraw rests on staying losing across a range of scenarios rather than on a single gloomy forecast.
• Integer Programming Solver — Software that searches a formulated discrete model's feasible space and returns a proven or near-optimal commitment bundle.
• Knee Point Analysis — Finds the bend in the frontier where extra gains start costing disproportionately more, nominating that point of diminishing returns as a pragmatic default.
• Linear Programming Solver — Computes the allocation that maximizes a linear objective over a feasible region defined by linear constraints.
• Marginal Substitution Estimator — Estimates the local rate at which a chooser traded one attribute for another, reading marginal substitution rates off choices made near the margin.
• Monte Carlo Robustness Screen — Samples many plausible parameter combinations to estimate how often each candidate remains acceptable, with sampling assumptions documented.
• Multi-Criteria Decision Analysis — Provides structured methods for comparing alternatives across multiple criteria.
• Multiobjective Optimization Model — Formalizes the objectives and constraints as math and searches the feasible space to generate frontier points where the options are too many or too continuous to list by hand.
• Off-Policy Evaluation — Estimates how a candidate policy would perform directly from logged data generated by a different policy, correcting statistically for the fact that the logs were never collected under the candidate.
• Off-Policy or Historical Replay Evaluation — Estimates how a proposed policy would have performed by replaying historical logs from the policy that actually ran, reweighted to correct for what the old policy chose to try.
• One-way Sensitivity Analysis — Moves one input at a time across its range while holding everything else fixed, then ranks assumptions by how far each alone swings the outcome.
• Policy Iteration — Carries an explicit current policy and converges by alternating an exact evaluation of that policy with a greedy, state-by-state improvement over the available actions.
• Policy Simulation — Rolls the candidate policy forward through a model of the environment, generating synthetic trajectories — including rare states no log contains — to see how it behaves over time before it touches the real system.
• Portfolio Allocation Model — Spreads investment or project capacity across a set of opportunities to maximize a risk-adjusted objective that survives adverse scenarios.
• Probabilistic Sensitivity Simulation — Draws thousands of joint samples from input distributions and reports the share of draws in which the recommendation holds versus flips.
• Production Planning Model — Plans how materials, labor, and machine time are spent across product lines, surfacing which resource is the binding bottleneck.
• Ranking Stability Report — Reports whether rankings or winners remain stable under weight changes.
• Recurrence Equation — The mathematical relation that expresses a subproblem's value in terms of its smaller neighbors' values — the compact engine a reuse structure evaluates.
• Regret Analysis — Compares how much each option would underperform the scenario-specific best choice, supporting decisions that avoid severe ex post regret.
• Regret Gap Table — Breaks a single realized regret into its component value differences — money, time, trust, safety, optionality, learning — and shows which stakeholders bear each one.
• Revealed Preference Consistency Matrix — Assembles every 'chosen-over' relation from a choice history into a matrix and tests it for cycles and intransitivity that no single stable preference ordering could produce.
• Robust Optimization Model — Implements robust selection by optimizing under uncertainty sets, downside constraints, or scenario families rather than a single best-estimate parameter vector.
• Scenario Demand Stress Test — Pushes the calibrated demand schedule to extreme, off-baseline conditions to find where it breaks before a real shock does.
• Scenario Variation — Bundles many assumptions into a few internally coherent named worlds and reads the outcome under each to judge whether the plan survives all of them.
• Shadow Price Analysis — Reads the dual of a solved optimization model to price the marginal objective gain from relaxing each binding constraint by one unit.
• Shadow Price Probe — Infers the implicit price of a good with no money price from how much time, effort, or risk people willingly bear to get it.
• Simulation Rollout Evaluation — Estimates a candidate policy's trajectory-level value by rolling it forward through a simulator many times, surfacing the rare and costly paths a single-step score would hide.
• Spillover Response Load Test — Estimates the volume and tempo of reactions a signal will draw from adjacent audiences and checks whether the response apparatus can absorb them.
• Staff Scheduling Model — Assigns finite labor hours to shifts, roles, and units so every coverage, skill, and labor-rule constraint is satisfied at once.
• Stated vs Revealed Gap Report — Quantifies the gap between what people say they value and what their behavior reveals, broken out by segment and reported with the confidence the comparison actually supports.
• Threshold Analysis — Solves backward for the exact value of an input at which the recommendation flips, turning that break-even point into a monitoring trigger.
• Two-way or Multi-way Sensitivity Analysis — Varies two or more inputs at once across a grid of combinations to expose interaction — the effects that appear only when assumptions move together.
• Waitlist and Stockout Analysis — Recovers the demand that capacity hid — the queues, stockouts, and abandoned attempts that never became a transaction.
• Weight Sensitivity Sweep — Tests decision outcomes across plausible alternative weight sets.
• Weighted Scoring Model — Combines weighted objectives into a score, ranking, or priority list.
• Weighted Sum Objective — Implements a combined objective as an explicit weighted sum.

Transmission, Propagation & Networks

Solutions that shape how signals, behaviors, effects, or resources spread through channels and network topology over space or time.

10 mechanisms · View full solution family

• Adaptive Resampling and Reforecasting — Re-plans where and when to sample and re-runs the forecast ensemble as observations arrive, so the packet model never drifts stale against reality.
• Anti-Aliasing Bin Selection — Sizes the counting bin small enough that dynamics faster than it cannot masquerade as slow trends — the Nyquist discipline for rate codes.
• Finite-Element or Cellular-Automaton Model — A numerical solver that discretizes a heterogeneous medium into cells and steps the propagating quantity forward to predict where it concentrates, attenuates, or stalls.
• Inter-Event Interval Estimator — Reads rate from the time between consecutive events, so a single short gap already signals a high rate — the fastest, twitchiest estimate.
• Least-Resistance Path Simulation — A simulation that predicts likely propagation corridors through low-resistance or high-permeability regions.
• Packet Splitting and Recombination Detection — Tests whether an apparently broad packet is really one smooth spread or several unresolved branches, using phase coherence and the medium's topology to tell them apart.
• Poisson Rate Model — Models the stream as a Poisson process so one count yields both a rate and a principled confidence interval — telling a real surge from chance clustering.
• Rolling-Window Rate Estimator — Continuously updates a rate over a sliding window of recent events, using window length as the single dial between responsiveness and smoothness.
• Spike-Rate Readout — Recovers a stimulus magnitude from a neuron's firing rate through its measured tuning curve — the original, biological instance of rate coding.
• Weighted Network Propagation Model — A graph model where nodes and ties have different propagation weights or receptivity values.

Variation & Experimentation

Solutions that deliberately vary conditions, compare trials, preserve controls, and learn from differential outcomes without overclaiming.

32 mechanisms · View full solution family

• Attractor Basin Simulation — Explores which starting states and perturbations are likely to converge, stall, oscillate, or diverge.
• Block-Adjusted Effect Estimator — Combines the within-block treatment contrasts into a single effect estimate using prespecified weights and block-aware uncertainty, so the analysis matches the way units were actually assigned.
• Configurational Comparison Truth Table — Sorts cases by which combination of conditions each one has, and reads off which combinations — not which single factors — go with the outcome.
• Counterfactual Contrast Memo — Argues one case's causal claim by spelling out what would have happened absent the cause, anchored to a closely matched case where the cause was in fact missing.
• Difference-in-Differences Design — Compares differential before-after change between exposed and comparison units.
• Dynamic Programming Recursion — Solves a whole-trajectory optimization by recursing over states, storing the optimal cost-to-go at each, so the best complete path is assembled from optimal sub-paths.
• Energy-Minimization Model — Casts the design goal as a single scalar energy over admissible configurations and takes the solution to be the lowest-energy state.
• Euler–Lagrange Variational Derivation — Derives the governing equations of an optimal path by taking the first variation of the action functional and setting it to zero, yielding the differential condition plus the boundary conditions the extremal must satisfy.
• Event-Study Panel Plot — Shows trajectories around an event, treatment, or adoption time.
• Finite-Element Variational Approximation — Makes a continuous variational problem computable by chopping the domain into small elements and solving the functional's weak form over a finite basis of piecewise-simple trial functions.
• Fixed-Effects Panel Model — Controls for stable unit effects and/or shared time effects in repeated unit-time data.
• Lagged Panel Regression — Models delayed relationships between exposures and outcomes across units and periods.
• Lagrange Multiplier Constraint Handling — Folds hard constraints into the objective by attaching a multiplier to each, turning a constrained optimization into a stationarity problem whose multipliers read out as the shadow price of each constraint.
• Least-Resistance Path Mapping — Renders the design domain as a field of resistance and traces the route that accumulates the least total friction from origin to goal.
• Missing-Data Sensitivity Analysis — Re-runs the conclusion under a range of assumptions about the missing outcomes — including deliberately adverse ones — to see whether the finding survives the people who are gone.
• Monte Carlo Stack Simulation — Samples each contributor's distribution thousands of times through the real assembly relationship to build the distribution of the integrated result — capturing non-linear, non-normal, and correlated effects the closed-form methods assume away.
• Most-Different Systems Design — Compares cases that differ in almost every way yet share the same outcome, so the one condition they all hold in common becomes the candidate cause.
• Most-Similar Systems Design — Compares cases held alike on their background conditions but differing in outcome, so the handful of remaining differences becomes the short list of candidate causes.
• Random Restart Pulse — Occasionally discards the current search state and re-initializes from fresh random seeds — a discrete, global jolt into an entirely new region — rather than nudging the incumbent by degrees.
• Research Hypothesis Elimination — Narrows a field of competing explanations for a phenomenon to the best-supported one by designing tests whose outcomes the rivals predict differently, retiring a hypothesis when its own distinctive prediction fails.
• Rival Explanation Elimination Table — Lays every candidate explanation for an outcome side by side and rules each out by the evidence it would predict but the cases do not show.
• Root-Sum-Square Calculation — Combines independent contributors by the square root of the sum of their squared tolerances, giving a realistic statistical stack that is far tighter than the worst case because deviations rarely all align.
• Sensitivity Testing — Sweeps a model's assumptions and parameters across their plausible ranges to find whether a conclusion is robust or hinges on a knife-edge choice, then turns that fragility verdict into an explicit stop condition for commitment.
• Sensitivity to Case-Set Analysis — Re-runs the comparison while dropping, swapping, or adding cases, to see whether the conclusion survives the particular set of cases that happened to be chosen.
• Standardized Mean Difference Table — Reports each baseline covariate's between-group gap on a unit-free standardized scale, so imbalance is judged against a fixed threshold rather than a sample-size-sensitive p-value.
• Statistical Tolerance Analysis — Models each contributor as a distribution with a known process capability and propagates those distributions analytically, predicting the assembly's yield and how sensitively it responds to each contributor's spread and centering.
• Tolerance Stack Analysis — The end-to-end analytical procedure that gathers each contributor's tolerance, selects an accumulation model to combine them, and checks the predicted total against the system's fit requirement.
• Variational Inference Objective — Replaces an intractable target with the closest member of a tractable family, turning an impossible integration into an optimization by minimizing a divergence functional.
• Weighted Functional Scorecard — Collapses several competing objectives into one comparable score by weighting and summing them, making the trade-offs between candidates explicit and rankable.
• Weighted Scoring Matrix — Compares surviving candidates at a single stage by scoring each against weighted criteria and summing to a ranked total — the comparison arithmetic a narrowing stage plugs in, not a narrowing process itself.
• Within-Block Randomization Inference — Tests the treatment effect by re-enacting only the assignment permutations the actual blocked randomization could have produced, deriving p-values and intervals from the design itself rather than a distributional model.
• Worst-Case Stack Calculation — Sums every contributor's tolerance in its most harmful direction to guarantee the fit holds even if all deviations align at their extremes — buying absolute assurance at the price of the most conservative, and often most expensive, budget.