List the authenticated user's maps (metadata only, newest first).

Read one full map including its complete node tree.

Read a single node without its descendants. Its children field still lists child ids for navigation.

Read a node and its descendants as a nested tree. Omit depth for the full subtree; 0 returns just the node.

Create a map owned by the token's user. Pass an initial node tree in data so node primitives have a parent.

Delete a map and all of its nodes.

Create a structural node under a parent. nodeId is optional; a uuid is minted when omitted so you can reference ids you choose.

Apply a structural update to a node (content, note, type, collapsed flag, model). No LLM call, no metering.

Delete a node and all of its descendants (cascade). The root node cannot be deleted.

Run the LLM on a node and return the completed node. Blocks until ancestors finish; metered.

Generate follow-up prompts as queued child nodes and return their ids. One level only; submit each child yourself.

Clear a node's error state and re-run its generation. Retrying an expand node with children needs force=true.

Stop an in-flight generation; a generating or queued node flips to interrupted with partial output preserved. Idempotent.