> ## Documentation Index
> Fetch the complete documentation index at: https://kast.michne.com/llms.txt
> Use this file to discover all available pages before exploring further.

# Read a Kast result

> Separate transport completion from semantic coverage.

Kast returns a transport wrapper and an operation document. Read both before
using the answer.

| Connection       | Wrapper                    | Canonical document                                         |
| ---------------- | -------------------------- | ---------------------------------------------------------- |
| Direct MCP       | `result.structuredContent` | `data` for semantic reads                                  |
| Tool RPC         | Top-level `type`           | `document` for completed, qualified, or rejected documents |
| Codex App Server | Invocation `status`        | `document` when the invocation completed                   |

The [MCP](/reference/mcp-catalog) and [RPC](/reference/rpc-catalog) contracts
show their exact wrappers. The generated **Query symbols** entry in this tab
defines its canonical document.

## What the semantic document proves

| Canonical status | Claim                                                                        |
| ---------------- | ---------------------------------------------------------------------------- |
| `complete`       | The operation covered its declared scope.                                    |
| `qualified`      | Known facts remain usable, but coverage or another obligation is incomplete. |
| `rejected`       | No successful semantic result was established.                               |

For a negative claim, require complete coverage of the scope actually asked,
and inspect item failures and omissions. A zero-item qualified result is not
proof of absence. Preserve returned `ref`, continuation, qualification, and
failure fields verbatim.

Diagnostics cover the reported IDEA analysis scope; they do not assert a
whole-project build. A source or relation read can also return useful facts
with explicit limits.