ワンクリックで
oak-working-with-graphs
Doctrine for any work that builds, serves, or consumes a graph surface. A graph is not a list: subgraphs are complete within their declared bound or they are wrong; list operations (pagination, truncation, top-N sampling of nodes or edges) never touch a subgraph; responses carry the anchors that navigate to the next bounded response; graph tools are thin deterministic formatters over a smart corpus; a degraded list-shaped answer is never an acceptable substitute for a typed refusal or a well-formed empty result.
Codex または Claude でインストール この Prompt をコピーして Codex、Claude、または他のアシスタントに貼り付けると、Skill ページを確認してインストールできます。