loopctl-mcp-server 2.63.0 → 2.64.0

package/README.md

@@ -255,7 +255,7 @@ Epic 39 Repo Coordination Bus — a lightweight, tenant-isolated channel for age
 | `knowledge_progressive_index` | Progressive disclosure — a **cheap, capped index** of what's relevant to a topic (compact stubs: `id`/`title`/`category`/`summary`, **no bodies**), curated-preferred and hub-enriched, capped at top-K (`meta.truncated` when the pool exceeded it). Survey a topic without flooding context, then open only what you need via `knowledge_progressive_drill`. Required: `topic`. Optional: `category`, `limit`. |
 | `knowledge_progressive_drill` | Open one stub from `knowledge_progressive_index` — returns the **full article body** for the given id, scope-enforced. Resolves both tenant-owned articles and published system canonicals (the same set the index surfaces). Required: `article_id`. |
 | `knowledge_list` | List articles (`id`, `title`, `category`, `status`, `tags`, `source_type`, `source_id`, `idempotency_key`, timestamps), filtered + paginated. **Body-less summary by default** (safe to page up to `limit=1000`); pass `include_body: true` to also return `body`, in which case the page is bounded by a ~5 MB byte budget — continue via `meta.next_offset` while `meta.has_more`. **Lag-free, all-status** read of the DB of record — unlike `knowledge_search` (ranked, published-only, lags writes) and `knowledge_index` (id/title/category only). The right tool to enumerate/dedup/repair and for idempotency/existence checks: filter by `tags`, `source_type`+`source_id`, or `idempotency_key` and read `meta.total_count` (exact). Single full body → `knowledge_get`; relevant bodies → `knowledge_context`; bulk dump → `knowledge_export`. Optional: `project_id`, `category`, `status`, `tags`, `source_type`, `source_id`, `idempotency_key`, `offset`, `limit`, `include_body`. |
-| `knowledge_get` | Get full article content by ID. Use after search to read an article in detail. Optional: `project_id`, `story_id` for attribution. |
+| `knowledge_get` | Get full article content by ID. Use after search to read an article in detail. Each link carries only its FAR side (`article: {id, title}`, plus `similarity` when scored); both arrays are ranked (open conflicts first, then descending similarity, then oldest-first for the unscored) and capped at 25 per direction, with `links_total` / `links_truncated` reporting the truth (`count` returns both, so one cheap call tells you whether the full fetch is capped). Pass `links: "count"` or `"none"` when you only want the text — on a well-linked hub the link block is several times the body. `potential_conflicts` is returned in all three modes, itself capped at 25 with `conflicts_total` / `conflicts_truncated`. Optional: `links`, `project_id`, `story_id` for attribution. |
 | `knowledge_context` | Get relevance-and-recency-ranked full articles for a task query. Best knowledge for your current context. **Agent-memory scoping**: `memory_types` (comma-separated, OR — observation/finding/summary/decision/question/task), `agents` (comma-separated agent_ids, OR), `conversation_id` (exact) filter on article `metadata` (JSONB `@>`). Optional: `project_id`, `story_id` for attribution, `limit`, `recency_weight`. |
 | `knowledge_graph` | Multi-hop traversal of the published article-link graph from `article_id` (depth 1–3, default 1), **bounded to agent's visible articles**. Agent callers see only their own and `shared` articles. Bidirectional, cycle-safe, bounded to 100 nodes / 500 edges (`truncated` flags a cap). Returns `nodes` (`id`/`title`/`category`/`depth`) + `edges` (`source_article_id`/`target_article_id`/`relationship_type`). Explore typed connections beyond `knowledge_context`'s 1-hop links. Required: `article_id`. Optional: `depth`, `project_id`. |
 | `knowledge_suggest_links` | Ranked typed-link **candidates** for an article by embedding similarity among **visible articles** — **read-only** (creates nothing). Excludes the article itself + any already-linked article (either direction, any type); only embedded published articles visible to the caller. Agent callers see only their own and `shared` articles. Returns `{id, title, category, similarity_score}` highest-first, to create as a **typed** link (relates_to/derived_from/contradicts/supersedes). Required: `article_id`. Optional: `threshold` (cosine floor 0–1, default 0.5), `limit` (default 5). |

package/index.js

@@ -1461,10 +1461,11 @@ async function knowledgeList({
   return toContent(result);
 }
 
-async function knowledgeGet({ article_id, project_id, story_id }) {
+async function knowledgeGet({ article_id, project_id, story_id, links }) {
   const params = new URLSearchParams();
   if (project_id) params.set("project_id", project_id);
   if (story_id) params.set("story_id", story_id);
+  if (links) params.set("links", links);
   const qs = params.toString();
   const path = qs ? `/api/v1/articles/${article_id}?${qs}` : `/api/v1/articles/${article_id}`;
   const result = await apiCall("GET", path, null, process.env.LOOPCTL_AGENT_KEY);
@@ -4511,7 +4512,20 @@ const TOOLS = [
       "material to your current task, act on it: read the peer, judge redundant/complementary/" +
       "contradictory against the live system, and knowledge_resolve_conflict (dismiss a false " +
       "positive, supersede when one clearly wins, merge when both should combine). If you can't " +
-      "tell which is right, leave it. See the 'Resolving knowledge conflicts' wiki playbook.",
+      "tell which is right, leave it. See the 'Resolving knowledge conflicts' wiki playbook.\n\n" +
+      "LINKS: each link carries only its FAR side as `article: {id, title}` (plus " +
+      "`similarity` when the auto-linker scored it) — direction is already given by which " +
+      "array it is in. Both arrays are ranked (open conflicts first, then descending " +
+      "similarity, then oldest-first for the unscored) and capped at 25 per direction; " +
+      "read `links_total` for the true count and `links_truncated` to know the cap bit — " +
+      "both are returned by links: 'count' too, so one cheap call tells you whether the " +
+      "full fetch is even complete. When you only want the article's TEXT, " +
+      "pass links: 'count' (or 'none') — on a well-linked hub the link block is several " +
+      "times the size of the body, and you are paying for it on every read. " +
+      "`potential_conflicts` is returned in all three modes, so opting out of the link " +
+      "list never hides a conflict from you; it is capped at 25 (strongest first) with " +
+      "`conflicts_total` / `conflicts_truncated`. To actually traverse the graph, use " +
+      "knowledge_graph rather than raising this cap.",
     inputSchema: {
       type: "object",
       properties: {
@@ -4520,6 +4534,15 @@ const TOOLS = [
           format: "uuid",
           description: "The UUID of the article.",
         },
+        links: {
+          type: "string",
+          enum: ["full", "count", "none"],
+          description:
+            "Optional: how much of the link graph to return. 'full' (default) = ranked, " +
+            "capped arrays; 'count' = just links_total + links_truncated; 'none' = omit " +
+            "link fields. potential_conflicts (capped, with conflicts_total) is always " +
+            "returned.",
+        },
         project_id: {
           type: "string",
           format: "uuid",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "loopctl-mcp-server",
-  "version": "2.63.0",
+  "version": "2.64.0",
   "description": "MCP server for loopctl \u2014 structural trust for AI development loops",
   "type": "module",
   "main": "index.js",