一键导入
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 页面并帮你完成安装。