@nicia-ai/typegraph 0.9.2 → 0.11.0

package/dist/interchange/index.d.cts

@@ -1,6 +1,6 @@
 import { z } from 'zod';
 import { G as GraphDef } from '../manager-DGSnJa1v.cjs';
-import { J as Store } from '../store-DgzIgrmn.cjs';
+import { L as Store } from '../store-DyGdpDFr.cjs';
 import '../types-DMzKq0d5.cjs';
 import '../types-GLkwvQvS.cjs';
 import 'drizzle-orm';

package/dist/interchange/index.d.ts

@@ -1,6 +1,6 @@
 import { z } from 'zod';
 import { G as GraphDef } from '../manager-BCLhWysp.js';
-import { J as Store } from '../store-wqOO3GSy.js';
+import { L as Store } from '../store-nQ1ATBlN.js';
 import '../types-DMzKq0d5.js';
 import '../types-1YJKodRv.js';
 import 'drizzle-orm';

package/dist/profiler/index.d.cts

@@ -1,6 +1,6 @@
 import { G as GraphDef } from '../manager-DGSnJa1v.cjs';
 import { Q as QueryAst } from '../ast-Bh2NDeaK.cjs';
-import { J as Store } from '../store-DgzIgrmn.cjs';
+import { L as Store } from '../store-DyGdpDFr.cjs';
 import { P as ProfilerOptions, a as ProfileReport } from '../types-CVtGFpB9.cjs';
 export { D as DeclaredIndex, I as IndexRecommendation, b as ProfileSummary, c as PropertyAccessStats, d as PropertyPath, R as RecommendationPriority, U as UsageContext } from '../types-CVtGFpB9.cjs';
 import '../types-DMzKq0d5.cjs';

package/dist/profiler/index.d.ts

@@ -1,6 +1,6 @@
 import { G as GraphDef } from '../manager-BCLhWysp.js';
 import { Q as QueryAst } from '../ast-COMyNeMn.js';
-import { J as Store } from '../store-wqOO3GSy.js';
+import { L as Store } from '../store-nQ1ATBlN.js';
 import { P as ProfilerOptions, a as ProfileReport } from '../types-COPePE8_.js';
 export { D as DeclaredIndex, I as IndexRecommendation, b as ProfileSummary, c as PropertyAccessStats, d as PropertyPath, R as RecommendationPriority, U as UsageContext } from '../types-COPePE8_.js';
 import '../types-DMzKq0d5.js';

package/dist/{store-DgzIgrmn.d.cts → store-DyGdpDFr.d.cts}

@@ -1,6 +1,6 @@
 import { S as SqlSchema, G as GraphBackend } from './types-GLkwvQvS.cjs';
-import { K as KindRegistry, G as GraphDef, S as SchemaManagerOptions, f as SchemaValidationResult } from './manager-DGSnJa1v.cjs';
-import { S as SqlDialect, N as NodeType, A as AnyEdgeType, T as TemporalMode, E as EdgeType, d as EdgeRegistration, i as NodeRegistration, b as EdgeId, g as NodeId } from './types-DMzKq0d5.cjs';
+import { K as KindRegistry, G as GraphDef, E as EdgeKinds, N as NodeKinds, a as AllNodeTypes, S as SchemaManagerOptions, f as SchemaValidationResult } from './manager-DGSnJa1v.cjs';
+import { S as SqlDialect, N as NodeType, A as AnyEdgeType, T as TemporalMode, E as EdgeType, d as EdgeRegistration, b as EdgeId, g as NodeId, i as NodeRegistration } from './types-DMzKq0d5.cjs';
 import { V as ValueType, i as PredicateExpression, k as VectorMetricType, Q as QueryAst, J as JsonPointer, F as FieldRef, P as ParameterRef, c as JsonPointerInput, T as TraversalExpansion, l as Traversal, N as NodePredicate, m as ProjectedField, O as OrderSpec, G as GroupBySpec, o as RecursiveCyclePolicy, q as TraversalDirection, A as AggregateExpr, r as SelectiveField, s as ComposableQuery, t as SetOperationType, u as SetOperation, S as SortDirection } from './ast-Bh2NDeaK.cjs';
 import { SQL } from 'drizzle-orm';
 import { z } from 'zod';
