@qe-mcp/ena 0.0.0-stage → 0.1.18

package/fonts/OFL.txt

@@ -0,0 +1,93 @@
+Copyright 2020 The Inter Project Authors (https://github.com/rsms/inter)
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+https://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded, 
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.

package/fonts/README.md

@@ -0,0 +1,4 @@
+Inter 4 (Regular, Bold) — SIL Open Font License 1.1, see OFL.txt.
+From @expo-google-fonts/inter 0.4.2 (https://github.com/rsms/inter).
+Used to draw plot labels when PNGs are rendered with @resvg/resvg-wasm,
+which cannot read system fonts.

package/hooks/ena-privacy-gate.mjs

@@ -0,0 +1,31 @@
+/**
+ * ena-privacy-gate.mjs — PreToolUse hook for ENA MCP tools.
+ *
+ * Allows data_csv only for small toy/demo datasets (≤ MAX_ROWS rows).
+ * Blocks larger payloads and instructs Claude to use data_path instead,
+ * keeping research-scale data off Anthropic's servers.
+ */
+
+const MAX_ROWS = 50;
+
+let raw = '';
+process.stdin.on('data', chunk => { raw += chunk; });
+process.stdin.on('end', () => {
+    let call;
+    try { call = JSON.parse(raw); } catch { process.exit(0); }
+
+    const csv = call.tool_input?.data_csv;
+    if (!csv) process.exit(0);  // data_path used — allow
+
+    const rows = csv.trim().split('\n').length - 1;  // subtract header row
+    if (rows <= MAX_ROWS) process.exit(0);           // toy/demo data — allow
+
+    process.stderr.write(
+        `[ENA privacy gate] Blocked: data_csv contains ${rows} rows (limit: ${MAX_ROWS}).\n` +
+        `Raw data at this scale should not travel through the conversation.\n` +
+        `Ask the user to provide the file path and use data_path instead.`
+    );
+    // Exit code 2 blocks the call and sends stderr to Claude. Any other
+    // non-zero code is a non-blocking error: the tool call would still run.
+    process.exit(2);
+});

package/lines.js

@@ -0,0 +1,349 @@
+/**
+ * lines.js — the lines behind a connection: for each response line that
+ * contributed to a connection, the window of lines it was connected to.
+ *
+ * Response lines come from the model itself: rena-wasm's rowConnectionCounts
+ * (rows × connections), each line's finalised contribution, which sums per
+ * unit to the model's connection counts. The window around a response line is
+ * rebuilt with libtma's own rule (tma inst/include/libtma/accumulation.hpp,
+ * apply_tensor_unit): a ground line g before response line r, in the same
+ * context, is in r's window when
+ *
+ *     times[g] + window(g, r) > times[r]
+ *
+ * where times are line positions (or parsed times for time windows) and
+ * window(g, r) is looked up in the tensor at g's factor values, with the
+ * receiver axes set to r's. Contexts, factor levels, times and horizons come
+ * from rena-wasm's own exported helpers, so the grouping is the fit's.
+ *
+ * Every window is then checked: the connection is recomputed from the rebuilt
+ * window and the response line's codes (libtma connection_matrix) and must be
+ * present exactly where the model's rowConnectionCounts says it is.
+ */
+
+import { parseData } from '@qe-libs/rena-wasm/src/data.js';
+import {
+    buildContextLookup, buildContextLookupWithTimes, inferFactorLevels,
+    parseTimes, resolveTensorData, buildHorizonContexts,
+} from '@qe-libs/rena-wasm/src/tensor.js';
+
+// Column-major flat index into the tensor (libtma flat_index).
+function flatIndex(idx, dims) {
+    let linear = 0, stride = 1;
+    for (let v = 0; v < dims.length; v++) { linear += idx[v] * stride; stride *= dims[v]; }
+    return linear;
+}
+
+/**
+ * @param {object}   o
+ * @param {Object[]} o.rows          the rows the model was fitted on
+ * @param {string[]} o.codes         the model's codes, in order
+ * @param {string[]} o.unitCols, o.convoCols
+ * @param {string[]} [o.unitsUsed]
+ * @param {object}   o.tensorDef     the tensor the fit used (defaultTensor(window) for ENA)
+ * @param {object}   [o.horizons]
+ * @param {boolean}  o.ordered
+ * @param {string[]} o.unitLabels    the model's unit labels (must match the data's)
+ * @param {Float64Array} o.rowCounts the model's rowConnectionCounts
+ * @param {string[]} o.connectionNames
+ * @param {number|null} o.conn       connection index, or null for every line
+ * @param {Set<number>} o.selected   unit indices to list
+ * @returns {{ contexts, windows, check }}
+ *   contexts: [{ rows: [globalRow...] }] — the contexts holding a window
+ *   windows:  [{ unit, context, response, members: [globalRow...], count }]
+ *   check:    { checked, mismatches: [{ row, model, rebuilt }] }
+ */
+export function connectionWindows(o) {
+    const { rows, codes, unitCols, convoCols, unitsUsed, tensorDef, horizons, ordered,
+            unitLabels, rowCounts, connectionNames, conn, selected } = o;
+    const pd = parseData(rows, codes, unitCols, convoCols, unitsUsed ?? null);
+    if (pd.unitLabels.length !== unitLabels.length || pd.unitLabels.some((l, i) => l !== unitLabels[i]))
+        throw new Error('The data no longer matches the model (different units). Refit the model.');
+    const { codeMatrix, nCodes, unitOf, convoGroups } = pd;
+    const nConn = connectionNames.length;
+
+    // The tensor exactly as the accumulation resolves it.
+    const dims = tensorDef.dims;
+    const isDefault = dims.length === 1 && dims[0] === 2;
+    const tensor = resolveTensorData(tensorDef);
+    const factors = tensorDef.factors ?? [];
+    const factorLevels = tensorDef.factorLevels ?? inferFactorLevels(rows, factors);
+    const receiver = tensorDef.dimsReceiver ?? [];
+    const allTimes = tensorDef.timesCol ? parseTimes(rows, tensorDef.timesCol, tensorDef.timesEndCol || null) : null;
+    const nFactor = factors.length;
+    const WINDOW = 1, WEIGHT = 0;
+
+    // The connection's codes: ground i → response j (ordered), or the pair {i, j}.
+    let ci = -1, cj = -1;
+    if (conn != null) {
+        const [a, b] = connectionNames[conn].split(' & ');
+        ci = codes.indexOf(a); cj = codes.indexOf(b);
+        if (ci < 0 || cj < 0) throw new Error(`Connection '${connectionNames[conn]}' doesn't name two of the model's codes.`);
+    }
+
+    // Contexts: conversations, or each unit's horizon pieces.
+    const contexts = [];
+    if (horizons) {
+        const pieces = buildHorizonContexts(rows, unitOf, unitLabels.length, horizons);
+        pieces.forEach((list, u) => { if (selected.has(u)) for (const rowIdx of list) contexts.push({ rowIdx, owner: u }); });
+    } else {
+        for (const [, rowIdx] of convoGroups) contexts.push({ rowIdx, owner: null });
+    }
+
+    const windows = [], used = [];
+    const check = { checked: 0, mismatches: [] };
+    for (const ctx of contexts) {
+        const { rowIdx, owner } = ctx;
+        const responders = [];
+        for (let r = 0; r < rowIdx.length; r++) {
+            const u = unitOf[rowIdx[r]];
+            if (u >= 0 && selected.has(u) && (owner == null || owner === u)) responders.push(r);
+        }
+        if (!responders.length) continue;
+        const { contextLookup, times } = allTimes
+            ? buildContextLookupWithTimes(rows, rowIdx, factors, factorLevels, allTimes)
+            : buildContextLookup(rows, rowIdx, factors, factorLevels);
+        const lookup = (r, kind, respR) => {
+            if (isDefault) return kind === WINDOW ? Math.trunc(tensor[1]) : Math.trunc(tensor[0]);
+            const v = new Array(nFactor + 1);
+            for (let f = 0; f < nFactor; f++) v[f] = contextLookup[r * nFactor + f];
+            if (respR != null) for (const d of receiver) v[d] = contextLookup[respR * nFactor + d];
+            v[nFactor] = kind;
+            return tensor[flatIndex(v, dims)];
+        };
+
+        let any = false;
+        for (const r of responders) {
+            const g = rowIdx[r];
+            const count = conn == null ? null : rowCounts[g * nConn + conn];
+
+            const members = [], weights = [];
+            for (let gr = r - 1; gr >= 0; gr--) {
+                const win = lookup(gr, WINDOW, r);
+                if (times[gr] + win > times[r]) { members.push(gr); weights.push(lookup(gr, WEIGHT, r)); }
+            }
+
+            if (conn != null) {
+                // libtma connection_matrix on the rebuilt window: g⊗r plus the
+                // response self-term (directed accumulation, folded if unordered).
+                const resp = (k) => codeMatrix[g * nCodes + k];
+                let gi = 0, gj = 0;
+                members.forEach((m, k) => {
+                    gi += weights[k] * codeMatrix[rowIdx[m] * nCodes + ci];
+                    gj += weights[k] * codeMatrix[rowIdx[m] * nCodes + cj];
+                });
+                const rw = lookup(r, WEIGHT, null);
+                const self = ci === cj ? 0 : 0.5 * rw * resp(ci) * resp(cj);
+                const ij = gi * resp(cj) + self;
+                const ji = gj * resp(ci) + self;
+                const rebuilt = ordered ? ij > 0 : (ij + ji) > 0;
+                check.checked++;
+                if (rebuilt !== (count > 0)) check.mismatches.push({ row: g + 1, model: count, rebuilt: rebuilt ? 1 : 0 });
+                if (!(count > 0)) continue;     // not a line behind this connection
+            }
+            windows.push({ unit: unitOf[g], context: contexts.indexOf(ctx), response: g,
+                           members: members.map(m => rowIdx[m]).reverse(), count });
+            any = true;
+        }
+        if (any) used.push(contexts.indexOf(ctx));
+    }
+
+    // check covers every line of the selected units, both ways: a line the
+    // model counts must carry the connection in its rebuilt window, and a line
+    // it doesn't count must not.
+    return {
+        contexts: contexts.map((c, i) => ({ rows: Array.from(c.rowIdx), owner: c.owner, used: used.includes(i) })),
+        windows,
+        check,
+    };
+}
+
+// ── The viewer ───────────────────────────────────────────────────────────────
+
+/**
+ * A self-contained HTML page showing windows (from connectionWindows) with
+ * their conversations. Data goes in as JSON and is rendered with textContent,
+ * so no cell can inject markup. No external requests.
+ *
+ * @param {object} v
+ * @param {string}   v.title, v.subtitle, v.dataFile, v.note
+ * @param {string[]} v.columns       every column of the data, in file order
+ * @param {object}   v.roles         { units: [], conversations: [], codes: [], shown: [] }
+ * @param {string[]} v.highlight     codes of the connection (highlighted)
+ * @param {boolean}  v.ordered
+ * @param {Object[]} v.rows          all data rows
+ * @param {object}   v.result        connectionWindows() output
+ * @param {string[]} v.unitLabels
+ * @param {number}   v.maxWindows
+ * @param {function} [v.rowNumber] row index → the number shown (default index + 1)
+ */
+export function viewerHtml(v) {
+    const { result } = v;
+    const windows = result.windows.slice(0, v.maxWindows);
+    const ctxIds = [...new Set(windows.map(w => w.context))];
+    const rowSet = new Set();
+    for (const c of ctxIds) for (const r of result.contexts[c].rows) rowSet.add(r);
+    const rowIds = [...rowSet].sort((a, b) => a - b);
+    const payload = {
+        title: v.title, subtitle: v.subtitle, note: v.note, dataFile: v.dataFile,
+        columns: v.columns, roles: v.roles, highlight: v.highlight, ordered: v.ordered,
+        total: result.windows.length,
+        rows: Object.fromEntries(rowIds.map(r => [r, v.columns.map(c => v.rows[r][c] ?? '')])),
+        rowNum: Object.fromEntries(rowIds.map(r => [r, v.rowNumber ? v.rowNumber(r) : r + 1])),
+        contexts: ctxIds.map(c => ({ id: c, rows: result.contexts[c].rows })),
+        windows: windows.map(w => ({ unit: v.unitLabels[w.unit].split('__').join('::'), context: w.context,
+                                     response: w.response, members: w.members, count: w.count })),
+    };
+    const json = JSON.stringify(payload).replace(/</g, '\\u003c').replace(/\u2028|\u2029/g, ' ');
+    return `<!DOCTYPE html>
+<html lang="en">
+<head>
+<meta charset="utf-8">
+<meta name="viewport" content="width=device-width, initial-scale=1">
+<title>${escapeHtml(v.title)}</title>
+<style>
+:root { --bg:#fff; --fg:#1f2328; --muted:#59636e; --faint:#818b98; --line:#d1d9e0; --card:#f6f8fa;
+        --resp:#fff8c5; --win:#ddf4ff; --hi:#0969da; color-scheme: light; }
+@media (prefers-color-scheme: dark) { :root { --bg:#0d1117; --fg:#e6edf3; --muted:#9198a1; --faint:#6e7681;
+        --line:#30363d; --card:#151b23; --resp:#3a2f00; --win:#0c2d4a; --hi:#4493f8; color-scheme: dark; } }
+* { box-sizing: border-box; }
+body { margin: 0; background: var(--bg); color: var(--fg); font: 14px/1.45 -apple-system, BlinkMacSystemFont, "Segoe UI", sans-serif; }
+header { padding: 16px 16px 8px; border-bottom: 1px solid var(--line); position: sticky; top: 0; background: var(--bg); z-index: 2; }
+h1 { font-size: 1.25em; margin: 0 0 2px; }
+.sub, .note { color: var(--muted); font-size: .9em; margin: 2px 0; }
+.note { color: var(--faint); }
+.controls { display: flex; flex-wrap: wrap; gap: 8px 16px; align-items: center; margin-top: 8px; font-size: .9em; }
+select, button { font: inherit; color: var(--fg); background: var(--card); border: 1px solid var(--line); border-radius: 6px; padding: 3px 8px; }
+button { cursor: pointer; }
+details.cols { font-size: .9em; } details.cols label { margin-right: 10px; white-space: nowrap; }
+main { padding: 8px 16px 40px; }
+.convo { margin: 18px 0; }
+.convo h2 { font-size: 1em; margin: 0 0 6px; color: var(--muted); font-weight: 600; }
+.scroll { overflow-x: auto; border: 1px solid var(--line); border-radius: 8px; }
+table { border-collapse: collapse; width: 100%; font-size: .9em; }
+th, td { text-align: left; padding: 4px 8px; border-bottom: 1px solid var(--line); vertical-align: top; }
+th { background: var(--card); position: sticky; top: 0; font-weight: 600; white-space: nowrap; }
+td.num { color: var(--faint); white-space: nowrap; font-variant-numeric: tabular-nums; }
+tr.win td { background: var(--win); }
+tr.resp td { background: var(--resp); }
+tr.resp td.num::before { content: "▶ "; }
+td.role { white-space: nowrap; color: var(--muted); font-size: .85em; }
+th.hi { box-shadow: inset 0 -2px 0 var(--hi); }
+td.code { text-align: center; font-variant-numeric: tabular-nums; }
+td.hi { box-shadow: inset 2px 0 0 var(--hi), inset -2px 0 0 var(--hi); font-weight: 600; }
+tr.gap td { text-align: center; color: var(--faint); cursor: pointer; font-size: .85em; }
+.empty { color: var(--muted); padding: 24px 0; }
+@media (max-width: 700px) { header { position: static; } }
+</style>
+</head>
+<body>
+<header>
+  <h1 id="title"></h1>
+  <p class="sub" id="subtitle"></p>
+  <p class="note" id="note"></p>
+  <div class="controls">
+    <label>Unit <select id="unit"></select></label>
+    <span><button id="prev" type="button">◀</button> <span id="pos"></span> <button id="next" type="button">▶</button></span>
+    <details class="cols"><summary>Columns</summary><div id="cols"></div></details>
+  </div>
+</header>
+<main id="main"></main>
+<script type="application/json" id="data">${json}</script>
+<script>
+(function () {
+  var D = JSON.parse(document.getElementById('data').textContent);
+  var $ = function (id) { return document.getElementById(id); };
+  var el = function (tag, cls, text) { var e = document.createElement(tag); if (cls) e.className = cls; if (text != null) e.textContent = text; return e; };
+  $('title').textContent = D.title; $('subtitle').textContent = D.subtitle; $('note').textContent = D.note;
+  document.title = D.title;
+  var codeSet = new Set(D.roles.codes), hi = new Set(D.highlight);
+  var shown = new Set(D.roles.shown);
+  var colIdx = {}; D.columns.forEach(function (c, i) { colIdx[c] = i; });
+
+  var cols = $('cols');
+  D.columns.forEach(function (c) {
+    var l = el('label'), cb = el('input'); cb.type = 'checkbox'; cb.checked = shown.has(c);
+    cb.onchange = function () { if (cb.checked) shown.add(c); else shown.delete(c); render(); };
+    l.appendChild(cb); l.appendChild(document.createTextNode(' ' + c)); cols.appendChild(l);
+  });
+
+  var units = Array.from(new Set(D.windows.map(function (w) { return w.unit; })));
+  var sel = $('unit'); sel.appendChild(new Option('All units (' + units.length + ')', ''));
+  units.forEach(function (u) { sel.appendChild(new Option(u, u)); });
+  sel.onchange = function () { cursor = -1; render(); };
+
+  var cursor = -1;
+  function visibleWindows() { return D.windows.filter(function (w) { return !sel.value || w.unit === sel.value; }); }
+
+  function render() {
+    var main = $('main'); main.textContent = '';
+    var wins = visibleWindows();
+    var more = D.total > D.windows.length ? ' (first ' + D.windows.length + ' of ' + D.total + ')' : '';
+    $('pos').textContent = wins.length ? (cursor >= 0 ? (cursor + 1) + ' / ' : '') + wins.length + ' windows' + more : 'no windows';
+    if (!wins.length) { main.appendChild(el('p', 'empty', 'No lines behind this connection for the selection.')); return; }
+    var byCtx = new Map();
+    wins.forEach(function (w) { if (!byCtx.has(w.context)) byCtx.set(w.context, []); byCtx.get(w.context).push(w); });
+    // The web tool's Data View order: units, conversations, other columns, codes.
+    var lead = D.roles.units.concat(D.roles.conversations.filter(function (c) { return D.roles.units.indexOf(c) < 0; }));
+    var showCols = lead.filter(function (c) { return shown.has(c); })
+      .concat(D.columns.filter(function (c) { return shown.has(c) && lead.indexOf(c) < 0 && !codeSet.has(c); }))
+      .concat(D.roles.codes.filter(function (c) { return shown.has(c); }));
+    D.contexts.forEach(function (ctx) {
+      var ws = byCtx.get(ctx.id); if (!ws) return;
+      var resp = new Map(), win = new Set();
+      ws.forEach(function (w) { resp.set(w.response, w); w.members.forEach(function (m) { win.add(m); }); });
+      var keep = new Set(); resp.forEach(function (_, r) { keep.add(r); }); win.forEach(function (r) { keep.add(r); });
+      var box = el('section', 'convo');
+      var first = D.rows[ctx.rows[0]];
+      box.appendChild(el('h2', null, D.roles.conversations.map(function (c) { return c + ': ' + first[colIdx[c]]; }).join(' · ') +
+        '  —  ' + ws.length + ' window' + (ws.length === 1 ? '' : 's')));
+      var sc = el('div', 'scroll'), t = el('table'), head = el('tr');
+      head.appendChild(el('th', null, 'Row')); head.appendChild(el('th', null, ''));
+      showCols.forEach(function (c) { head.appendChild(el('th', hi.has(c) ? 'hi' : null, c)); });
+      var thead = el('thead'); thead.appendChild(head); t.appendChild(thead);
+      var tb = el('tbody'); t.appendChild(tb);
+      var gap = [];
+      function flushGap() {
+        if (!gap.length) return;
+        var hidden = gap.slice(); gap = [];
+        var tr = el('tr', 'gap'), td = el('td', null, '… ' + hidden.length + ' line' + (hidden.length === 1 ? '' : 's') + ' …');
+        td.colSpan = 2 + showCols.length; tr.appendChild(td);
+        tr.onclick = function () { var anchor = tr; hidden.forEach(function (r) { var row = rowEl(r); anchor.after(row); anchor = row; }); tr.remove(); };
+        tb.appendChild(tr);
+      }
+      function rowEl(r) {
+        var vals = D.rows[r], tr = el('tr', resp.has(r) ? 'resp' : (win.has(r) ? 'win' : ''));
+        tr.id = 'row-' + r;
+        tr.appendChild(el('td', 'num', String(D.rowNum[r])));
+        var role = resp.has(r) ? (D.ordered ? 'response' : 'line') : (win.has(r) ? (D.ordered ? 'ground' : 'window') : '');
+        tr.appendChild(el('td', 'role', role));
+        showCols.forEach(function (c) {
+          var cls = codeSet.has(c) ? 'code' + (hi.has(c) ? ' hi' : '') : null;
+          tr.appendChild(el('td', cls, String(vals[colIdx[c]])));
+        });
+        return tr;
+      }
+      ctx.rows.forEach(function (r) { if (keep.has(r)) { flushGap(); tb.appendChild(rowEl(r)); } else gap.push(r); });
+      flushGap();
+      sc.appendChild(t); box.appendChild(sc); main.appendChild(box);
+    });
+  }
+  function go(step) {
+    var wins = visibleWindows(); if (!wins.length) return;
+    cursor = (cursor + step + wins.length) % wins.length;
+    render();
+    var row = document.getElementById('row-' + wins[cursor].response);
+    if (row) row.scrollIntoView({ block: 'center' });
+  }
+  $('prev').onclick = function () { go(-1); }; $('next').onclick = function () { go(1); };
+  render();
+})();
+</script>
+</body>
+</html>
+`;
+}
+
+function escapeHtml(s) {
+    return String(s).replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;').replace(/"/g, '&quot;');
+}

package/manifest.json

@@ -0,0 +1,120 @@
+{
+  "manifest_version": "0.2",
+  "name": "qe-mcp-ena",
+  "display_name": "ENA — Epistemic Network Analysis",
+  "version": "0.1.18",
+  "description": "Epistemic Network Analysis on tabular coded data. Runs entirely on your machine — data never leaves your computer.",
+  "long_description": "Run Epistemic Network Analysis (ENA), ordered network analysis (ONA) and transmodal analysis (TMA) on your coded data from a conversation with Claude. No R or Python to install.\n\n**Your data stays on your machine**\n\n- The analysis runs locally. Only results — networks, points, statistics and plots — go back to the conversation.\n- Give Claude a file path rather than pasting data; the server reads the file itself.\n- It makes no network connections, starts no other programs, and writes files only when you ask for an export.\n\n**About the install warning**\n\nClaude Desktop shows \"access to everything on your computer\" for every extension outside Anthropic's reviewed directory. It means you are trusting the source, as with any program you install. The source is published on npm as @qe-mcp/ena.\n\nDocumentation and example prompts: https://qe-libs.org/mcp/qe-mcp-ena/",
+  "author": {
+    "name": "Cody L Marquart",
+    "email": "clmarquart@wisc.edu"
+  },
+  "homepage": "https://qe-libs.org/mcp/qe-mcp-ena/",
+  "documentation": "https://qe-libs.org/mcp/qe-mcp-ena/",
+  "license": "GPL-3.0-only",
+  "keywords": [
+    "ena",
+    "epistemic-network-analysis",
+    "quantitative-ethnography",
+    "discourse-analysis",
+    "learning-analytics",
+    "wasm"
+  ],
+  "server": {
+    "type": "node",
+    "entry_point": "server.js",
+    "mcp_config": {
+      "command": "node",
+      "args": [
+        "${__dirname}/server.js"
+      ],
+      "env": {}
+    }
+  },
+  "tools": [
+    {
+      "name": "ena_guide",
+      "description": "The analysis guide: privacy, workflow, rotations, ONA/TMA and reading results."
+    },
+    {
+      "name": "ena_profile",
+      "description": "Privacy-safe column metadata for a local CSV — no raw data transmitted."
+    },
+    {
+      "name": "ena_inspect",
+      "description": "Triage a dataset for ENA suitability; suggests codes, units, and conversations."
+    },
+    {
+      "name": "ena_fit",
+      "description": "Fit a full ENA model (SVD, means or generalized rotation); returns a reusable model_id, a network plot, and group tests when two groups are named."
+    },
+    {
+      "name": "ena_compare_groups",
+      "description": "Mean-rotation comparison of two groups; returns a model_id, plots, and per-dimension t / Mann-Whitney tests."
+    },
+    {
+      "name": "tma_fit",
+      "description": "Fit a directed TMA / ONA model with context-tensor accumulation; returns a model_id and group tests when two groups are named."
+    },
+    {
+      "name": "tma_accumulate",
+      "description": "TMA / ONA accumulation step only — raw per-unit directed networks."
+    },
+    {
+      "name": "ena_plot",
+      "description": "Render a network view (all, group, unit, comparison, subtraction) from a cached model_id."
+    },
+    {
+      "name": "ena_accumulate",
+      "description": "Accumulation step only — raw per-unit co-occurrence networks."
+    },
+    {
+      "name": "ena_window",
+      "description": "Estimate the window size from the data by Cross-Covariance Decay (= rENA ena.ccd)."
+    },
+    {
+      "name": "ena_export",
+      "description": "Write a fitted model as an ENA Web Tool project ZIP, to open there as the same model and plot."
+    },
+    {
+      "name": "ena_tables",
+      "description": "Write a fitted model's points, node positions, line weights and connection counts as CSV files (the ENA Web Tool's Download Model tables)."
+    },
+    {
+      "name": "ena_lines",
+      "description": "Show the lines behind a connection in a local viewer (the ENA Web Tool's Data View); returns counts and row numbers, never text."
+    },
+    {
+      "name": "ena_simplify",
+      "description": "Simplify a model with PRIA (the ENA Web Tool's Simplify Model): remove the codes it can do without and refit."
+    }
+  ],
+  "prompts": [
+    {
+      "name": "analyze_data",
+      "description": "Analyze a coded data file with ENA, following the analysis guide.",
+      "arguments": [
+        "data_path",
+        "question"
+      ],
+      "text": "Analyze the data at ${arguments.data_path} with Epistemic Network Analysis. ${arguments.question} Call ena_guide first and follow it: ask me whether the data is sensitive, learn its structure with ena_profile or ena_inspect, estimate a window, fit, plot, and interpret the result."
+    },
+    {
+      "name": "compare_groups",
+      "description": "Compare two groups' networks with ENA: means rotation, difference plot and statistics.",
+      "arguments": [
+        "data_path",
+        "group_column"
+      ],
+      "text": "Compare the groups in ${arguments.data_path} (group column: ${arguments.group_column}) with ENA. Call ena_guide first and follow it: ask me whether the data is sensitive, profile the data, fit with ena_compare_groups, show the difference plot, and report the group statistics and which connections drive the difference."
+    },
+    {
+      "name": "order_and_sequence",
+      "description": "Model order and sequence with directed ONA / transmodal TMA networks.",
+      "arguments": [
+        "data_path"
+      ],
+      "text": "Analyze order and sequence in ${arguments.data_path} with directed (ONA) or transmodal (TMA) networks. Call ena_guide with topic \"ordered-and-transmodal-networks-ona-tma\" first and follow it, after asking me whether the data is sensitive."
+    }
+  ]
+}

package/package.json

@@ -1,6 +1,43 @@
 {
   "name": "@qe-mcp/ena",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
-}
+  "version": "0.1.18",
+  "description": "Epistemic Network Analysis for Claude and other assistants — runs on your machine",
+  "repository": {
+    "type": "git",
+    "url": "https://gitlab.com/epistemic-analytics/qe-packages/server-ena.git"
+  },
+  "type": "module",
+  "main": "server.js",
+  "bin": {
+    "qe-mcp-ena": "./server.js"
+  },
+  "files": [
+    "server.js",
+    "webena.js",
+    "xlsx.js",
+    "lines.js",
+    "manifest.json",
+    "fonts/",
+    "hooks/",
+    "skill/"
+  ],
+  "scripts": {
+    "start": "node server.js"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.4.0",
+    "@qe-libs/qeviz": "0.7.0",
+    "@qe-libs/rena-wasm": "^0.1.14",
+    "@resvg/resvg-wasm": "^2.6.2"
+  },
+  "optionalDependencies": {
+    "@resvg/resvg-js": "^2.6.2"
+  },
+  "keywords": [
+    "mcp",
+    "ena",
+    "epistemic-network-analysis",
+    "wasm"
+  ],
+  "license": "GPL-3.0-only"
+}