@kortexya/reasoninglayer 0.15.2 → 0.17.0

package/dist/index.d.cts

@@ -109,7 +109,7 @@ type JsonValue$1 = string | number | boolean | null | JsonValue$1[] | object;
  * This is the single source of truth for the version constant.
  * The `scripts/release.sh` script updates this value alongside `package.json`.
  */
-declare const SDK_VERSION = "0.15.2";
+declare const SDK_VERSION = "0.17.0";
 /**
  * Configuration for the Reasoning Layer client.
  *
@@ -3898,6 +3898,28 @@ interface DetectMissingAttributesRequest$1 {
     call_attributes: string[];
     definition_attributes: string[];
 }
+/** Request to validate a Difference-in-Differences design */
+interface DiDValidationRequest {
+    /** Conditioning set (covariates) */
+    covariates?: string[];
+    /** Post-treatment outcome variable */
+    outcome_post: string;
+    /** Pre-treatment outcome variable */
+    outcome_pre: string;
+    /** The treatment variable */
+    treatment: string;
+}
+/** Response for DiD validation */
+interface DiDValidationResponse {
+    /** Identified "bad controls" (nodes that induce bias if conditioned on) */
+    bad_controls: string[];
+    /** Explanation of the result */
+    explanation: string;
+    /** The framework used for validation */
+    framework: string;
+    /** Whether the design is valid */
+    is_valid: boolean;
+}
 /** A pipeline diagnostic message. */
 interface DiagnosticDto$1 {
     /** Severity level: "info", "warning", or "error". */
@@ -6387,12 +6409,6 @@ interface FormalJudgeRequest$1 {
      * Paper Table 5: `trajectory.tool_calls`
      */
     trajectory: TrajectoryStepDto$1[];
-    /**
-     * Use the OSFKB-native safety engine instead of the LLM-based adapter.
-     * When true, uses sort hierarchy + neural sort grounding + homoiconic rules.
-     * When false (default), uses the LLM-based OversightExtractionAdapter.
-     */
-    use_osfkb_engine?: boolean;
     /** User instruction (what the agent was asked to do) */
     user_intent: string;
 }
@@ -13630,7 +13646,7 @@ interface SearchCommunitiesResponse$1 {
  * Defaults to `solutions` for full backward compatibility with existing clients
  * that do not send a `mode` field.
  */
-type SearchModeDto$1 = "solutions" | "feasibility";
+type SearchModeDto$1 = "solutions" | "feasibility" | "scheduling";
 /** Request to search for solutions */
 interface SearchRequest {
     /**
@@ -14238,12 +14254,27 @@ interface SortInfoDto$1 {
 /** Response for sort list operations */
 interface SortListResponse$1 {
     /**
-     * Total count
+     * Number of sorts in **this response** — not the tenant total
+     * when pagination is active.
      * @min 0
      */
     count: number;
-    /** List of sorts */
+    /**
+     * Offset of the first sort in this response.
+     * @min 0
+     */
+    offset?: number;
+    /**
+     * Sorts in this page (or all sorts when no ``limit`` query
+     * parameter was supplied).
+     */
     sorts: SortDto$1[];
+    /**
+     * Total number of sorts the tenant owns after filters, across
+     * all pages. Lets the client know when to stop paginating.
+     * @min 0
+     */
+    total?: number;
 }
 /** API representation of sort origin/provenance */
 type SortOriginDto$1 = {
@@ -14434,6 +14465,16 @@ type SpaceConstraintDto$1 = {
     total: number;
     type: "sum_equal";
     variables: string[];
+} | {
+    a: string[];
+    b: string[];
+    type: "lex_leq";
+} | {
+    groups: string[][];
+    type: "symmetry_group";
+} | {
+    entities: string[][];
+    type: "symmetric_observation";
 } | {
     lower: number[];
     type: "set_domain";
@@ -15540,6 +15581,73 @@ interface TriggerDependencyResponse$1 {
     /** The visualization graph */
     graph: VisualizationGraphDto$1;
 }
+/**
+ * Request body for `POST /api/v1/triz/invent` — the structured-input,
+ * no-LLM path into the TRIZ invention engine.
+ */
+interface TrizInventRequest {
+    /**
+     * Human-readable context (e.g. "drug_discovery", "kinase_program_279").
+     * The engine uses this in explanations but not in the reasoning.
+     */
+    domain_context?: string;
+    /**
+     * Sort names the caller has pre-seeded under this tenant. Required:
+     * without them the KB-matching step (`query_kb_for_triz_data`) has
+     * no domain hints and falls through to the LLM-synthetic path —
+     * defeating the purpose of this endpoint.
+     */
+    domains?: string[];
+    improving_parameter: string;
+    /** @format uuid */
+    tenant_id: string;
+    worsening_parameter: string;
+}
+/** Request body for `POST /api/v1/triz/record-outcome`. */
+interface TrizRecordOutcomeRequest {
+    /**
+     * UUID of the ``triz_inventive_proposal`` term the engine emitted.
+     * @format uuid
+     */
+    invention_term_id: string;
+    /**
+     * Measured performance ratio (e.g. potency fold, selectivity
+     * fold). ``0.0`` if unmeasured — the engine still records the
+     * success/failure signal.
+     * @format double
+     */
+    measured_ratio?: number;
+    /** Free-text notes on the outcome for downstream audit. */
+    notes?: string;
+    /**
+     * Whether the invention succeeded in downstream validation /
+     * experimental testing.
+     */
+    success: boolean;
+    /** @format uuid */
+    tenant_id: string;
+}
+/** Response payload for outcome recording. */
+interface TrizRecordOutcomeResponse {
+    error?: string | null;
+    /**
+     * Number of learned-mapping terms whose confidence was adjusted.
+     * @min 0
+     */
+    mappings_updated: number;
+    /**
+     * UUID of the newly-created ``triz_invention_outcome`` audit term.
+     * @format uuid
+     */
+    outcome_term_id?: string | null;
+    recorded: boolean;
+    success: boolean;
+    /**
+     * New post-update average confidence across the adjusted mappings.
+     * @format double
+     */
+    updated_confidence: number;
+}
 /** DTO for UIAction — all actions reference OSFQL execution */
 type UIActionDto$1 = {
     field_types: Record<string, string>;
@@ -16168,26 +16276,32 @@ type ValuePatternDto$1 = {
 /**
  * Feasibility of a single binary variable in the constraint space.
  *
- * Produced by `feasibility` mode search.  Both fields can be `false` only
- * when the problem is UNSAT (no valid assignment exists).
+ * Produced by `feasibility` mode search.  Fields report **observation-based**
+ * reachability: the solver sets `can_be_true` only when it has witnessed a
+ * complete satisfying assignment with this variable = 1 (and similarly for
+ * `can_be_false`).  Both fields can be `false` only when the problem is UNSAT.
  */
 interface VariableFeasibilityDto$1 {
     /**
-     * `true` if there exists at least one valid assignment where this variable
+     * `true` if the solver witnessed a valid assignment where this variable
      * is 0 (unselected / false).
      */
     can_be_false: boolean;
     /**
-     * `true` if there exists at least one valid assignment where this variable
+     * `true` if the solver witnessed a valid assignment where this variable
      * is 1 (selected / true).
      */
     can_be_true: boolean;
     /**
-     * `true` if this variable's feasibility was fully determined by the solver.
-     * `false` if the solver hit a conflict limit before resolving this variable
-     * — in that case, `can_be_true` and `can_be_false` are conservative
-     * approximations (both may be `true` even if the variable is actually
-     * confirmed).  The frontend can show unverified variables differently
+     * `true` when the result is fully determined by the solver — both
+     * polarities were either observed in a model or formally proven
+     * infeasible (by unit propagation or an UNSAT probe).
+     *
+     * `false` when a conflict limit was hit before the solver could fully
+     * determine the variable's status.  In that case `can_be_true` /
+     * `can_be_false` still faithfully reflect the polarities the solver
+     * actually witnessed — they are **never** optimistic defaults.  Clients
+     * typically render unverified variables in an intermediate visual state
      * (e.g. yellow/amber) so the user knows the result is approximate.
      */
     verified?: boolean;
@@ -16716,10 +16830,26 @@ declare class Sorts<SecurityDataType = unknown> {
          * Defaults to false (system sorts are excluded by default).
          */
         include_system?: boolean;
+        /**
+         * Maximum number of sorts to return. When omitted, no cap is
+         * applied (legacy behaviour). Recommended page size for
+         * production tenants: 50_000.
+         * @min 0
+         */
+        limit?: number | null;
         /** Filter to only show LLM-extracted sorts */
         llm_extracted?: boolean | null;
         /** Filter to only show sorts needing review */
         needs_review?: boolean | null;
+        /**
+         * Zero-indexed pagination offset. Combined with ``limit`` this
+         * lets clients stream a production tenant (1 M+ sorts, ~500 MB
+         * uncompressed) as a sequence of small responses, avoiding the
+         * ``IncompleteRead`` a single-response transfer reliably hits
+         * above ~30 MB.
+         * @min 0
+         */
+        offset?: number | null;
     }, params?: RequestParams) => Promise<HttpResponse<SortListResponse$1, any>>;
     /**
      * @description POST /api/v1/sorts/learned-similarities/reject Rejects a proposed or conflicted learned similarity with a reason. Rejected similarities are not used in reasoning.
@@ -20519,6 +20649,26 @@ declare class Query<SecurityDataType = unknown> {
      * @secure
      */
     osfSearch: (data: OsfSearchRequest$1, params?: RequestParams) => Promise<HttpResponse<OsfSearchResponse$1, any>>;
+    /**
+     * @description Skips the NL → structured-problem LLM hop entirely. Caller must have seeded the tenant KB with ≥ 3 successful + ≥ 2 limited Ψ-terms per domain (`/api/v1/terms/bulk` or `/api/v1/inference/facts/bulk`). Returns the same `NlQueryResponse` shape as the NL route so the UI can render either output uniformly.
+     *
+     * @tags query
+     * @name TrizInvent
+     * @summary Handle `POST /api/v1/triz/invent` — deterministic TRIZ invention.
+     * @request POST:/api/v1/triz/invent
+     * @secure
+     */
+    trizInvent: (data: TrizInventRequest, params?: RequestParams) => Promise<HttpResponse<NlQueryResponse$1, any>>;
+    /**
+     * No description
+     *
+     * @tags query
+     * @name TrizRecordOutcome
+     * @summary Handle `POST /api/v1/triz/record-outcome` — persist a measured outcome for a previously-emitted TRIZ proposal and learn from it.
+     * @request POST:/api/v1/triz/record-outcome
+     * @secure
+     */
+    trizRecordOutcome: (data: TrizRecordOutcomeRequest, params?: RequestParams) => Promise<HttpResponse<TrizRecordOutcomeResponse, any>>;
     /**
      * @description This performs unification AND validates the result against the GLB sort's witnesses. ## How It Differs from Regular Unification **Regular `/api/v1/term-store/sessions/:id/unify` (POST)**: - Computes GLB and unifies terms - Validates sort constraints (required features, type hints) - Does NOT check witnesses **This endpoint `/api/v1/query/validated-unify` (POST)**: - Computes GLB and unifies terms - Validates sort constraints - ALSO checks witnesses on the result - Returns proof of validity ## Example Unifying `person(name => "Alice")` with `grandparent(grandchild => "Charlie")`: 1. Computes GLB of person and grandparent 2. Creates unified term with both features 3. Checks grandparent witnesses: ∃Y. parent(Alice,Y) ∧ parent(Y,Charlie) 4. Returns unified term + witness proof
      *
@@ -25934,6 +26084,16 @@ declare class Causal<SecurityDataType = unknown> {
      * @secure
      */
     getCausalModel: (params?: RequestParams) => Promise<HttpResponse<GetCausalModelResponse$1, any>>;
+    /**
+     * @description This endpoint validates whether a DiD design is theoretically sound given the known causal structure and unobserved confounding. It uses the Transformed SWIG (Delta-SWIG) framework from Knaus & Pfleiderer (2026).
+     *
+     * @tags causal
+     * @name ValidateDid
+     * @summary Validate a Difference-in-Differences (DiD) design
+     * @request POST:/api/v1/causal/validate-did
+     * @secure
+     */
+    validateDid: (data: DiDValidationRequest, params?: RequestParams) => Promise<HttpResponse<DiDValidationResponse, void>>;
 }
 
 /**
@@ -30882,8 +31042,15 @@ interface CommitRequest {
  * - `"solutions"`: enumerate complete, valid assignments (default — backward compatible).
  * - `"feasibility"`: run 2×N per-variable SAT queries and return reachability info.
  *   Much faster than full enumeration for large spaces.
+ * - `"scheduling"`: route the space through the specialised **bipartite network-flow
+ *   engine** for scheduling-shaped problems (nurses × days × shifts with per-slot
+ *   demand and role minimums). Orders of magnitude faster than `"feasibility"` for
+ *   problems that fit this shape, and always returns fully `verified: true` results.
+ *   If the underlying problem's constraint shape cannot be modelled by the flow
+ *   engine, the backend responds with a 400 and the caller should fall back to
+ *   `"feasibility"`.
  */
-type SearchModeDto = 'solutions' | 'feasibility';
+type SearchModeDto = 'solutions' | 'feasibility' | 'scheduling';
 /**
  * Reachability of a single binary choice-point variable.
  *
@@ -33781,8 +33948,13 @@ interface FormalJudgeRequest {
     executionLog?: string;
     /** Optional pipeline configuration overrides. */
     config?: JudgeConfigDto | null;
-    /** Use OSFKB engine for verification (default: false). */
-    useOsfkbEngine?: boolean;
+    /**
+     * Risk categories from the benchmark dataset (e.g.,
+     * `["Lead to property loss", "Violate laws"]`).  Used by the
+     * 3-agent per-task decomposition pipeline to generate
+     * task-specific atomic conditions.
+     */
+    riskCategories?: string[];
 }
 /** Per-layer verification result. */
 interface LayerResultDto {

package/dist/index.d.ts

@@ -109,7 +109,7 @@ type JsonValue$1 = string | number | boolean | null | JsonValue$1[] | object;
  * This is the single source of truth for the version constant.
  * The `scripts/release.sh` script updates this value alongside `package.json`.
  */
-declare const SDK_VERSION = "0.15.2";
+declare const SDK_VERSION = "0.17.0";
 /**
  * Configuration for the Reasoning Layer client.
  *
@@ -3898,6 +3898,28 @@ interface DetectMissingAttributesRequest$1 {
     call_attributes: string[];
     definition_attributes: string[];
 }
+/** Request to validate a Difference-in-Differences design */
+interface DiDValidationRequest {
+    /** Conditioning set (covariates) */
+    covariates?: string[];
+    /** Post-treatment outcome variable */
+    outcome_post: string;
+    /** Pre-treatment outcome variable */
+    outcome_pre: string;
+    /** The treatment variable */
+    treatment: string;
+}
+/** Response for DiD validation */
+interface DiDValidationResponse {
+    /** Identified "bad controls" (nodes that induce bias if conditioned on) */
+    bad_controls: string[];
+    /** Explanation of the result */
+    explanation: string;
+    /** The framework used for validation */
+    framework: string;
+    /** Whether the design is valid */
+    is_valid: boolean;
+}
 /** A pipeline diagnostic message. */
 interface DiagnosticDto$1 {
     /** Severity level: "info", "warning", or "error". */
@@ -6387,12 +6409,6 @@ interface FormalJudgeRequest$1 {
      * Paper Table 5: `trajectory.tool_calls`
      */
     trajectory: TrajectoryStepDto$1[];
-    /**
-     * Use the OSFKB-native safety engine instead of the LLM-based adapter.
-     * When true, uses sort hierarchy + neural sort grounding + homoiconic rules.
-     * When false (default), uses the LLM-based OversightExtractionAdapter.
-     */
-    use_osfkb_engine?: boolean;
     /** User instruction (what the agent was asked to do) */
     user_intent: string;
 }
@@ -13630,7 +13646,7 @@ interface SearchCommunitiesResponse$1 {
  * Defaults to `solutions` for full backward compatibility with existing clients
  * that do not send a `mode` field.
  */
-type SearchModeDto$1 = "solutions" | "feasibility";
+type SearchModeDto$1 = "solutions" | "feasibility" | "scheduling";
 /** Request to search for solutions */
 interface SearchRequest {
     /**
@@ -14238,12 +14254,27 @@ interface SortInfoDto$1 {
 /** Response for sort list operations */
 interface SortListResponse$1 {
     /**
-     * Total count
+     * Number of sorts in **this response** — not the tenant total
+     * when pagination is active.
      * @min 0
      */
     count: number;
-    /** List of sorts */
+    /**
+     * Offset of the first sort in this response.
+     * @min 0
+     */
+    offset?: number;
+    /**
+     * Sorts in this page (or all sorts when no ``limit`` query
+     * parameter was supplied).
+     */
     sorts: SortDto$1[];
+    /**
+     * Total number of sorts the tenant owns after filters, across
+     * all pages. Lets the client know when to stop paginating.
+     * @min 0
+     */
+    total?: number;
 }
 /** API representation of sort origin/provenance */
 type SortOriginDto$1 = {
@@ -14434,6 +14465,16 @@ type SpaceConstraintDto$1 = {
     total: number;
     type: "sum_equal";
     variables: string[];
+} | {
+    a: string[];
+    b: string[];
+    type: "lex_leq";
+} | {
+    groups: string[][];
+    type: "symmetry_group";
+} | {
+    entities: string[][];
+    type: "symmetric_observation";
 } | {
     lower: number[];
     type: "set_domain";
@@ -15540,6 +15581,73 @@ interface TriggerDependencyResponse$1 {
     /** The visualization graph */
     graph: VisualizationGraphDto$1;
 }
+/**
+ * Request body for `POST /api/v1/triz/invent` — the structured-input,
+ * no-LLM path into the TRIZ invention engine.
+ */
+interface TrizInventRequest {
+    /**
+     * Human-readable context (e.g. "drug_discovery", "kinase_program_279").
+     * The engine uses this in explanations but not in the reasoning.
+     */
+    domain_context?: string;
+    /**
+     * Sort names the caller has pre-seeded under this tenant. Required:
+     * without them the KB-matching step (`query_kb_for_triz_data`) has
+     * no domain hints and falls through to the LLM-synthetic path —
+     * defeating the purpose of this endpoint.
+     */
+    domains?: string[];
+    improving_parameter: string;
+    /** @format uuid */
+    tenant_id: string;
+    worsening_parameter: string;
+}
+/** Request body for `POST /api/v1/triz/record-outcome`. */
+interface TrizRecordOutcomeRequest {
+    /**
+     * UUID of the ``triz_inventive_proposal`` term the engine emitted.
+     * @format uuid
+     */
+    invention_term_id: string;
+    /**
+     * Measured performance ratio (e.g. potency fold, selectivity
+     * fold). ``0.0`` if unmeasured — the engine still records the
+     * success/failure signal.
+     * @format double
+     */
+    measured_ratio?: number;
+    /** Free-text notes on the outcome for downstream audit. */
+    notes?: string;
+    /**
+     * Whether the invention succeeded in downstream validation /
+     * experimental testing.
+     */
+    success: boolean;
+    /** @format uuid */
+    tenant_id: string;
+}
+/** Response payload for outcome recording. */
+interface TrizRecordOutcomeResponse {
+    error?: string | null;
+    /**
+     * Number of learned-mapping terms whose confidence was adjusted.
+     * @min 0
+     */
+    mappings_updated: number;
+    /**
+     * UUID of the newly-created ``triz_invention_outcome`` audit term.
+     * @format uuid
+     */
+    outcome_term_id?: string | null;
+    recorded: boolean;
+    success: boolean;
+    /**
+     * New post-update average confidence across the adjusted mappings.
+     * @format double
+     */
+    updated_confidence: number;
+}
 /** DTO for UIAction — all actions reference OSFQL execution */
 type UIActionDto$1 = {
     field_types: Record<string, string>;
@@ -16168,26 +16276,32 @@ type ValuePatternDto$1 = {
 /**
  * Feasibility of a single binary variable in the constraint space.
  *
- * Produced by `feasibility` mode search.  Both fields can be `false` only
- * when the problem is UNSAT (no valid assignment exists).
+ * Produced by `feasibility` mode search.  Fields report **observation-based**
+ * reachability: the solver sets `can_be_true` only when it has witnessed a
+ * complete satisfying assignment with this variable = 1 (and similarly for
+ * `can_be_false`).  Both fields can be `false` only when the problem is UNSAT.
  */
 interface VariableFeasibilityDto$1 {
     /**
-     * `true` if there exists at least one valid assignment where this variable
+     * `true` if the solver witnessed a valid assignment where this variable
      * is 0 (unselected / false).
      */
     can_be_false: boolean;
     /**
-     * `true` if there exists at least one valid assignment where this variable
+     * `true` if the solver witnessed a valid assignment where this variable
      * is 1 (selected / true).
      */
     can_be_true: boolean;
     /**
-     * `true` if this variable's feasibility was fully determined by the solver.
-     * `false` if the solver hit a conflict limit before resolving this variable
-     * — in that case, `can_be_true` and `can_be_false` are conservative
-     * approximations (both may be `true` even if the variable is actually
-     * confirmed).  The frontend can show unverified variables differently
+     * `true` when the result is fully determined by the solver — both
+     * polarities were either observed in a model or formally proven
+     * infeasible (by unit propagation or an UNSAT probe).
+     *
+     * `false` when a conflict limit was hit before the solver could fully
+     * determine the variable's status.  In that case `can_be_true` /
+     * `can_be_false` still faithfully reflect the polarities the solver
+     * actually witnessed — they are **never** optimistic defaults.  Clients
+     * typically render unverified variables in an intermediate visual state
      * (e.g. yellow/amber) so the user knows the result is approximate.
      */
     verified?: boolean;
@@ -16716,10 +16830,26 @@ declare class Sorts<SecurityDataType = unknown> {
          * Defaults to false (system sorts are excluded by default).
          */
         include_system?: boolean;
+        /**
+         * Maximum number of sorts to return. When omitted, no cap is
+         * applied (legacy behaviour). Recommended page size for
+         * production tenants: 50_000.
+         * @min 0
+         */
+        limit?: number | null;
         /** Filter to only show LLM-extracted sorts */
         llm_extracted?: boolean | null;
         /** Filter to only show sorts needing review */
         needs_review?: boolean | null;
+        /**
+         * Zero-indexed pagination offset. Combined with ``limit`` this
+         * lets clients stream a production tenant (1 M+ sorts, ~500 MB
+         * uncompressed) as a sequence of small responses, avoiding the
+         * ``IncompleteRead`` a single-response transfer reliably hits
+         * above ~30 MB.
+         * @min 0
+         */
+        offset?: number | null;
     }, params?: RequestParams) => Promise<HttpResponse<SortListResponse$1, any>>;
     /**
      * @description POST /api/v1/sorts/learned-similarities/reject Rejects a proposed or conflicted learned similarity with a reason. Rejected similarities are not used in reasoning.
@@ -20519,6 +20649,26 @@ declare class Query<SecurityDataType = unknown> {
      * @secure
      */
     osfSearch: (data: OsfSearchRequest$1, params?: RequestParams) => Promise<HttpResponse<OsfSearchResponse$1, any>>;
+    /**
+     * @description Skips the NL → structured-problem LLM hop entirely. Caller must have seeded the tenant KB with ≥ 3 successful + ≥ 2 limited Ψ-terms per domain (`/api/v1/terms/bulk` or `/api/v1/inference/facts/bulk`). Returns the same `NlQueryResponse` shape as the NL route so the UI can render either output uniformly.
+     *
+     * @tags query
+     * @name TrizInvent
+     * @summary Handle `POST /api/v1/triz/invent` — deterministic TRIZ invention.
+     * @request POST:/api/v1/triz/invent
+     * @secure
+     */
+    trizInvent: (data: TrizInventRequest, params?: RequestParams) => Promise<HttpResponse<NlQueryResponse$1, any>>;
+    /**
+     * No description
+     *
+     * @tags query
+     * @name TrizRecordOutcome
+     * @summary Handle `POST /api/v1/triz/record-outcome` — persist a measured outcome for a previously-emitted TRIZ proposal and learn from it.
+     * @request POST:/api/v1/triz/record-outcome
+     * @secure
+     */
+    trizRecordOutcome: (data: TrizRecordOutcomeRequest, params?: RequestParams) => Promise<HttpResponse<TrizRecordOutcomeResponse, any>>;
     /**
      * @description This performs unification AND validates the result against the GLB sort's witnesses. ## How It Differs from Regular Unification **Regular `/api/v1/term-store/sessions/:id/unify` (POST)**: - Computes GLB and unifies terms - Validates sort constraints (required features, type hints) - Does NOT check witnesses **This endpoint `/api/v1/query/validated-unify` (POST)**: - Computes GLB and unifies terms - Validates sort constraints - ALSO checks witnesses on the result - Returns proof of validity ## Example Unifying `person(name => "Alice")` with `grandparent(grandchild => "Charlie")`: 1. Computes GLB of person and grandparent 2. Creates unified term with both features 3. Checks grandparent witnesses: ∃Y. parent(Alice,Y) ∧ parent(Y,Charlie) 4. Returns unified term + witness proof
      *
@@ -25934,6 +26084,16 @@ declare class Causal<SecurityDataType = unknown> {
      * @secure
      */
     getCausalModel: (params?: RequestParams) => Promise<HttpResponse<GetCausalModelResponse$1, any>>;
+    /**
+     * @description This endpoint validates whether a DiD design is theoretically sound given the known causal structure and unobserved confounding. It uses the Transformed SWIG (Delta-SWIG) framework from Knaus & Pfleiderer (2026).
+     *
+     * @tags causal
+     * @name ValidateDid
+     * @summary Validate a Difference-in-Differences (DiD) design
+     * @request POST:/api/v1/causal/validate-did
+     * @secure
+     */
+    validateDid: (data: DiDValidationRequest, params?: RequestParams) => Promise<HttpResponse<DiDValidationResponse, void>>;
 }
 
 /**
@@ -30882,8 +31042,15 @@ interface CommitRequest {
  * - `"solutions"`: enumerate complete, valid assignments (default — backward compatible).
  * - `"feasibility"`: run 2×N per-variable SAT queries and return reachability info.
  *   Much faster than full enumeration for large spaces.
+ * - `"scheduling"`: route the space through the specialised **bipartite network-flow
+ *   engine** for scheduling-shaped problems (nurses × days × shifts with per-slot
+ *   demand and role minimums). Orders of magnitude faster than `"feasibility"` for
+ *   problems that fit this shape, and always returns fully `verified: true` results.
+ *   If the underlying problem's constraint shape cannot be modelled by the flow
+ *   engine, the backend responds with a 400 and the caller should fall back to
+ *   `"feasibility"`.
  */
-type SearchModeDto = 'solutions' | 'feasibility';
+type SearchModeDto = 'solutions' | 'feasibility' | 'scheduling';
 /**
  * Reachability of a single binary choice-point variable.
  *
@@ -33781,8 +33948,13 @@ interface FormalJudgeRequest {
     executionLog?: string;
     /** Optional pipeline configuration overrides. */
     config?: JudgeConfigDto | null;
-    /** Use OSFKB engine for verification (default: false). */
-    useOsfkbEngine?: boolean;
+    /**
+     * Risk categories from the benchmark dataset (e.g.,
+     * `["Lead to property loss", "Violate laws"]`).  Used by the
+     * 3-agent per-task decomposition pipeline to generate
+     * task-specific atomic conditions.
+     */
+    riskCategories?: string[];
 }
 /** Per-layer verification result. */
 interface LayerResultDto {