v3.9.0-rc.35 (external-audit AS#5 / R-B) — hard cap on the number of notes
the wikilink graph ingests, mirroring the MAX_VISITED cap on find_path
BFS (rc.34 R-5). obsidian_get_communities is always-registered and reads
EVERY .md to build a full adjacency map + run Louvain; on a pathological /
very large vault that is unbounded I/O + memory for a single tool call. We
admit a complete, deterministically sorted bounded inventory. A vault that
exceeds the node or traversal ceiling fails closed rather than silently
presenting a prefix as a complete graph. Louvain itself is additionally
bounded by MAX_PASSES.
v3.9.0-rc.35 (external-audit AS#5 / R-B) — hard cap on the number of notes the wikilink graph ingests, mirroring the
MAX_VISITEDcap onfind_pathBFS (rc.34 R-5).obsidian_get_communitiesis always-registered and reads EVERY.mdto build a full adjacency map + run Louvain; on a pathological / very large vault that is unbounded I/O + memory for a single tool call. We admit a complete, deterministically sorted bounded inventory. A vault that exceeds the node or traversal ceiling fails closed rather than silently presenting a prefix as a complete graph. Louvain itself is additionally bounded byMAX_PASSES.