agentix-cli 0.119.0 → 0.121.0

package/dist/chunk-IVCFXLAR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/wiki/query.ts"],"sourcesContent":["import { readFileSync, existsSync } from \"fs\"\nimport { buildIndex, scoreAll } from \"@/memory/bm25\"\nimport { askSeat } from \"@/decisions/seat\"\nimport { ancestryScore } from \"@/graph\"\nimport {\n  DEFAULT_SHORTLIST,\n  WIKI_RERANK_SEAT,\n  rerankQuestions,\n  rerankState,\n  toRanking,\n  type RerankCandidate,\n} from \"@/decisions/seats/wiki-rerank\"\nimport { stripAnthropicApiKey } from \"@/utils/workspace-env\"\nimport { resolve } from \"path\"\nimport { execSync } from \"child_process\"\nimport type { WikiArticle } from \"./types\"\nimport type { WikiStore } from \"./store\"\n\n/**\n * Agentic wiki query — the \"Farzapedia-faithful\" retrieval path.\n *\n * Two LLM calls + a deterministic graph walk:\n *   1. Selector (cheap): read `_index.md` + question → pick up to `maxCandidates`\n *      candidate articles by title + type.\n *   2. Walk (pure code): starting from candidates, follow `related` wikilinks\n *      up to `maxHops`, capped at `maxArticles` total.\n *   3. Synthesis (main): answer the question from the walked subgraph.\n *\n * Returns an answer with citations and a trace of which articles were walked,\n * so callers can audit the retrieval path.\n */\n\nexport interface AgenticQueryOptions {\n  /** Candidate-selection model (cheap). Defaults to \"haiku\". */\n  selectorModel?: string\n  /** Synthesis model (main). Defaults to \"sonnet\". */\n  synthModel?: string\n  /** Number of candidates the selector is asked to return. Default 3. */\n  maxCandidates?: number\n  /** Wikilink hops from candidates. Default 2. */\n  maxHops?: number\n  /** Hard cap on total articles walked. Default 8. */\n  maxArticles?: number\n  /** Timeout per LLM call, ms. Default 60_000. */\n  timeoutMs?: number\n  /** Logger — defaults to console.error. */\n  log?: (...args: unknown[]) => void\n  /** Intent-graph path the question's request was classified under.\n   *  Articles on the same branch rank higher in candidate selection. */\n  messagePath?: string[]\n  /** Weight of the branch match against the text match, 0–1. Default 0.6\n   *  (`graph.retrievalWeights.graph`). */\n  graphWeight?: number\n}\n\nexport interface AgenticQueryResult {\n  answer: string\n  citations: Array<{ title: string; path: string; type?: string }>\n  /** Titles/paths the selector picked. */\n  candidates: Array<{ title: string; path: string }>\n  /** Full article subgraph the walk produced. */\n  walked: Array<{ title: string; path: string; type?: string; hop: number }>\n  /** \"no-catalog\" | \"no-candidates\" | \"ok\" */\n  status: \"ok\" | \"no-catalog\" | \"no-candidates\" | \"error\"\n  /** For operator debugging only. */\n  trace?: {\n    selectorMs: number\n    synthesisMs: number\n    selectorOutput?: string\n  }\n  error?: string\n}\n\n/**\n * Run an agentic query against a specific agent's WikiStore.\n *\n * `requesterId` is used for permission checks — only articles the requester\n * can read will be included in the synthesis input.\n */\nexport async function agenticQuery(\n  question: string,\n  store: WikiStore,\n  requesterId: string | undefined,\n  opts: AgenticQueryOptions = {},\n): Promise<AgenticQueryResult> {\n  const selectorModel = opts.selectorModel ?? \"haiku\"\n  const synthModel = opts.synthModel ?? \"sonnet\"\n  const maxCandidates = opts.maxCandidates ?? 3\n  const maxHops = opts.maxHops ?? 2\n  const maxArticles = opts.maxArticles ?? 8\n  const timeoutMs = opts.timeoutMs ?? 60_000\n  const log = opts.log ?? console.error.bind(console, \"[wiki-query]\")\n  const messagePath = opts.messagePath?.length ? opts.messagePath : undefined\n  const graphWeight = opts.graphWeight ?? DEFAULT_GRAPH_WEIGHT\n\n  // --- Step 1: Load the catalog ---\n  const catalogPath = resolve(store.baseDir, \"_index.md\")\n  if (!existsSync(catalogPath)) {\n    return emptyResult(\"no-catalog\", question, \"No _index.md found — run `agentx wiki status` to rebuild.\")\n  }\n  const catalog = readFileSync(catalogPath, \"utf-8\")\n\n  // --- Step 2: Selector — pick candidates ---\n  const selectorStart = Date.now()\n  let candidates: Array<{ title: string; path: string }> = []\n  let selectorOutput = \"\"\n  try {\n    const viaSeat = await selectCandidatesViaSeat(question, store, requesterId, maxCandidates, messagePath, graphWeight)\n    if (viaSeat) {\n      candidates = viaSeat\n      selectorOutput = `[wiki-rerank seat] ${viaSeat.map((c) => c.title).join(\" | \")}`\n    } else {\n      selectorOutput = await runClaude(\n        buildSelectorPrompt(question, catalog, maxCandidates, messagePath),\n        selectorModel,\n        timeoutMs,\n      )\n      candidates = parseCandidates(selectorOutput)\n    }\n  } catch (e: any) {\n    log(\"selector failed:\", e?.message)\n    return { ...emptyResult(\"error\", question, `Selector: ${e?.message || \"unknown\"}`), trace: { selectorMs: Date.now() - selectorStart, synthesisMs: 0, selectorOutput } }\n  }\n  const selectorMs = Date.now() - selectorStart\n\n  if (candidates.length === 0) {\n    return { ...emptyResult(\"no-candidates\", question, \"Selector returned no candidates.\"), trace: { selectorMs, synthesisMs: 0, selectorOutput } }\n  }\n\n  // --- Step 3: Walk the subgraph via `related` wikilinks ---\n  const walked = walkSubgraph(candidates, store, requesterId, maxHops, maxArticles)\n\n  if (walked.length === 0) {\n    return { ...emptyResult(\"no-candidates\", question, \"Candidates did not resolve to readable articles.\"), candidates, trace: { selectorMs, synthesisMs: 0, selectorOutput } }\n  }\n\n  // --- Step 4: Synthesize the answer ---\n  const synthStart = Date.now()\n  let answer = \"\"\n  try {\n    answer = await runClaude(\n      buildSynthesisPrompt(question, walked),\n      synthModel,\n      timeoutMs * 2,\n    )\n  } catch (e: any) {\n    log(\"synthesis failed:\", e?.message)\n    return { ...emptyResult(\"error\", question, `Synthesis: ${e?.message || \"unknown\"}`), candidates, walked: walked.map(w => ({ title: w.meta.title, path: w.path, type: w.meta.type, hop: (w as any).hop ?? 0 })), trace: { selectorMs, synthesisMs: Date.now() - synthStart, selectorOutput } }\n  }\n  const synthesisMs = Date.now() - synthStart\n\n  return {\n    answer: answer.trim(),\n    citations: walked.map(a => ({ title: a.meta.title, path: a.path, type: a.meta.type })),\n    candidates,\n    walked: walked.map(w => ({ title: w.meta.title, path: w.path, type: w.meta.type, hop: (w as any).hop ?? 0 })),\n    status: \"ok\",\n    trace: { selectorMs, synthesisMs, selectorOutput },\n  }\n}\n\n// --- Helpers ---\n\nfunction emptyResult(\n  status: AgenticQueryResult[\"status\"],\n  _question: string,\n  error?: string,\n): AgenticQueryResult {\n  return {\n    answer: \"\",\n    citations: [],\n    candidates: [],\n    walked: [],\n    status,\n    error,\n  }\n}\n\nfunction walkSubgraph(\n  candidates: Array<{ title: string; path: string }>,\n  store: WikiStore,\n  requesterId: string | undefined,\n  maxHops: number,\n  maxArticles: number,\n): Array<WikiArticle & { hop: number }> {\n  // Build a title → path index from the store so wikilinks resolve.\n  const titleIndex = new Map<string, string>()\n  for (const article of store.listArticles(requesterId || \"\")) {\n    titleIndex.set(article.meta.title.toLowerCase(), article.path)\n  }\n\n  const opened = new Map<string, WikiArticle & { hop: number }>()\n  let frontier: Array<{ path: string; hop: number }> = []\n\n  for (const c of candidates) {\n    if (!opened.has(c.path)) frontier.push({ path: c.path, hop: 0 })\n  }\n\n  while (frontier.length && opened.size < maxArticles) {\n    const next = frontier.shift()!\n    if (opened.has(next.path)) continue\n    if (next.hop > maxHops) continue\n\n    const article = requesterId\n      ? store.readArticleAs(next.path, requesterId)\n      : store.readArticle(next.path)\n    if (!article) continue\n\n    opened.set(next.path, { ...article, hop: next.hop })\n    if (next.hop >= maxHops) continue\n\n    for (const target of article.meta.related || []) {\n      const path = titleIndex.get(target.toLowerCase())\n      if (path && !opened.has(path)) {\n        frontier.push({ path, hop: next.hop + 1 })\n      }\n    }\n  }\n\n  return Array.from(opened.values())\n}\n\n// --- Prompts ---\n\n/**\n * Pick candidates with the wiki-rerank seat instead of a Claude CLI call.\n *\n * The selector is 56% of a wiki query — 14.1s of a 25s total, measured —\n * and its whole job is \"pick 3 articles from this catalog\", which is a\n * Choice with per-option probabilities. Jev answers that in about a\n * second. Synthesis stays on Sonnet; it writes prose, which Jev cannot.\n *\n * BM25 shortlists first because the shared catalog carries 971 entries,\n * past the 255-option cap. Same two-stage shape as findRelevantReranked,\n * and it reuses that seat rather than introducing a second one.\n *\n * Returns null whenever the seat is off, errors, or has nothing to rank,\n * and the caller falls back to the CLI selector — so this is strictly an\n * accelerator, never a new way to fail.\n */\nasync function selectCandidatesViaSeat(\n  question: string,\n  store: WikiStore,\n  requesterId: string | undefined,\n  maxCandidates: number,\n  messagePath?: string[],\n  graphWeight: number = DEFAULT_GRAPH_WEIGHT,\n): Promise<Array<{ title: string; path: string }> | null> {\n  try {\n    const index = store.rebuildIndex()\n    const pool = (index.articles ?? []).filter((a) => a.path && !a.path.includes(\"/_versions/\"))\n    if (pool.length < 2) return null\n\n    const shortlist = rankCatalogPool(question, pool, messagePath, graphWeight).slice(0, DEFAULT_SHORTLIST)\n\n    const candidates: RerankCandidate[] = shortlist.map((i) => ({\n      id: `k${i}`,\n      title: pool[i].title || pool[i].path,\n      tags: pool[i].tags,\n      // The catalog has no body — a title, its type, its wikilinks and its\n      // branch of the intent graph are what the selector chooses on.\n      excerpt: [\n        pool[i].type ? `type: ${pool[i].type}` : \"\",\n        (pool[i].related ?? []).length ? `related: ${(pool[i].related ?? []).join(\", \")}` : \"\",\n        (pool[i].graphPath ?? []).length ? `graph: ${(pool[i].graphPath ?? []).join(\" › \")}` : \"\",\n      ].filter(Boolean).join(\" · \"),\n    }))\n\n    const result = await askSeat(\n      WIKI_RERANK_SEAT,\n      rerankState({ query: question, candidates, excerptChars: 300 }),\n      rerankQuestions(candidates),\n      { features: { agent: requesterId ?? \"unknown\", stage: \"catalog-selector\" } },\n    )\n    if (!result || result.mode !== \"active\") return null\n\n    const ranking = toRanking(result.answers as never, candidates)\n    const picked = ranking.ranked\n      .slice(0, maxCandidates)\n      .map((id) => pool[Number(id.slice(1))])\n      .filter(Boolean)\n      .map((a) => ({ title: a.title, path: a.path }))\n    return picked.length > 0 ? picked : null\n  } catch {\n    return null\n  }\n}\n\n/** Weight of the intent-graph branch match against the text match when\n *  shortlisting catalog candidates. Mirrors `graph.retrievalWeights.graph`. */\nexport const DEFAULT_GRAPH_WEIGHT = 0.6\n\n/**\n * Order the catalog pool for a question. Three bands, never mixed:\n *\n *   1. articles the text match scored, ordered by `text * (1 + w * branch)`\n *      when the request was classified: the branch reorders text matches\n *      but cannot lift an unrelated article above one;\n *   2. articles on the request's branch that the text never matched, by\n *      how much of the path they share;\n *   3. the rest, in catalog order.\n *\n * Band 1 comes first in full because the shortlist the reranker sees is\n * finite (DEFAULT_SHORTLIST): a busy category holds more same-branch\n * articles than that, and a blended score let them push the article that\n * actually answers the question out of the list.\n *\n * Exported for tests; the seat and the CLI selector both consume the order.\n */\nexport function rankCatalogPool(\n  question: string,\n  pool: Array<{ title: string; tags?: string[]; related?: string[]; graphPath?: string[] }>,\n  messagePath?: string[],\n  graphWeight: number = DEFAULT_GRAPH_WEIGHT,\n): number[] {\n  const docs = pool.map((a) =>\n    [a.title, (a.tags ?? []).join(\" \"), (a.related ?? []).join(\" \")].join(\" \"),\n  )\n  const bm25 = scoreAll(question, buildIndex(docs))\n  const maxBm25 = bm25.reduce((m, r) => Math.max(m, r.score), 0)\n  const text = new Map(bm25.map((r) => [r.docIndex, maxBm25 > 0 ? r.score / maxBm25 : 0]))\n  const useGraph = !!messagePath?.length\n  const branch = (a: { graphPath?: string[] }) =>\n    useGraph && a.graphPath?.length ? ancestryScore(messagePath!, a.graphPath) : 0\n\n  const byScore = (x: { i: number; score: number }, y: { i: number; score: number }) => y.score - x.score || x.i - y.i\n  const matched = pool\n    .map((a, i) => ({ i, score: (text.get(i) ?? 0) * (1 + graphWeight * branch(a)) }))\n    .filter((c) => text.has(c.i))\n    .sort(byScore)\n  const branchOnly = pool\n    .map((a, i) => ({ i, score: branch(a) }))\n    .filter((c) => !text.has(c.i) && c.score > 0)\n    .sort(byScore)\n  const ranked = [...matched, ...branchOnly].map((c) => c.i)\n  for (let i = 0; i < pool.length; i++) if (!ranked.includes(i)) ranked.push(i)\n  return ranked\n}\n\nfunction buildSelectorPrompt(question: string, catalog: string, maxCandidates: number, messagePath?: string[]): string {\n  const branch = messagePath?.length\n    ? `\\n## Intent\\n\\nThe request was classified under the intent-graph path \"${messagePath.join(\" › \")}\". Prefer articles filed under the same branch when their titles are equally plausible.\\n`\n    : \"\"\n  return `You are picking candidate articles from a wiki catalog to answer a question. You do NOT answer the question. You pick which articles the answer is likely to come from.\n\n## Question\n\n${question}\n${branch}\n## Catalog (_index.md — articles grouped by type, with wikilink previews)\n\n${catalog}\n\n## Your task\n\nPick up to ${maxCandidates} articles from the catalog that are most likely to answer the question. Prefer:\n- Articles whose title directly names a subject in the question.\n- Articles of the right type (e.g. a \"who owns X\" question → person or project; a \"what happened on DATE\" → event).\n- Articles whose wikilinks suggest they sit at the center of a relevant subgraph.\n\nReturn ONLY valid JSON, no markdown fencing, no prose:\n\n[\n  {\"title\": \"Exact Article Title\", \"path\": \"path/from/catalog.md\"},\n  ...\n]\n\nIf none of the articles match, return [].`\n}\n\nfunction buildSynthesisPrompt(\n  question: string,\n  articles: Array<WikiArticle & { hop: number }>,\n): string {\n  const articlesBlock = articles\n    .map(a => {\n      const header = `### ${a.meta.title} — ${a.meta.type || \"untyped\"} (${a.path}) [hop ${a.hop}]`\n      const related = a.meta.related?.length ? `Related: ${a.meta.related.join(\", \")}` : \"\"\n      return [header, related, \"\", a.content].filter(Boolean).join(\"\\n\")\n    })\n    .join(\"\\n\\n---\\n\\n\")\n\n  return `You are answering a question using a small subgraph of wiki articles. The articles were walked from the catalog; trust them over your prior knowledge.\n\n## Question\n\n${question}\n\n## Articles (${articles.length} walked from the catalog)\n\n${articlesBlock}\n\n## Your task\n\nAnswer the question in 2–6 sentences. Cite articles by their title in square brackets like [Article Title]. If the articles do not answer the question, say so plainly (do not invent). Prefer concrete facts over hedging.\n\nOutput ONLY the answer — no preamble, no \"here is my answer:\", no markdown fencing.`\n}\n\nfunction parseCandidates(raw: string): Array<{ title: string; path: string }> {\n  const match = raw.match(/\\[[\\s\\S]*?\\]/)\n  if (!match) return []\n  try {\n    const parsed = JSON.parse(match[0])\n    if (!Array.isArray(parsed)) return []\n    return parsed\n      .filter((x: any) => x && typeof x.title === \"string\" && typeof x.path === \"string\")\n      .map((x: any) => ({ title: x.title, path: x.path }))\n  } catch {\n    return []\n  }\n}\n\nasync function runClaude(prompt: string, model: string, timeoutMs: number): Promise<string> {\n  // Use stdin via a temp-file pipe to avoid shell-escaping a huge prompt.\n  // Prompts can exceed the `-E` arg buffer on macOS, so we always pipe.\n  const { writeFileSync, mkdirSync, rmSync } = await import(\"fs\")\n  const { tmpdir } = await import(\"os\")\n  const dir = resolve(tmpdir(), `agentx-wiki-query-${process.pid}`)\n  mkdirSync(dir, { recursive: true })\n  const promptPath = resolve(dir, `prompt-${Date.now()}.txt`)\n  writeFileSync(promptPath, prompt)\n  try {\n    const cmd = `cat '${promptPath}' | claude -p - --output-format json --max-turns 1 --model ${model} --disallowedTools \"Bash Read Write Edit Glob Grep Agent WebSearch WebFetch NotebookEdit\"`\n    const raw = execSync(cmd, { env: stripAnthropicApiKey({ ...process.env }), encoding: \"utf-8\", timeout: timeoutMs, maxBuffer: 4 * 1024 * 1024 })\n    try {\n      const envelope = JSON.parse(raw)\n      return String(envelope.result || envelope.content || \"\")\n    } catch {\n      return raw\n    }\n  } finally {\n    try { rmSync(promptPath, { force: true }) } catch {}\n  }\n}\n"],"mappings":"iNAAA,OAAS,gBAAAA,EAAc,cAAAC,MAAkB,KAEzCC,IAWA,OAAS,WAAAC,MAAe,OACxB,OAAS,YAAAC,MAAgB,gBAiEzB,eAAsBC,GACpBC,EACAC,EACAC,EACAC,EAA4B,CAAC,EACA,CAC7B,IAAMC,EAAgBD,EAAK,eAAiB,QACtCE,EAAaF,EAAK,YAAc,SAChCG,EAAgBH,EAAK,eAAiB,EACtCI,EAAUJ,EAAK,SAAW,EAC1BK,EAAcL,EAAK,aAAe,EAClCM,EAAYN,EAAK,WAAa,IAC9BO,EAAMP,EAAK,KAAO,QAAQ,MAAM,KAAK,QAAS,cAAc,EAC5DQ,EAAcR,EAAK,aAAa,OAASA,EAAK,YAAc,OAC5DS,EAAcT,EAAK,aAAeU,EAGlCC,EAAcjB,EAAQI,EAAM,QAAS,WAAW,EACtD,GAAI,CAACc,EAAWD,CAAW,EACzB,OAAOE,EAAY,aAAchB,EAAU,gEAA2D,EAExG,IAAMiB,EAAUC,EAAaJ,EAAa,OAAO,EAG3CK,EAAgB,KAAK,IAAI,EAC3BC,EAAqD,CAAC,EACtDC,EAAiB,GACrB,GAAI,CACF,IAAMC,EAAU,MAAMC,EAAwBvB,EAAUC,EAAOC,EAAaI,EAAeK,EAAaC,CAAW,EAC/GU,GACFF,EAAaE,EACbD,EAAiB,sBAAsBC,EAAQ,IAAKE,GAAMA,EAAE,KAAK,EAAE,KAAK,KAAK,MAE7EH,EAAiB,MAAMI,EACrBC,EAAoB1B,EAAUiB,EAASX,EAAeK,CAAW,EACjEP,EACAK,CACF,EACAW,EAAaO,EAAgBN,CAAc,EAE/C,OAASO,EAAP,CACA,OAAAlB,EAAI,mBAAoBkB,GAAG,OAAO,EAC3B,CAAE,GAAGZ,EAAY,QAAShB,EAAU,aAAa4B,GAAG,SAAW,WAAW,EAAG,MAAO,CAAE,WAAY,KAAK,IAAI,EAAIT,EAAe,YAAa,EAAG,eAAAE,CAAe,CAAE,CACxK,CACA,IAAMQ,EAAa,KAAK,IAAI,EAAIV,EAEhC,GAAIC,EAAW,SAAW,EACxB,MAAO,CAAE,GAAGJ,EAAY,gBAAiBhB,EAAU,kCAAkC,EAAG,MAAO,CAAE,WAAA6B,EAAY,YAAa,EAAG,eAAAR,CAAe,CAAE,EAIhJ,IAAMS,EAASC,EAAaX,EAAYnB,EAAOC,EAAaK,EAASC,CAAW,EAEhF,GAAIsB,EAAO,SAAW,EACpB,MAAO,CAAE,GAAGd,EAAY,gBAAiBhB,EAAU,kDAAkD,EAAG,WAAAoB,EAAY,MAAO,CAAE,WAAAS,EAAY,YAAa,EAAG,eAAAR,CAAe,CAAE,EAI5K,IAAMW,EAAa,KAAK,IAAI,EACxBC,EAAS,GACb,GAAI,CACFA,EAAS,MAAMR,EACbS,EAAqBlC,EAAU8B,CAAM,EACrCzB,EACAI,EAAY,CACd,CACF,OAASmB,EAAP,CACA,OAAAlB,EAAI,oBAAqBkB,GAAG,OAAO,EAC5B,CAAE,GAAGZ,EAAY,QAAShB,EAAU,cAAc4B,GAAG,SAAW,WAAW,EAAG,WAAAR,EAAY,OAAQU,EAAO,IAAIK,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,KAAM,IAAMA,EAAU,KAAO,CAAE,EAAE,EAAG,MAAO,CAAE,WAAAN,EAAY,YAAa,KAAK,IAAI,EAAIG,EAAY,eAAAX,CAAe,CAAE,CAC9R,CACA,IAAMe,EAAc,KAAK,IAAI,EAAIJ,EAEjC,MAAO,CACL,OAAQC,EAAO,KAAK,EACpB,UAAWH,EAAO,IAAIO,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,IAAK,EAAE,EACrF,WAAAjB,EACA,OAAQU,EAAO,IAAIK,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,KAAM,IAAMA,EAAU,KAAO,CAAE,EAAE,EAC5G,OAAQ,KACR,MAAO,CAAE,WAAAN,EAAY,YAAAO,EAAa,eAAAf,CAAe,CACnD,CACF,CAIA,SAASL,EACPsB,EACAC,EACAC,EACoB,CACpB,MAAO,CACL,OAAQ,GACR,UAAW,CAAC,EACZ,WAAY,CAAC,EACb,OAAQ,CAAC,EACT,OAAAF,EACA,MAAAE,CACF,CACF,CAEA,SAAST,EACPX,EACAnB,EACAC,EACAK,EACAC,EACsC,CAEtC,IAAMiC,EAAa,IAAI,IACvB,QAAWC,KAAWzC,EAAM,aAAaC,GAAe,EAAE,EACxDuC,EAAW,IAAIC,EAAQ,KAAK,MAAM,YAAY,EAAGA,EAAQ,IAAI,EAG/D,IAAMC,EAAS,IAAI,IACfC,EAAiD,CAAC,EAEtD,QAAWpB,KAAKJ,EACTuB,EAAO,IAAInB,EAAE,IAAI,GAAGoB,EAAS,KAAK,CAAE,KAAMpB,EAAE,KAAM,IAAK,CAAE,CAAC,EAGjE,KAAOoB,EAAS,QAAUD,EAAO,KAAOnC,GAAa,CACnD,IAAMqC,EAAOD,EAAS,MAAM,EAE5B,GADID,EAAO,IAAIE,EAAK,IAAI,GACpBA,EAAK,IAAMtC,EAAS,SAExB,IAAMmC,EAAUxC,EACZD,EAAM,cAAc4C,EAAK,KAAM3C,CAAW,EAC1CD,EAAM,YAAY4C,EAAK,IAAI,EAC/B,GAAKH,IAELC,EAAO,IAAIE,EAAK,KAAM,CAAE,GAAGH,EAAS,IAAKG,EAAK,GAAI,CAAC,EAC/C,EAAAA,EAAK,KAAOtC,IAEhB,QAAWuC,KAAUJ,EAAQ,KAAK,SAAW,CAAC,EAAG,CAC/C,IAAMK,EAAON,EAAW,IAAIK,EAAO,YAAY,CAAC,EAC5CC,GAAQ,CAACJ,EAAO,IAAII,CAAI,GAC1BH,EAAS,KAAK,CAAE,KAAAG,EAAM,IAAKF,EAAK,IAAM,CAAE,CAAC,GAK/C,OAAO,MAAM,KAAKF,EAAO,OAAO,CAAC,CACnC,CAoBA,eAAepB,EACbvB,EACAC,EACAC,EACAI,EACAK,EACAC,EAAsBC,EACkC,CACxD,GAAI,CAEF,IAAMmC,GADQ/C,EAAM,aAAa,EACb,UAAY,CAAC,GAAG,OAAQoC,GAAMA,EAAE,MAAQ,CAACA,EAAE,KAAK,SAAS,aAAa,CAAC,EAC3F,GAAIW,EAAK,OAAS,EAAG,OAAO,KAI5B,IAAM5B,EAFY6B,EAAgBjD,EAAUgD,EAAMrC,EAAaC,CAAW,EAAE,MAAM,EAAGsC,CAAiB,EAEtD,IAAK,IAAO,CAC1D,GAAI,IAAI,IACR,MAAOF,EAAK,CAAC,EAAE,OAASA,EAAK,CAAC,EAAE,KAChC,KAAMA,EAAK,CAAC,EAAE,KAGd,QAAS,CACPA,EAAK,CAAC,EAAE,KAAO,SAASA,EAAK,CAAC,EAAE,OAAS,IACxCA,EAAK,CAAC,EAAE,SAAW,CAAC,GAAG,OAAS,aAAaA,EAAK,CAAC,EAAE,SAAW,CAAC,GAAG,KAAK,IAAI,IAAM,IACnFA,EAAK,CAAC,EAAE,WAAa,CAAC,GAAG,OAAS,WAAWA,EAAK,CAAC,EAAE,WAAa,CAAC,GAAG,KAAK,UAAK,IAAM,EACzF,EAAE,OAAO,OAAO,EAAE,KAAK,QAAK,CAC9B,EAAE,EAEIG,EAAS,MAAMC,EACnBC,EACAC,EAAY,CAAE,MAAOtD,EAAU,WAAAoB,EAAY,aAAc,GAAI,CAAC,EAC9DmC,EAAgBnC,CAAU,EAC1B,CAAE,SAAU,CAAE,MAAOlB,GAAe,UAAW,MAAO,kBAAmB,CAAE,CAC7E,EACA,GAAI,CAACiD,GAAUA,EAAO,OAAS,SAAU,OAAO,KAGhD,IAAMK,EADUC,EAAUN,EAAO,QAAkB/B,CAAU,EACtC,OACpB,MAAM,EAAGd,CAAa,EACtB,IAAKoD,GAAOV,EAAK,OAAOU,EAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EACrC,OAAO,OAAO,EACd,IAAKrB,IAAO,CAAE,MAAOA,EAAE,MAAO,KAAMA,EAAE,IAAK,EAAE,EAChD,OAAOmB,EAAO,OAAS,EAAIA,EAAS,IACtC,MAAE,CACA,OAAO,IACT,CACF,CAIO,IAAM3C,EAAuB,GAmB7B,SAASoC,EACdjD,EACAgD,EACArC,EACAC,EAAsBC,EACZ,CACV,IAAM8C,EAAOX,EAAK,IAAKX,GACrB,CAACA,EAAE,OAAQA,EAAE,MAAQ,CAAC,GAAG,KAAK,GAAG,GAAIA,EAAE,SAAW,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAC3E,EACMuB,EAAOC,EAAS7D,EAAU8D,EAAWH,CAAI,CAAC,EAC1CI,EAAUH,EAAK,OAAO,CAACI,EAAGC,IAAM,KAAK,IAAID,EAAGC,EAAE,KAAK,EAAG,CAAC,EACvDC,EAAO,IAAI,IAAIN,EAAK,IAAKK,GAAM,CAACA,EAAE,SAAUF,EAAU,EAAIE,EAAE,MAAQF,EAAU,CAAC,CAAC,CAAC,EACjFI,EAAW,CAAC,CAACxD,GAAa,OAC1ByD,EAAU/B,GACd8B,GAAY9B,EAAE,WAAW,OAASgC,EAAc1D,EAAc0B,EAAE,SAAS,EAAI,EAEzEiC,EAAU,CAACC,EAAiCC,IAAoCA,EAAE,MAAQD,EAAE,OAASA,EAAE,EAAIC,EAAE,EAC7GC,EAAUzB,EACb,IAAI,CAACX,EAAGqC,KAAO,CAAE,EAAAA,EAAG,OAAQR,EAAK,IAAIQ,CAAC,GAAK,IAAM,EAAI9D,EAAcwD,EAAO/B,CAAC,EAAG,EAAE,EAChF,OAAQb,GAAM0C,EAAK,IAAI1C,EAAE,CAAC,CAAC,EAC3B,KAAK8C,CAAO,EACTK,EAAa3B,EAChB,IAAI,CAACX,EAAGqC,KAAO,CAAE,EAAAA,EAAG,MAAON,EAAO/B,CAAC,CAAE,EAAE,EACvC,OAAQb,GAAM,CAAC0C,EAAK,IAAI1C,EAAE,CAAC,GAAKA,EAAE,MAAQ,CAAC,EAC3C,KAAK8C,CAAO,EACTM,EAAS,CAAC,GAAGH,EAAS,GAAGE,CAAU,EAAE,IAAKnD,GAAMA,EAAE,CAAC,EACzD,QAASkD,EAAI,EAAGA,EAAI1B,EAAK,OAAQ0B,IAAUE,EAAO,SAASF,CAAC,GAAGE,EAAO,KAAKF,CAAC,EAC5E,OAAOE,CACT,CAEA,SAASlD,EAAoB1B,EAAkBiB,EAAiBX,EAAuBK,EAAgC,CACrH,IAAMyD,EAASzD,GAAa,OACxB;AAAA;AAAA;AAAA,0DAA0EA,EAAY,KAAK,UAAK;AAAA,EAChG,GACJ,MAAO;AAAA;AAAA;AAAA;AAAA,EAIPX;AAAA,EACAoE;AAAA;AAAA;AAAA,EAGAnD;AAAA;AAAA;AAAA;AAAA,aAIWX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0CAab,CAEA,SAAS4B,EACPlC,EACA6E,EACQ,CACR,IAAMC,EAAgBD,EACnB,IAAIxC,GAAK,CACR,IAAM0C,EAAS,OAAO1C,EAAE,KAAK,gBAAWA,EAAE,KAAK,MAAQ,cAAcA,EAAE,cAAcA,EAAE,OACjF2C,EAAU3C,EAAE,KAAK,SAAS,OAAS,YAAYA,EAAE,KAAK,QAAQ,KAAK,IAAI,IAAM,GACnF,MAAO,CAAC0C,EAAQC,EAAS,GAAI3C,EAAE,OAAO,EAAE,OAAO,OAAO,EAAE,KAAK;AAAA,CAAI,CACnE,CAAC,EACA,KAAK;AAAA;AAAA;AAAA;AAAA,CAAa,EAErB,MAAO;AAAA;AAAA;AAAA;AAAA,EAIPrC;AAAA;AAAA,eAEa6E,EAAS;AAAA;AAAA,EAEtBC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yFAOF,CAEA,SAASnD,EAAgBsD,EAAqD,CAC5E,IAAMC,EAAQD,EAAI,MAAM,cAAc,EACtC,GAAI,CAACC,EAAO,MAAO,CAAC,EACpB,GAAI,CACF,IAAMC,EAAS,KAAK,MAAMD,EAAM,CAAC,CAAC,EAClC,OAAK,MAAM,QAAQC,CAAM,EAClBA,EACJ,OAAQZ,GAAWA,GAAK,OAAOA,EAAE,OAAU,UAAY,OAAOA,EAAE,MAAS,QAAQ,EACjF,IAAKA,IAAY,CAAE,MAAOA,EAAE,MAAO,KAAMA,EAAE,IAAK,EAAE,EAHlB,CAAC,CAItC,MAAE,CACA,MAAO,CAAC,CACV,CACF,CAEA,eAAe9C,EAAU2D,EAAgBC,EAAe5E,EAAoC,CAG1F,GAAM,CAAE,cAAA6E,EAAe,UAAAC,EAAW,OAAAC,CAAO,EAAI,KAAM,QAAO,IAAI,EACxD,CAAE,OAAAC,CAAO,EAAI,KAAM,QAAO,IAAI,EAC9BC,EAAM7F,EAAQ4F,EAAO,EAAG,qBAAqB,QAAQ,KAAK,EAChEF,EAAUG,EAAK,CAAE,UAAW,EAAK,CAAC,EAClC,IAAMC,EAAa9F,EAAQ6F,EAAK,UAAU,KAAK,IAAI,OAAO,EAC1DJ,EAAcK,EAAYP,CAAM,EAChC,GAAI,CACF,IAAMQ,EAAM,QAAQD,+DAAwEN,6FACtFJ,EAAMnF,EAAS8F,EAAK,CAAE,IAAKC,EAAqB,CAAE,GAAG,QAAQ,GAAI,CAAC,EAAG,SAAU,QAAS,QAASpF,EAAW,UAAW,EAAI,KAAO,IAAK,CAAC,EAC9I,GAAI,CACF,IAAMqF,EAAW,KAAK,MAAMb,CAAG,EAC/B,OAAO,OAAOa,EAAS,QAAUA,EAAS,SAAW,EAAE,CACzD,MAAE,CACA,OAAOb,CACT,CACF,QAAE,CACA,GAAI,CAAEO,EAAOG,EAAY,CAAE,MAAO,EAAK,CAAC,CAAE,MAAE,CAAO,CACrD,CACF","names":["readFileSync","existsSync","init_seat","resolve","execSync","agenticQuery","question","store","requesterId","opts","selectorModel","synthModel","maxCandidates","maxHops","maxArticles","timeoutMs","log","messagePath","graphWeight","DEFAULT_GRAPH_WEIGHT","catalogPath","existsSync","emptyResult","catalog","readFileSync","selectorStart","candidates","selectorOutput","viaSeat","selectCandidatesViaSeat","c","runClaude","buildSelectorPrompt","parseCandidates","e","selectorMs","walked","walkSubgraph","synthStart","answer","buildSynthesisPrompt","w","synthesisMs","a","status","_question","error","titleIndex","article","opened","frontier","next","target","path","pool","rankCatalogPool","DEFAULT_SHORTLIST","result","askSeat","WIKI_RERANK_SEAT","rerankState","rerankQuestions","picked","toRanking","id","docs","bm25","scoreAll","buildIndex","maxBm25","m","r","text","useGraph","branch","ancestryScore","byScore","x","y","matched","i","branchOnly","ranked","articles","articlesBlock","header","related","raw","match","parsed","prompt","model","writeFileSync","mkdirSync","rmSync","tmpdir","dir","promptPath","cmd","stripAnthropicApiKey","envelope"]}