一键导入
graph
Analyze the vault's knowledge graph. Subcommands: orphans, density, bridges, synthesis, traverse, clusters, stats.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
菜单
Analyze the vault's knowledge graph. Subcommands: orphans, density, bridges, synthesis, traverse, clusters, stats.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
基于 SOC 职业分类
Add a new knowledge domain to an existing vault. Creates domain-specific MOCs, templates, and vocabulary mappings.
Research-backed vault evolution guidance. Toggle features (self-space, semantic search), rebalance MOCs, adjust dimensions with full rationale.
Query the Ars Contexta research methodology. Answers 'why does my system do X?' with research-backed explanations from 249 interconnected claims.
Run vault health diagnostics. 3 modes: quick (schema+orphans+links), full (all 8 categories), three-space (boundary violations).
Contextual guidance and command discovery. Shows available skills, agents, and intelligent suggestions based on vault state.
End-to-end source processing: reduce → reflect → reweave → verify. Fresh context per phase for optimal LLM attention.
| name | graph |
| description | Analyze the vault's knowledge graph. Subcommands: orphans, density, bridges, synthesis, traverse, clusters, stats. |
| tags | ["analysis","graph","connections"] |
Delegates to: @ars-contexta:graph-analyst
Invoke this skill for structural analysis of the vault's knowledge graph. Where health checks correctness, graph reveals topology, centrality, and emergent structure.
orphans — find notes with zero incoming linksdensity — compute link metrics across the vaultbridges — find high-betweenness notes (critical connectors)synthesis — surface connection opportunities between unlinked but related notestraverse <note> — explore the 2-hop neighborhood of a specific noteclusters — detect topic groupings from link densitystats — overall graph metrics summaryIf no argument is provided, run stats.
Use ripgrep as the primary query engine for all graph operations. Build link maps by grepping for [[ patterns across the vault.
Subcommand: orphans
Find all notes in the domain notes folder. For each, check whether any other note contains [[{note title}]]. Notes with zero incoming references are orphans. Report the full list with note title and creation date. Notes in self/ and ops/ are excluded from orphan analysis.
Subcommand: density Compute:
Subcommand: bridges Find notes with high betweenness centrality: notes that appear on many shortest paths between other notes. Approximate via incoming link count × unique referencing notes. High-betweenness notes are structural dependencies — if removed, the graph would fragment. List the top 10 by estimated betweenness.
Subcommand: synthesis Find pairs or clusters of notes that share significant keyword overlap but have no wiki-link between them. These are candidates for explicit connection or synthesis. Use ripgrep to extract key terms from titles and descriptions, then find unlinked note pairs with ≥3 shared significant terms. Report top 10 opportunities with explanation of the shared theme.
Subcommand: traverse <note>
Map the 2-hop neighborhood of the specified note:
Output as a structured list with relationship direction indicated. Cap at 50 nodes to keep output readable.
Subcommand: clusters Detect emergent topic groupings by link density. Notes that are densely interconnected among themselves and sparsely connected to other groups form a cluster. Approximate via MOC co-membership combined with direct link overlap. Report clusters with member count and a suggested cluster label derived from member titles.
Subcommand: stats Print a one-page overview:
Knowledge Graph Stats — {YYYY-MM-DD}
Notes: {n} total, {n} in notes/, {n} in self/, {n} in ops/
Links: {n} total wiki-links, {avg} per note
Orphans: {n} notes ({pct}%) with zero incoming links
Top hubs: {top 5 notes by incoming link count}
MOCs: {n} topic maps, avg {n} members each
Clusters: {n} detected
Graph age: oldest note {date}, newest note {date}