@soat/sdk 0.71.0 → 0.71.1

package/dist/index.d.cts

@@ -5495,7 +5495,7 @@ type OrchestrationEdge = {
    */
   activation_group?: string;
   /**
-   * Whether all or any edges in the activation group must fire.
+   * Whether all or any edges in the activation group must come from a completed node before the target runs. Omitted, `all`.
    */
   activation_condition?: 'all' | 'any';
 };
@@ -5555,7 +5555,13 @@ type CreateOrchestrationRequest = {
    */
   name: string;
   description?: string | null;
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run.
+   */
   nodes: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. `[]` for a graph of independent nodes.
+   */
   edges: Array<OrchestrationEdge>;
   state_schema?: {
     [key: string]: unknown;
@@ -5572,7 +5578,13 @@ type CreateOrchestrationRequest = {
 type UpdateOrchestrationRequest = {
   name?: string;
   description?: string | null;
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run. Replaces the stored list; omitted, the stored nodes are kept and validated against the new `edges`.
+   */
   nodes?: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. Replaces the stored list; omitted, the stored edges are kept and validated against the new `nodes`.
+   */
   edges?: Array<OrchestrationEdge>;
   state_schema?: {
     [key: string]: unknown;
@@ -5893,7 +5905,13 @@ type StartOrchestrationRunRequest = {
   wait?: boolean;
 };
 type ValidateOrchestrationRequest = {
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run. Checked exactly as create checks them, without persisting.
+   */
   nodes?: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. Checked exactly as create checks them, without persisting.
+   */
   edges?: Array<OrchestrationEdge>;
   /**
    * Optional JSON Schema for run inputs; its top-level properties seed state.

package/dist/index.d.mts

@@ -5495,7 +5495,7 @@ type OrchestrationEdge = {
    */
   activation_group?: string;
   /**
-   * Whether all or any edges in the activation group must fire.
+   * Whether all or any edges in the activation group must come from a completed node before the target runs. Omitted, `all`.
    */
   activation_condition?: 'all' | 'any';
 };
@@ -5555,7 +5555,13 @@ type CreateOrchestrationRequest = {
    */
   name: string;
   description?: string | null;
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run.
+   */
   nodes: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. `[]` for a graph of independent nodes.
+   */
   edges: Array<OrchestrationEdge>;
   state_schema?: {
     [key: string]: unknown;
@@ -5572,7 +5578,13 @@ type CreateOrchestrationRequest = {
 type UpdateOrchestrationRequest = {
   name?: string;
   description?: string | null;
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run. Replaces the stored list; omitted, the stored nodes are kept and validated against the new `edges`.
+   */
   nodes?: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. Replaces the stored list; omitted, the stored edges are kept and validated against the new `nodes`.
+   */
   edges?: Array<OrchestrationEdge>;
   state_schema?: {
     [key: string]: unknown;
@@ -5893,7 +5905,13 @@ type StartOrchestrationRunRequest = {
   wait?: boolean;
 };
 type ValidateOrchestrationRequest = {
+  /**
+   * The graph's nodes. Each `id` is unique and is what edges and `nodes.<id>` state references name; a node with no incoming edge starts the run. Checked exactly as create checks them, without persisting.
+   */
   nodes?: Array<OrchestrationNode>;
+  /**
+   * Directed edges between node `id`s. Every `from`/`to` must name a node in `nodes`, and the graph must be acyclic unless it contains a `loop` node. A node with several outgoing edges activates every target in parallel. Checked exactly as create checks them, without persisting.
+   */
   edges?: Array<OrchestrationEdge>;
   /**
    * Optional JSON Schema for run inputs; its top-level properties seed state.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@soat/sdk",
-  "version": "0.71.0",
+  "version": "0.71.1",
   "description": "TypeScript SDK for SOAT — open-source infrastructure for production-ready AI agents.",
   "keywords": [
     "ai-agents",