@@ -877,6 +877,18 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
     }>) => Promise<Node<N>[]>;
     /** Count nodes matching criteria */
     count: (options?: QueryOptions) => Promise<number>;
+    /**
+     * Create a node from untyped data, relying on runtime Zod validation.
+     *
+     * Use this for dynamic dispatch (changesets, migrations, imports) where
+     * the data shape is determined at runtime, not compile time.
+     * The return type is fully typed — only the input gate is relaxed.
+     */
+    createFromRecord: (data: Record<string, unknown>, options?: Readonly<{
+        id?: string;
+        validFrom?: string;
+        validTo?: string;
+    }>) => Promise<Node<N>>;
     /**
      * Create or update a node.
      *
@@ -887,6 +899,17 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
         validFrom?: string;
         validTo?: string;
     }>) => Promise<Node<N>>;
+    /**
+     * Upsert a node from untyped data, relying on runtime Zod validation.
+     *
+     * Use this for dynamic dispatch (changesets, migrations, imports) where
+     * the data shape is determined at runtime, not compile time.
+     * The return type is fully typed — only the input gate is relaxed.
+     */
+    upsertByIdFromRecord: (id: string, data: Record<string, unknown>, options?: Readonly<{
+        validFrom?: string;
+        validTo?: string;
+    }>) => Promise<Node<N>>;
     /**
      * Create multiple nodes in a batch.
      *
@@ -1210,6 +1233,60 @@ type TransactionContext<G extends GraphDef> = Readonly<{
     };
 }>;
 
+/**
+ * Discriminated union of all Node runtime types in a graph.
+ *
+ * Unlike `AllNodeTypes<G>` which gives the union of *type definitions*,
+ * `AnyNode<G>` gives the union of *runtime node instances*.
+ */
+type AnyNode<G extends GraphDef> = {
+    [K in NodeKinds<G>]: Node<G["nodes"][K]["type"]>;
+}[NodeKinds<G>];
+/**
+ * Discriminated union of all Edge runtime types in a graph.
+ */
+type AnyEdge<G extends GraphDef> = {
+    [K in EdgeKinds<G>]: Edge<G["edges"][K]["type"]>;
+}[EdgeKinds<G>];
+/**
+ * Discriminated union of Node runtime types narrowed to a subset of kinds.
+ */
+type SubsetNode<G extends GraphDef, K extends NodeKinds<G>> = {
+    [Kind in K]: Node<G["nodes"][Kind]["type"]>;
+}[K];
+/**
+ * Discriminated union of Edge runtime types narrowed to a subset of kinds.
+ */
+type SubsetEdge<G extends GraphDef, K extends EdgeKinds<G>> = {
+    [Kind in K]: Edge<G["edges"][Kind]["type"]>;
+}[K];
+type SubgraphOptions<G extends GraphDef, EK extends EdgeKinds<G>, NK extends NodeKinds<G>> = Readonly<{
+    /** Edge kinds to follow during traversal. Edges not listed are not traversed. */
+    edges: readonly EK[];
+    /** Maximum traversal depth from root (default: 10). */
+    maxDepth?: number;
+    /**
+     * Node kinds to include in the result. Nodes of other kinds are still
+     * traversed through but omitted from the output. When omitted, all
+     * reachable node kinds are included.
+     */
+    includeKinds?: readonly NK[];
+    /** Exclude the root node from the result (default: false). */
+    excludeRoot?: boolean;
+    /**
+     * Edge direction policy (default: "out").
+     * - "out": follow edges in their defined direction only
+     * - "both": follow edges in both directions (undirected traversal)
+     */
+    direction?: "out" | "both";
+    /** Cycle policy — reuse RecursiveCyclePolicy (default: "prevent"). */
+    cyclePolicy?: RecursiveCyclePolicy;
+}>;
+type SubgraphResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, EK extends EdgeKinds<G> = EdgeKinds<G>> = Readonly<{
+    nodes: readonly SubsetNode<G, NK>[];
+    edges: readonly SubsetEdge<G, EK>[];
+}>;
+
 /**
  * ExecutableAggregateQuery - A query with aggregate functions that can be executed.
  */
