원클릭으로
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 페이지를 검토하고 설치를 진행할 수 있습니다.