@@ -1854,6 +1931,29 @@ declare class Store<G extends GraphDef> {
      * ```
      */
     query(): QueryBuilder<G>;
+    /**
+     * Extracts a typed subgraph by traversing from a root node.
+     *
+     * Performs a BFS traversal from `rootId` following the specified edge kinds,
+     * then returns all reachable nodes and the edges connecting them.
+     *
+     * @example
+     * ```typescript
+     * const result = await store.subgraph(run.id, {
+     *   edges: ["has_task", "runs_agent", "uses_skill"],
+     *   maxDepth: 4,
+     *   includeKinds: ["Run", "Task", "Agent", "Skill"],
+     * });
+     *
+     * for (const node of result.nodes) {
+     *   switch (node.kind) {
+     *     case "Task": console.log(node.name); break;
+     *     case "Agent": console.log(node.model); break;
+     *   }
+     * }
+     * ```
+     */
+    subgraph<const EK extends EdgeKinds<G>, const NK extends NodeKinds<G> = NodeKinds<G>>(rootId: NodeId<AllNodeTypes<G>>, options: SubgraphOptions<G, EK, NK>): Promise<SubgraphResult<G, NK, EK>>;
     /**
      * Executes a function within a transaction.
      *
@@ -1955,4 +2055,4 @@ declare function createStore<G extends GraphDef>(graph: G, backend: GraphBackend
  */
 declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions & SchemaManagerOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { embedding as $, type AliasMap as A, type SelectableEdge as B, type CreateQueryBuilderOptions as C, type SelectableNode as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, Store as J, type StoreHooks as K, type StoreOptions as L, type StreamOptions as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type RecursiveTraversalOptions as R, type SelectContext as S, TraversalBuilder as T, type TransactionContext as U, type TypedEdgeCollection as V, UnionableQuery as W, type UpdateEdgeInput as X, type UpdateNodeInput as Y, createStore as Z, createStoreWithSchema as _, type AggregateResult as a, exists as a0, fieldRef as a1, getEmbeddingDimensions as a2, inSubquery as a3, isEmbeddingSchema as a4, isParameterRef as a5, notExists as a6, notInSubquery as a7, param as a8, type ConstraintNames as b, type CreateEdgeInput as c, type CreateNodeInput as d, type Edge as e, type EdgeAccessor as f, type EdgeCollection as g, type EdgeFindByEndpointsOptions as h, type EdgeGetOrCreateByEndpointsOptions as i, type EdgeGetOrCreateByEndpointsResult as j, type EmbeddingSchema as k, type EmbeddingValue as l, ExecutableAggregateQuery as m, ExecutableQuery as n, type NodeAccessor as o, type NodeAlias as p, type NodeCollection as q, type NodeGetOrCreateByConstraintOptions as r, type NodeGetOrCreateByConstraintResult as s, type NodeRef as t, type PaginatedResult as u, type Predicate as v, PreparedQuery as w, type PropsAccessor as x, type QueryHookContext as y, type QueryOptions as z };
+export { type TypedEdgeCollection as $, type AliasMap as A, type QueryHookContext as B, type CreateQueryBuilderOptions as C, type QueryOptions as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type SelectableEdge as J, type SelectableNode as K, Store as L, type StoreHooks as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type RecursiveTraversalOptions as R, type SelectContext as S, TraversalBuilder as T, type StoreOptions as U, type StreamOptions as V, type SubgraphOptions as W, type SubgraphResult as X, type SubsetEdge as Y, type SubsetNode as Z, type TransactionContext as _, type AggregateResult as a, UnionableQuery as a0, type UpdateEdgeInput as a1, type UpdateNodeInput as a2, createStore as a3, createStoreWithSchema as a4, embedding as a5, exists as a6, fieldRef as a7, getEmbeddingDimensions as a8, inSubquery as a9, isEmbeddingSchema as aa, isParameterRef as ab, notExists as ac, notInSubquery as ad, param as ae, type AnyEdge as b, type AnyNode as c, type ConstraintNames as d, type CreateEdgeInput as e, type CreateNodeInput as f, type Edge as g, type EdgeAccessor as h, type EdgeCollection as i, type EdgeFindByEndpointsOptions as j, type EdgeGetOrCreateByEndpointsOptions as k, type EdgeGetOrCreateByEndpointsResult as l, type EmbeddingSchema as m, type EmbeddingValue as n, ExecutableAggregateQuery as o, ExecutableQuery as p, type NodeAccessor as q, type NodeAlias as r, type NodeCollection as s, type NodeGetOrCreateByConstraintOptions as t, type NodeGetOrCreateByConstraintResult as u, type NodeRef as v, type PaginatedResult as w, type Predicate as x, PreparedQuery as y, type PropsAccessor as z };

package/dist/{store-wqOO3GSy.d.ts → store-nQ1ATBlN.d.ts}

@@ -1,6 +1,6 @@
 import { S as SqlSchema, G as GraphBackend } from './types-1YJKodRv.js';
-import { K as KindRegistry, G as GraphDef, S as SchemaManagerOptions, f as SchemaValidationResult } from './manager-BCLhWysp.js';
-import { S as SqlDialect, N as NodeType, A as AnyEdgeType, T as TemporalMode, E as EdgeType, d as EdgeRegistration, i as NodeRegistration, b as EdgeId, g as NodeId } from './types-DMzKq0d5.js';
+import { K as KindRegistry, G as GraphDef, E as EdgeKinds, N as NodeKinds, a as AllNodeTypes, S as SchemaManagerOptions, f as SchemaValidationResult } from './manager-BCLhWysp.js';
+import { S as SqlDialect, N as NodeType, A as AnyEdgeType, T as TemporalMode, E as EdgeType, d as EdgeRegistration, b as EdgeId, g as NodeId, i as NodeRegistration } from './types-DMzKq0d5.js';
 import { V as ValueType, i as PredicateExpression, k as VectorMetricType, Q as QueryAst, J as JsonPointer, F as FieldRef, P as ParameterRef, c as JsonPointerInput, T as TraversalExpansion, l as Traversal, N as NodePredicate, m as ProjectedField, O as OrderSpec, G as GroupBySpec, o as RecursiveCyclePolicy, q as TraversalDirection, A as AggregateExpr, r as SelectiveField, s as ComposableQuery, t as SetOperationType, u as SetOperation, S as SortDirection } from './ast-COMyNeMn.js';
 import { SQL } from 'drizzle-orm';
 import { z } from 'zod';
@@ -877,6 +877,18 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
     }>) => Promise<Node<N>[]>;
     /** Count nodes matching criteria */
     count: (options?: QueryOptions) => Promise<number>;
+    /**
+     * Create a node from untyped data, relying on runtime Zod validation.
+     *
+     * Use this for dynamic dispatch (changesets, migrations, imports) where
+     * the data shape is determined at runtime, not compile time.
+     * The return type is fully typed — only the input gate is relaxed.
+     */
+    createFromRecord: (data: Record<string, unknown>, options?: Readonly<{
+        id?: string;
+        validFrom?: string;
+        validTo?: string;
+    }>) => Promise<Node<N>>;
     /**
      * Create or update a node.
      *
@@ -887,6 +899,17 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
         validFrom?: string;
         validTo?: string;
     }>) => Promise<Node<N>>;
+    /**
+     * Upsert a node from untyped data, relying on runtime Zod validation.
+     *
+     * Use this for dynamic dispatch (changesets, migrations, imports) where
+     * the data shape is determined at runtime, not compile time.
+     * The return type is fully typed — only the input gate is relaxed.
+     */
+    upsertByIdFromRecord: (id: string, data: Record<string, unknown>, options?: Readonly<{
+        validFrom?: string;
+        validTo?: string;
+    }>) => Promise<Node<N>>;
     /**
      * Create multiple nodes in a batch.
      *
@@ -1210,6 +1233,60 @@ type TransactionContext<G extends GraphDef> = Readonly<{
     };
 }>;
 
+/**
+ * Discriminated union of all Node runtime types in a graph.
+ *
+ * Unlike `AllNodeTypes<G>` which gives the union of *type definitions*,
+ * `AnyNode<G>` gives the union of *runtime node instances*.
+ */
+type AnyNode<G extends GraphDef> = {
+    [K in NodeKinds<G>]: Node<G["nodes"][K]["type"]>;
+}[NodeKinds<G>];
+/**
+ * Discriminated union of all Edge runtime types in a graph.
+ */
+type AnyEdge<G extends GraphDef> = {
+    [K in EdgeKinds<G>]: Edge<G["edges"][K]["type"]>;
+}[EdgeKinds<G>];
+/**
+ * Discriminated union of Node runtime types narrowed to a subset of kinds.
+ */
+type SubsetNode<G extends GraphDef, K extends NodeKinds<G>> = {
+    [Kind in K]: Node<G["nodes"][Kind]["type"]>;
+}[K];
+/**
+ * Discriminated union of Edge runtime types narrowed to a subset of kinds.
+ */
+type SubsetEdge<G extends GraphDef, K extends EdgeKinds<G>> = {
+    [Kind in K]: Edge<G["edges"][Kind]["type"]>;
+}[K];
+type SubgraphOptions<G extends GraphDef, EK extends EdgeKinds<G>, NK extends NodeKinds<G>> = Readonly<{
+    /** Edge kinds to follow during traversal. Edges not listed are not traversed. */
+    edges: readonly EK[];
+    /** Maximum traversal depth from root (default: 10). */
+    maxDepth?: number;
+    /**
+     * Node kinds to include in the result. Nodes of other kinds are still
+     * traversed through but omitted from the output. When omitted, all
+     * reachable node kinds are included.
+     */
+    includeKinds?: readonly NK[];
+    /** Exclude the root node from the result (default: false). */
+    excludeRoot?: boolean;
+    /**
+     * Edge direction policy (default: "out").
+     * - "out": follow edges in their defined direction only
+     * - "both": follow edges in both directions (undirected traversal)
+     */
+    direction?: "out" | "both";
+    /** Cycle policy — reuse RecursiveCyclePolicy (default: "prevent"). */
+    cyclePolicy?: RecursiveCyclePolicy;
+}>;
+type SubgraphResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, EK extends EdgeKinds<G> = EdgeKinds<G>> = Readonly<{
+    nodes: readonly SubsetNode<G, NK>[];
+    edges: readonly SubsetEdge<G, EK>[];
+}>;
+
 /**
  * ExecutableAggregateQuery - A query with aggregate functions that can be executed.
  */
@@ -1854,6 +1931,29 @@ declare class Store<G extends GraphDef> {
      * ```
      */
     query(): QueryBuilder<G>;
+    /**
+     * Extracts a typed subgraph by traversing from a root node.
+     *
+     * Performs a BFS traversal from `rootId` following the specified edge kinds,
+     * then returns all reachable nodes and the edges connecting them.
+     *
+     * @example
+     * ```typescript
+     * const result = await store.subgraph(run.id, {
+     *   edges: ["has_task", "runs_agent", "uses_skill"],
+     *   maxDepth: 4,
+     *   includeKinds: ["Run", "Task", "Agent", "Skill"],
+     * });
+     *
+     * for (const node of result.nodes) {
+     *   switch (node.kind) {
+     *     case "Task": console.log(node.name); break;
+     *     case "Agent": console.log(node.model); break;
+     *   }
+     * }
+     * ```
+     */
+    subgraph<const EK extends EdgeKinds<G>, const NK extends NodeKinds<G> = NodeKinds<G>>(rootId: NodeId<AllNodeTypes<G>>, options: SubgraphOptions<G, EK, NK>): Promise<SubgraphResult<G, NK, EK>>;
     /**
      * Executes a function within a transaction.
      *
@@ -1955,4 +2055,4 @@ declare function createStore<G extends GraphDef>(graph: G, backend: GraphBackend
  */
 declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions & SchemaManagerOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { embedding as $, type AliasMap as A, type SelectableEdge as B, type CreateQueryBuilderOptions as C, type SelectableNode as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, Store as J, type StoreHooks as K, type StoreOptions as L, type StreamOptions as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type RecursiveTraversalOptions as R, type SelectContext as S, TraversalBuilder as T, type TransactionContext as U, type TypedEdgeCollection as V, UnionableQuery as W, type UpdateEdgeInput as X, type UpdateNodeInput as Y, createStore as Z, createStoreWithSchema as _, type AggregateResult as a, exists as a0, fieldRef as a1, getEmbeddingDimensions as a2, inSubquery as a3, isEmbeddingSchema as a4, isParameterRef as a5, notExists as a6, notInSubquery as a7, param as a8, type ConstraintNames as b, type CreateEdgeInput as c, type CreateNodeInput as d, type Edge as e, type EdgeAccessor as f, type EdgeCollection as g, type EdgeFindByEndpointsOptions as h, type EdgeGetOrCreateByEndpointsOptions as i, type EdgeGetOrCreateByEndpointsResult as j, type EmbeddingSchema as k, type EmbeddingValue as l, ExecutableAggregateQuery as m, ExecutableQuery as n, type NodeAccessor as o, type NodeAlias as p, type NodeCollection as q, type NodeGetOrCreateByConstraintOptions as r, type NodeGetOrCreateByConstraintResult as s, type NodeRef as t, type PaginatedResult as u, type Predicate as v, PreparedQuery as w, type PropsAccessor as x, type QueryHookContext as y, type QueryOptions as z };
+export { type TypedEdgeCollection as $, type AliasMap as A, type QueryHookContext as B, type CreateQueryBuilderOptions as C, type QueryOptions as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type SelectableEdge as J, type SelectableNode as K, Store as L, type StoreHooks as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type RecursiveTraversalOptions as R, type SelectContext as S, TraversalBuilder as T, type StoreOptions as U, type StreamOptions as V, type SubgraphOptions as W, type SubgraphResult as X, type SubsetEdge as Y, type SubsetNode as Z, type TransactionContext as _, type AggregateResult as a, UnionableQuery as a0, type UpdateEdgeInput as a1, type UpdateNodeInput as a2, createStore as a3, createStoreWithSchema as a4, embedding as a5, exists as a6, fieldRef as a7, getEmbeddingDimensions as a8, inSubquery as a9, isEmbeddingSchema as aa, isParameterRef as ab, notExists as ac, notInSubquery as ad, param as ae, type AnyEdge as b, type AnyNode as c, type ConstraintNames as d, type CreateEdgeInput as e, type CreateNodeInput as f, type Edge as g, type EdgeAccessor as h, type EdgeCollection as i, type EdgeFindByEndpointsOptions as j, type EdgeGetOrCreateByEndpointsOptions as k, type EdgeGetOrCreateByEndpointsResult as l, type EmbeddingSchema as m, type EmbeddingValue as n, ExecutableAggregateQuery as o, ExecutableQuery as p, type NodeAccessor as q, type NodeAlias as r, type NodeCollection as s, type NodeGetOrCreateByConstraintOptions as t, type NodeGetOrCreateByConstraintResult as u, type NodeRef as v, type PaginatedResult as w, type Predicate as x, PreparedQuery as y, type PropsAccessor as z };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@nicia-ai/typegraph",
-  "version": "0.9.2",
+  "version": "0.11.0",
   "description": "TypeScript-first embedded knowledge graph library with ontological reasoning",
   "type": "module",
   "main": "./dist/index.cjs",
@@ -138,14 +138,14 @@
     "@stryker-mutator/core": "^9.6.0",
     "@stryker-mutator/vitest-runner": "^9.6.0",
     "@types/better-sqlite3": "^7.6.13",
-    "@types/node": "^24.11.0",
+    "@types/node": "^24.12.0",
     "@types/pg": "^8.18.0",
     "@vitest/coverage-v8": "^4.0.18",
     "better-sqlite3": "^12.6.2",
     "drizzle-orm": "^0.45.1",
-    "eslint": "^9.39.3",
-    "fast-check": "^4.5.3",
-    "pg": "^8.19.0",
+    "eslint": "^9.39.4",
+    "fast-check": "^4.6.0",
+    "pg": "^8.20.0",
     "sqlite-vec": "0.1.7-alpha.2",
     "tsd": "^0.33.0",
     "tsup": "^8.5.1",