@lucern/graph-primitives 1.0.0 → 1.0.1

package/dist/epistemicNodeCreation.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/globalId.ts","../src/convex.ts","../src/epistemicLayerRules.ts","../src/epistemicEdgeCreation.ts","../src/epistemicNodeCreation.ts"],"names":["contentHash","existing"],"mappings":";;;AAaO,SAAS,gBAAA,GAA2B;AACzC,EAAA,MAAM,KAAA,GAAQ,IAAI,UAAA,CAAW,EAAE,CAAA;AAC/B,EAAA,MAAA,CAAO,gBAAgB,KAAK,CAAA;AAE5B,EAAA,KAAA,CAAM,CAAC,CAAA,GAAK,KAAA,CAAM,CAAC,IAAI,EAAA,GAAQ,EAAA;AAC/B,EAAA,KAAA,CAAM,CAAC,CAAA,GAAK,KAAA,CAAM,CAAC,IAAI,EAAA,GAAQ,GAAA;AAC/B,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,IAAA,CAAK,KAAA,EAAO,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,IAAA;AAAA,IACpE;AAAA,GACF;AACA,EAAA,OAAO,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,EAAE,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,KAAA,CAAM,EAAA,EAAI,EAAE,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,KAAA,CAAM,EAAE,CAAC,CAAA,CAAA;AAC1G;ACT0B,iBAAA;AACnB,IAAM,QAAA,GAAW,MAAA;;;ACiDjB,SAAS,aAAa,QAAA,EAAkC;AAC7D,EAAA,QAAQ,QAAA;AAAU;AAAA,IAEhB,KAAK,UAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA,IAGT,KAAK,QAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,OAAA;AAAA,IACL,KAAK,MAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA,IAGT,KAAK,OAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,QAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA,IAGT,KAAK,aAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,QAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA,IAGT,KAAK,SAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,aAAA;AACH,MAAA,OAAO,aAAA;AAAA;AAAA,IAGT,KAAK,OAAA;AACH,MAAA,OAAO,gBAAA;AAAA,IAET;AAEE,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,sCAAsC,QAAQ,CAAA,kBAAA;AAAA,OAChD;AACA,MAAA,OAAO,IAAA;AAAA;AAEb;AAkQO,IAAM,gBAAA,GAGT;AAAA;AAAA,EAEF,eAAA,EAAiB;AAAA,IACf,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,iBAAA,EAAmB;AAAA,IACjB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,wBAAA,EAA0B;AAAA,IACxB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,iBAAA,EAAmB;AAAA,IACjB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,CAAC,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA;AAAA,IACvB,EAAA,EAAI,CAAC,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA;AAAA,IACrB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,SAAA,EAAW;AAAA,IACT,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,KAAA,EAAO;AAAA,IACL,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAA,EAAM,IAAI,CAAA;AAAA,IACf,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,iBAAA,EAAmB;AAAA,IACjB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,UAAA,EAAY;AAAA,IACV,IAAA,EAAM,CAAC,IAAA,EAAM,IAAI,CAAA;AAAA;AAAA,IACjB,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,SAAA,EAAW;AAAA,IACT,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,gBAAgB,CAAA;AAAA,IACrB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,SAAA,EAAW;AAAA,IACT,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,eAAA,EAAiB;AAAA,IACf,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,oBAAA,EAAsB;AAAA,IACpB,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,UAAA,EAAY;AAAA,IACV,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA,EACA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,aAAa,CAAA;AAAA,IACpB,EAAA,EAAI,CAAC,aAAa,CAAA;AAAA,IAClB,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,UAAA,EAAY;AAAA,IACV,MAAM,CAAC,IAAA,EAAM,MAAM,IAAA,EAAM,IAAA,EAAM,eAAe,gBAAgB,CAAA;AAAA,IAC9D,IAAI,CAAC,IAAA,EAAM,MAAM,IAAA,EAAM,IAAA,EAAM,eAAe,gBAAgB,CAAA;AAAA,IAC5D,WAAA,EAAa;AAAA,GACf;AAAA,EACA,OAAA,EAAS;AAAA,IACP,MAAM,CAAC,IAAA,EAAM,MAAM,IAAA,EAAM,IAAA,EAAM,eAAe,gBAAgB,CAAA;AAAA,IAC9D,IAAI,CAAC,IAAA,EAAM,MAAM,IAAA,EAAM,IAAA,EAAM,eAAe,gBAAgB,CAAA;AAAA,IAC5D,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,UAAA,EAAY;AAAA,IACV,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,UAAA,EAAY;AAAA,IACV,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,SAAA,EAAW;AAAA,IACT,IAAA,EAAM,CAAC,IAAA,EAAM,gBAAgB,CAAA;AAAA,IAC7B,EAAA,EAAI,CAAC,IAAA,EAAM,gBAAgB,CAAA;AAAA,IAC3B,WAAA,EACE;AAAA,GACJ;AAAA,EACA,QAAA,EAAU;AAAA,IACR,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,gBAAA,EAAkB;AAAA,IAChB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,WAAA,EAAa;AAAA,IACX,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA;AAAA,EAGA,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EACE;AAAA,GACJ;AAAA,EACA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EACE;AAAA,GACJ;AAAA,EACA,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EAAa;AAAA,GACf;AAAA,EACA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,EAAA,EAAI,CAAC,IAAI,CAAA;AAAA,IACT,WAAA,EACE;AAAA;AACJ;AAAA;AAAA;AAKF,CAAA;AAOO,SAAS,kBAAA,CACd,QAAA,EACA,SAAA,EACA,OAAA,EACqC;AACrC,EAAA,MAAM,KAAA,GAAQ,iBAAiB,QAAQ,CAAA;AAGvC,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,uCAAuC,QAAQ,CAAA,qBAAA;AAAA,KACjD;AACA,IAAA,OAAO,EAAE,OAAO,IAAA,EAAK;AAAA,EACvB;AAGA,EAAA,IAAI,aAAa,YAAA,EAAc;AAC7B,IAAA,IAAI,cAAc,OAAA,EAAS;AACzB,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,KAAA;AAAA,QACP,QAAQ,CAAA,EAAG,QAAQ,CAAA,oDAAA,EAAuD,SAAS,WAAM,OAAO,CAAA;AAAA,OAClG;AAAA,IACF;AACA,IAAA,OAAO,EAAE,OAAO,IAAA,EAAK;AAAA,EACvB;AAGA,EAAA,IAAI,CAAC,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AACnC,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,KAAA;AAAA,MACP,MAAA,EAAQ,CAAA,WAAA,EAAc,QAAQ,CAAA,8BAAA,EAAiC,SAAS,cAAc,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,KAC7G;AAAA,EACF;AAGA,EAAA,IAAI,CAAC,KAAA,CAAM,EAAA,CAAG,QAAA,CAAS,OAAO,CAAA,EAAG;AAC/B,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,KAAA;AAAA,MACP,MAAA,EAAQ,CAAA,WAAA,EAAc,QAAQ,CAAA,8BAAA,EAAiC,OAAO,cAAc,KAAA,CAAM,EAAA,CAAG,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,KACzG;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAO,IAAA,EAAK;AACvB;;;AC9iBA,eAAsB,mBAAA,CACpB,KACA,MAAA,EAaiB;AACjB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAGlC,EAAA,MAAM,WAAW,MAAM,GAAA,CAAI,EAAA,CAAG,GAAA,CAAI,OAAO,UAAU,CAAA;AACnD,EAAA,MAAM,SAAS,MAAM,GAAA,CAAI,EAAA,CAAG,GAAA,CAAI,OAAO,QAAQ,CAAA;AAE/C,EAAA,IAAI,CAAC,QAAA,IAAY,CAAC,MAAA,EAAQ;AACxB,IAAA,MAAM,IAAI,MAAM,6BAA6B,CAAA;AAAA,EAC/C;AAGA,EAAA,MAAM,SAAA,GAAY,QAAA,CAAS,cAAA,IAAkB,YAAA,CAAa,SAAS,QAAQ,CAAA;AAC3E,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,cAAA,IAAkB,YAAA,CAAa,OAAO,QAAQ,CAAA;AAGrE,EAAA,IAAI,CAAC,OAAO,mBAAA,EAAqB;AAC/B,IAAA,MAAM,UAAA,GAAa,kBAAA,CAAmB,MAAA,CAAO,QAAA,EAAU,WAAW,OAAO,CAAA;AACzE,IAAA,IAAI,CAAC,WAAW,KAAA,EAAO;AACrB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR,CAAA,+BAAA,EAAkC,UAAA,CAAW,MAAM,CAAA,aAAA,EACnC,OAAO,QAAQ,CAAA,MAAA,EAAS,QAAA,CAAS,QAAQ,IAAI,SAAS,CAAA,SAAA,EAAO,MAAA,CAAO,QAAQ,IAAI,OAAO,CAAA,CAAA;AAAA,OACzG;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,IAAI,SAAA,CAAU,QAAA,CAAS,CAAA,EAAG,QAAA,CAAS,aAAa,UAAA,EAAY;AAAA,IAChE,QAAA;AAAA,IACA,cAAc,QAAA,CAAS,QAAA;AAAA,IACvB,YAAY,MAAA,CAAO,QAAA;AAAA,IACnB,UAAU,MAAA,CAAO,QAAA;AAAA,IACjB,QAAQ,MAAA,CAAO,MAAA;AAAA,IACf,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,WAAW,MAAA,CAAO,SAAA;AAAA,IAClB,SAAS,MAAA,CAAO,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,SAAS,CAAA,GAAI,MAAA;AAAA,IACvD,cAAc,QAAA,CAAS,QAAA;AAAA,IACvB,YAAY,MAAA,CAAO,QAAA;AAAA,IACnB,SAAA;AAAA,IACA;AAAA,GACD,CAAA;AAED,EAAA,OAAO,QAAA;AACT;;;ACpLA,SAAS,mBAAA,CAAoB,UAAkB,IAAA,EAAsB;AACnE,EAAA,MAAM,UAAU,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,aAAA,CAAc,IAAI,CAAC,CAAA,CAAA;AAGlD,EAAA,IAAI,IAAA,GAAO,IAAA;AACX,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,IAAA,IAAA,GAAA,CAAQ,IAAA,IAAQ,CAAA,IAAK,IAAA,GAAO,OAAA,CAAQ,WAAW,CAAC,CAAA;AAChD,IAAA,IAAA,IAAQ,IAAA;AAAA,EACV;AAGA,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,CAAE,SAAS,EAAE,CAAA,CAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AAE3D,EAAA,MAAM,SAAA,GAAY,QAAQ,MAAA,CAAO,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAC7D,EAAA,MAAM,QAAA,GAAW,QACd,KAAA,CAAM,EAAE,EACR,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,EAAE,UAAA,CAAW,CAAC,GAAG,CAAC,CAAA,CACvC,SAAS,EAAE,CAAA,CACX,QAAA,CAAS,CAAA,EAAG,GAAG,CAAA;AAElB,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,EAAG,SAAS,GAAG,QAAQ,CAAA,CAAA;AAC1C;AAKA,SAAS,cAAc,IAAA,EAAsB;AAC3C,EAAA,OAAO,KAAK,IAAA,EAAK,CAAE,aAAY,CAAE,OAAA,CAAQ,QAAQ,GAAG,CAAA;AACtD;AA0BA,SAAS,qBAAqB,UAAA,EAA0C;AACtE,EAAA,QAAQ,UAAA;AAAY,IAClB,KAAK,UAAA;AAAA,IACL,KAAK,aAAA;AACH,MAAA,OAAO,OAAA;AAAA,IACT,KAAK,cAAA;AACH,MAAA,OAAO,cAAA;AAAA,IACT;AACE,MAAA,OAAO,OAAA;AAAA;AAEb;AAKA,SAAS,sBAAsB,MAAA,EAA8C;AAC3E,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,mBAAA;AACH,MAAA,OAAO,gBAAA;AAAA,IACT,KAAK,eAAA;AAAA,IACL,KAAK,cAAA;AACH,MAAA,OAAO,aAAA;AAAA,IACT;AACE,MAAA,OAAO,YAAA;AAAA;AAEb;AAUA,eAAsB,6BAAA,CACpB,GAAA,EACA,UAAA,EACA,OAAA,EAsB+B;AAC/B,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAClC,EAAA,MAAM,WAAA,GAAc,mBAAA,CAAoB,UAAA,EAAY,OAAA,CAAQ,IAAI,CAAA;AAGhE,EAAA,MAAM,WAAW,MAAM,GAAA,CAAI,EAAA,CACxB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,gBAAA,EAAkB,CAAC,MAAM,CAAA,CAAE,EAAA,CAAG,eAAe,WAAW,CAAC,EACnE,KAAA,EAAM;AAET,EAAA,IAAI,QAAA,IAAY,QAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC5C,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,GAAA,EAAK;AAAA,MAC/B,SAAA,EAAW;AAAA,KACZ,CAAA;AACD,IAAA,OAAO,QAAA,CAAS,GAAA;AAAA,EAClB;AAEA,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,OAAO,gBAAA,EAAkB;AAAA,IACnD,QAAA;AAAA,IACA,QAAA,EAAU,UAAA;AAAA,IACV,cAAA,EAAgB,IAAA;AAAA;AAAA,IAChB,eAAe,OAAA,CAAQ,IAAA;AAAA,IACvB,WAAA;AAAA,IACA,KAAA,EACE,OAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,IAAK,OAAA,CAAQ,IAAA,CAAK,MAAA,GAAS,GAAA,GAAM,KAAA,GAAQ,EAAA,CAAA;AAAA,IACpE,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,QAAA,EAAU;AAAA,MACR,MAAM,OAAA,CAAQ,IAAA;AAAA,MACd,MAAA,EAAQ,QAAQ,IAAA,EAAM,IAAA;AAAA,QAAK,CAAC,CAAA,KAC1B;AAAA,UACE,QAAA;AAAA,UACA,aAAA;AAAA,UACA,SAAA;AAAA,UACA,MAAA;AAAA,UACA,YAAA;AAAA,UACA,YAAA;AAAA,UACA,QAAA;AAAA,UACA,UAAA;AAAA,UACA,YAAA;AAAA,UACA;AAAA,SACF,CAAE,SAAS,CAAC;AAAA,OACd;AAAA;AAAA,MAEA,kBAAkB,OAAA,CAAQ,gBAAA;AAAA;AAAA,MAE1B,kBAAkB,OAAA,CAAQ,gBAAA;AAAA;AAAA,MAE1B,cAAc,OAAA,CAAQ;AAAA,KACxB;AAAA,IACA,UAAA,EAAY,oBAAA,CAAqB,OAAA,CAAQ,UAAU,CAAA;AAAA,IACnD,YAAY,OAAA,CAAQ,UAAA;AAAA,IACpB,UAAA,EACE,OAAA,CAAQ,kBAAA,KAAuB,mBAAA,GAC3B,GAAA,GACA,OAAA,CAAQ,kBAAA,KAAuB,eAAA,GAC7B,GAAA,GACA,OAAA,CAAQ,kBAAA,KAAuB,cAAA,GAC7B,GAAA,GACA,GAAA;AAAA,IACV,kBAAA,EAAoB,qBAAA,CAAsB,OAAA,CAAQ,kBAAkB,CAAA;AAAA,IACpE,MAAA,EAAQ,QAAA;AAAA,IACR,SAAS,OAAA,CAAQ,SAAA;AAAA,IACjB,WAAW,OAAA,CAAQ,SAAA;AAAA,IACnB,SAAA,EAAW,GAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACZ,CAAA;AAGD,EAAA,IAAI,QAAQ,gBAAA,EAAkB;AAE5B,IAAA,MAAM,aAAa,MAAM,sBAAA;AAAA,MACvB,GAAA;AAAA,MACA,OAAA,CAAQ,gBAAA;AAAA,MACR,OAAA,CAAQ,SAAA;AAAA,MACR,OAAA,CAAQ;AAAA,KACV;AACA,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,MAAM,oBAAoB,GAAA,EAAK;AAAA,QAC7B,UAAA,EAAY,MAAA;AAAA,QACZ,QAAA,EAAU,UAAA;AAAA,QACV,QAAA,EAAU,cAAA;AAAA,QACV,WAAW,OAAA,CAAQ,SAAA;AAAA,QACnB,WAAW,OAAA,CAAQ;AAAA,OACpB,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAMA,eAAsB,4BAAA,CACpB,GAAA,EACA,QAAA,EACA,MAAA,EAiB+B;AAC/B,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAClC,EAAA,MAAM,WAAA,GAAc,mBAAA,CAAoB,QAAA,EAAU,MAAA,CAAO,MAAM,CAAA;AAG/D,EAAA,MAAM,WAAW,MAAM,GAAA,CAAI,EAAA,CACxB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,gBAAA,EAAkB,CAAC,MAAM,CAAA,CAAE,EAAA,CAAG,eAAe,WAAW,CAAC,EACnE,KAAA,EAAM;AAET,EAAA,IAAI,QAAA,IAAY,QAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC5C,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,GAAA,EAAK;AAAA,MAC/B,QAAA,EAAU;AAAA,QACR,GAAK,QAAA,CAAS,QAAA,IAAwC,EAAC;AAAA,QACvD,cAAA,EAAgB;AAAA,OAClB;AAAA,MACA,SAAA,EAAW;AAAA,KACZ,CAAA;AACD,IAAA,OAAO,QAAA,CAAS,GAAA;AAAA,EAClB;AAEA,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,OAAO,gBAAA,EAAkB;AAAA,IACnD,QAAA;AAAA,IACA,QAAA,EAAU,QAAA;AAAA,IACV,cAAA,EAAgB,IAAA;AAAA;AAAA,IAChB,eAAe,MAAA,CAAO,MAAA;AAAA,IACtB,WAAA;AAAA,IACA,SAAS,MAAA,CAAO,SAAA;AAAA,IAChB,KAAA,EACE,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,IAAK,MAAA,CAAO,MAAA,CAAO,MAAA,GAAS,GAAA,GAAM,KAAA,GAAQ,EAAA,CAAA;AAAA,IACtE,QAAA,EAAU;AAAA,MACR,cAAA,EAAgB,QAAA;AAAA,MAChB,YAAA,EAAc,YAAA;AAAA,MACd,OAAO,MAAA,CAAO,KAAA;AAAA;AAAA,MACd,QAAQ,MAAA,CAAO,KAAA;AAAA;AAAA;AAAA,MAEf,WAAW,MAAA,CAAO,SAAA;AAAA,MAClB,MAAA,EAAQ,QAAA;AAAA;AAAA,MAER,cAAc,MAAA,CAAO;AAAA,KACvB;AAAA,IACA,YAAA,EAAc,YAAA;AAAA,IACd,eAAA,EAAiB,YAAA;AAAA,IACjB,UAAA,EAAY,OAAA;AAAA,IACZ,UAAA,EAAY,MAAA;AAAA;AAAA,IACZ,kBAAA,EAAoB,YAAA;AAAA,IACpB,MAAA,EAAQ,QAAA;AAAA,IACR,SAAS,MAAA,CAAO,SAAA;AAAA,IAChB,WAAW,MAAA,CAAO,SAAA;AAAA,IAClB,SAAA,EAAW,GAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,OAAO,MAAA;AACT;AAMA,eAAsB,8BAAA,CACpB,GAAA,EACA,WAAA,EACA,QAAA,EAiB+B;AAC/B,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAClC,EAAA,MAAM,WAAA,GAAc,mBAAA,CAAoB,UAAA,EAAY,QAAA,CAAS,QAAQ,CAAA;AAGrE,EAAA,MAAM,WAAW,MAAM,GAAA,CAAI,EAAA,CACxB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,gBAAA,EAAkB,CAAC,MAAM,CAAA,CAAE,EAAA,CAAG,eAAe,WAAW,CAAC,EACnE,KAAA,EAAM;AAET,EAAA,IAAI,QAAA,IAAY,QAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC5C,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,GAAA,EAAK;AAAA,MAC/B,SAAA,EAAW;AAAA,KACZ,CAAA;AACD,IAAA,OAAO,QAAA,CAAS,GAAA;AAAA,EAClB;AAEA,EAAA,MAAM,UAAA,GACJ,SAAS,MAAA,KAAW,QAAA,GAChB,UACA,QAAA,CAAS,MAAA,KAAW,iBAClB,cAAA,GACA,cAAA;AAER,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,OAAO,gBAAA,EAAkB;AAAA,IACnD,QAAA;AAAA,IACA,QAAA,EAAU,UAAA;AAAA,IACV,cAAA,EAAgB,IAAA;AAAA;AAAA,IAChB,eAAe,QAAA,CAAS,QAAA;AAAA,IACxB,WAAA;AAAA,IACA,KAAA,EACE,QAAA,CAAS,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,IAC7B,QAAA,CAAS,QAAA,CAAS,MAAA,GAAS,GAAA,GAAM,KAAA,GAAQ,EAAA,CAAA;AAAA,IAC5C,QAAA,EAAU;AAAA,MACR,QAAQ,QAAA,CAAS,QAAA;AAAA,MACjB,UAAU,QAAA,CAAS,QAAA;AAAA,MACnB,QAAQ,QAAA,CAAS,MAAA;AAAA;AAAA,MAEjB,cAAc,QAAA,CAAS;AAAA,KACzB;AAAA,IACA,UAAA;AAAA,IACA,kBAAA,EAAoB,YAAA;AAAA,IACpB,MAAA,EAAQ,QAAA;AAAA,IACR,SAAS,QAAA,CAAS,SAAA;AAAA,IAClB,WAAW,QAAA,CAAS,SAAA;AAAA,IACpB,SAAA,EAAW,GAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,OAAO,MAAA;AACT;AAiBA,eAAsB,8BAAA,CACpB,GAAA,EACA,UAAA,EACA,QAAA,EAS+B;AAC/B,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAGlC,EAAA,IAAI,QAAA,GAA8B,QAAA;AAClC,EAAA,MAAM,cACJ,QAAA,CAAS,cAAA,IACT,QAAA,CAAS,IAAA,CAAK,SAAS,MAAM,CAAA,IAC7B,QAAA,CAAS,IAAA,CAAK,SAAS,UAAU,CAAA,IACjC,QAAA,CAAS,IAAA,CAAK,SAAS,QAAQ,CAAA;AAEjC,EAAA,IAAI,WAAA,EAAa;AACf,IAAA,QAAA,GAAW,WAAA;AAOX,IAAA,OAAA,CAAQ,GAAA;AAAA,MACN,CAAA,yDAAA,EAA4D,SAAS,IAAI,CAAA,0CAAA;AAAA,KAE3E;AAIA,IAAA,MAAMA,YAAAA,GAAc,mBAAA;AAAA,MAClB,QAAA;AAAA,MACA,SAAS,KAAA,GAAQ,QAAA,CAAS,OAAA,CAAQ,KAAA,CAAM,GAAG,GAAG;AAAA,KAChD;AACA,IAAA,MAAMC,YAAW,MAAM,GAAA,CAAI,EAAA,CACxB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,gBAAA,EAAkB,CAAC,MAAM,CAAA,CAAE,EAAA,CAAG,eAAeD,YAAW,CAAC,EACnE,KAAA,EAAM;AAET,IAAA,IAAIC,SAAAA,IAAYA,SAAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC5C,MAAA,OAAOA,SAAAA,CAAS,GAAA;AAAA,IAClB;AAIA,IAAA,MAAM,IAAI,MAAM,8BAA8B,CAAA;AAAA,EAChD;AAEA,EAAA,MAAM,WAAA,GAAc,mBAAA;AAAA,IAClB,QAAA;AAAA,IACA,SAAS,KAAA,GAAQ,QAAA,CAAS,OAAA,CAAQ,KAAA,CAAM,GAAG,GAAG;AAAA,GAChD;AAGA,EAAA,MAAM,WAAW,MAAM,GAAA,CAAI,EAAA,CACxB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,gBAAA,EAAkB,CAAC,MAAM,CAAA,CAAE,EAAA,CAAG,eAAe,WAAW,CAAC,EACnE,KAAA,EAAM;AAET,EAAA,IAAI,QAAA,IAAY,QAAA,CAAS,MAAA,KAAW,QAAA,EAAU;AAC5C,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,GAAA,EAAK;AAAA,MAC/B,QAAA,EAAU;AAAA,QACR,GAAK,QAAA,CAAS,QAAA,IAAwC,EAAC;AAAA,QACvD,gBAAA,EAAkB;AAAA,OACpB;AAAA,MACA,SAAA,EAAW;AAAA,KACZ,CAAA;AACD,IAAA,OAAO,QAAA,CAAS,GAAA;AAAA,EAClB;AAGA,EAAA,MAAM,cAAA,GAAiB,IAAA;AAEvB,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,OAAO,gBAAA,EAAkB;AAAA,IACnD,QAAA;AAAA,IACA,QAAA;AAAA,IACA,cAAA;AAAA;AAAA,IACA,eAAe,QAAA,CAAS,KAAA;AAAA,IACxB,WAAA;AAAA,IACA,SAAS,QAAA,CAAS,OAAA;AAAA,IAClB,WAAA,EAAa,UAAA;AAAA,IACb,OAAO,QAAA,CAAS,KAAA;AAAA,IAChB,QAAA,EAAU;AAAA,MACR,gBAAA,EAAkB,UAAA;AAAA,MAClB,cAAc,QAAA,CAAS;AAAA,KACzB;AAAA,IACA,UAAA,EAAY,cAAA;AAAA,IACZ,UAAA,EACE,QAAA,CAAS,UAAA,KAAe,QAAA,CAAS,iBAAiB,QAAA,GAAW,WAAA,CAAA;AAAA,IAC/D,kBAAA,EAAoB,YAAA;AAAA,IACpB,MAAA,EAAQ,QAAA;AAAA,IACR,SAAS,QAAA,CAAS,SAAA;AAAA,IAClB,WAAW,QAAA,CAAS,SAAA;AAAA,IACpB,SAAA,EAAW,GAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,OAAO,MAAA;AACT;AAKA,eAAe,sBAAA,CACb,GAAA,EACA,UAAA,EACA,SAAA,EACA,cAAA,EACsC;AAGtC,EAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,EAAA,CAAG,IAAI,UAAU,CAAA;AAC5C,EAAA,MAAM,kBAAA,GAAqB,kBAAkB,QAAA,EAAU,SAAA;AACvD,EAAA,MAAM,mBAAoB,QAAA,EAAkB,OAAA;AAE5C,EAAA,IAAI,aAAA;AACJ,EAAA,IAAI,gBAAA,EAAkB;AACpB,IAAA,aAAA,GAAgB,MAAM,GAAA,CAAI,EAAA,CACvB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,UAAA,EAAY,CAAC,CAAA,KAAW,EAAE,EAAA,CAAG,SAAA,EAAW,gBAAgB,CAAC,EACnE,OAAA,EAAQ;AAAA,EACb,CAAA,MAAO;AAEL,IAAA,aAAA,GAAgB,MAAM,GAAA,CAAI,EAAA,CACvB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,QAAQ,CAAC,EAC1D,OAAA,EAAQ;AAAA,EACb;AAEA,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA,KAAM;AACzC,IAAA,IAAI,kBAAA,IAAsB,CAAA,CAAE,SAAA,IAAa,CAAA,CAAE,cAAc,kBAAA,EAAoB;AAC3E,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,WAAW,CAAA,CAAE,QAAA;AACnB,IAAA,OAAO,UAAU,gBAAA,KAAqB,UAAA;AAAA,EACxC,CAAC,CAAA;AAED,EAAA,IAAI,QAAA,EAAU;AACZ,IAAA,OAAO,QAAA,CAAS,GAAA;AAAA,EAClB;AAGA,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,EAAA,MAAM,WAAW,gBAAA,EAAiB;AAGlC,EAAA,MAAM,YAAA,GACF,QAAA,CAAS,QAAA,EAAsC,IAAA,IAAmB,EAAA;AACtE,EAAA,MAAM,cAAA,GAAkB,SAAS,QAAA,EAC7B,cAAA;AAEJ,EAAA,IAAI,QAAA,GAA8B,QAAA;AAClC,EAAA,IACE,cAAA,IACA,aAAa,QAAA,CAAS,MAAM,KAC5B,YAAA,CAAa,QAAA,CAAS,UAAU,CAAA,EAChC;AACA,IAAA,QAAA,GAAW,WAAA;AAAA,EACb,CAAA,MAAA,IAAW,YAAA,CAAa,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC1C,IAAA,QAAA,GAAW,WAAA;AAAA,EACb;AAEA,EAAA,MAAM,QACF,QAAA,CAAS,QAAA,EAAsC,KAAA,IAC/C,QAAA,CAAS,UAAsC,KAAA,IACjD,UAAA;AAEF,EAAA,MAAM,WAAA,GAAc,mBAAA;AAAA,IAClB,QAAA;AAAA,IACA,SAAS,QAAA,CAAS,OAAA,EAAS,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,IAAK,EAAA;AAAA,GAC9C;AAGA,EAAA,MAAM,cAAA,GAAiB,QAAA,KAAa,WAAA,GAAc,IAAA,GAAO,IAAA;AAEzD,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,OAAO,gBAAA,EAAkB;AAAA,IACnD,QAAA;AAAA,IACA,QAAA;AAAA,IACA,cAAA;AAAA;AAAA,IACA,aAAA,EAAe,KAAA;AAAA,IACf,WAAA;AAAA,IACA,SAAS,QAAA,CAAS,OAAA;AAAA,IAClB,WAAA,EAAa,UAAA;AAAA,IACb,KAAA;AAAA,IACA,QAAA,EAAU;AAAA,MACR,gBAAA,EAAkB,UAAA;AAAA,MAClB,YAAA;AAAA,MACA,OAAO,QAAA,CAAS;AAAA,KAClB;AAAA,IACA,UAAA,EAAY,iBAAiB,cAAA,GAAiB,cAAA;AAAA,IAC9C,UAAA,EAAY,iBAAiB,QAAA,GAAW,WAAA;AAAA,IACxC,kBAAA,EAAoB,YAAA;AAAA,IACpB,MAAA,EAAQ,QAAA;AAAA,IACR,SAAS,QAAA,CAAS,SAAA;AAAA,IAClB,SAAA;AAAA,IACA,SAAA,EAAW,GAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACZ,CAAA;AAED,EAAA,OAAO,MAAA;AACT","file":"epistemicNodeCreation.js","sourcesContent":["/**\n * Shared UUID v4 generator for global IDs.\n *\n * Uses crypto.getRandomValues() for collision-safe generation.\n * Replaces the Math.random()-based UUID pattern that was duplicated\n * across 7+ files.\n *\n * @module convex/lib/globalId\n */\n\n/**\n * Generate a UUID v4 global ID using crypto-safe random bytes.\n */\nexport function generateGlobalId(): string {\n  const bytes = new Uint8Array(16);\n  crypto.getRandomValues(bytes);\n  // Set version (4) and variant (RFC 4122)\n  bytes[6] = (bytes[6] & 0x0f) | 0x40;\n  bytes[8] = (bytes[8] & 0x3f) | 0x80;\n  const hex = Array.from(bytes, (b) => b.toString(16).padStart(2, \"0\")).join(\n    \"\"\n  );\n  return `${hex.slice(0, 8)}-${hex.slice(8, 12)}-${hex.slice(12, 16)}-${hex.slice(16, 20)}-${hex.slice(20)}`;\n}\n","import {\n  actionGeneric,\n  anyApi,\n  componentsGeneric,\n  httpActionGeneric,\n  internalActionGeneric,\n  internalMutationGeneric,\n  internalQueryGeneric,\n  mutationGeneric,\n  queryGeneric,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nexport const api = anyApi as any;\nexport const components = componentsGeneric() as any;\nexport const internal = anyApi as any;\n\nexport type TableNames = string;\nexport type Id<TableName extends TableNames = string> = GenericId<TableName>;\nexport type Doc<TableName extends TableNames = string> = any;\nexport type DataModel = any;\ntype IndexRangeBuilder = {\n  field(fieldName: string): string;\n  eq(fieldName: string, value: unknown): IndexRangeBuilder;\n  gt(fieldName: string, value: unknown): IndexRangeBuilder;\n  gte(fieldName: string, value: unknown): IndexRangeBuilder;\n  lt(fieldName: string, value: unknown): IndexRangeBuilder;\n  lte(fieldName: string, value: unknown): IndexRangeBuilder;\n};\ntype FilterBuilder = {\n  eq(left: unknown, right: unknown): unknown;\n  neq(left: unknown, right: unknown): unknown;\n  gt(left: unknown, right: unknown): unknown;\n  gte(left: unknown, right: unknown): unknown;\n  lt(left: unknown, right: unknown): unknown;\n  lte(left: unknown, right: unknown): unknown;\n  and(...clauses: unknown[]): unknown;\n  or(...clauses: unknown[]): unknown;\n  field(fieldName: string): unknown;\n};\ntype QueryInitializer<TableName extends TableNames> = {\n  withIndex(\n    indexName: string,\n    range?: (q: any) => unknown\n  ): QueryInitializer<TableName>;\n  filter(predicate: (q: any) => unknown): QueryInitializer<TableName>;\n  order(direction: \"asc\" | \"desc\"): QueryInitializer<TableName>;\n  collect(): Promise<Doc<TableName>[]>;\n  take(limit: number): Promise<Doc<TableName>[]>;\n  first(): Promise<Doc<TableName> | null>;\n  unique(): Promise<Doc<TableName> | null>;\n};\nexport type DatabaseReader = {\n  get<TableName extends TableNames>(\n    id: Id<TableName>\n  ): Promise<Doc<TableName> | null>;\n  query<TableName extends TableNames>(\n    tableName: TableName\n  ): QueryInitializer<TableName>;\n  normalizeId?<TableName extends TableNames>(\n    tableName: TableName,\n    id: string\n  ): Id<TableName> | null;\n};\nexport type DatabaseWriter = DatabaseReader & {\n  insert<TableName extends TableNames>(\n    tableName: TableName,\n    value: Record<string, unknown>\n  ): Promise<Id<TableName>>;\n  patch<TableName extends TableNames>(\n    id: Id<TableName>,\n    value: Record<string, unknown>\n  ): Promise<void>;\n  replace<TableName extends TableNames>(\n    id: Id<TableName>,\n    value: Record<string, unknown>\n  ): Promise<void>;\n  delete<TableName extends TableNames>(id: Id<TableName>): Promise<void>;\n};\ntype Scheduler = {\n  runAfter(delayMs: number, functionReference: unknown, args?: unknown): Promise<void>;\n};\ntype AuthReader = {\n  getUserIdentity(): Promise<unknown>;\n};\ntype RuntimeInvoker = {\n  runQuery(functionReference: unknown, args?: unknown): Promise<any>;\n  runMutation(functionReference: unknown, args?: unknown): Promise<any>;\n  runAction(functionReference: unknown, args?: unknown): Promise<any>;\n};\nexport type QueryCtx = RuntimeInvoker & {\n  auth: AuthReader;\n  db: DatabaseReader;\n  scheduler: Scheduler;\n};\nexport type MutationCtx = RuntimeInvoker & {\n  auth: AuthReader;\n  db: DatabaseWriter;\n  scheduler: Scheduler;\n};\nexport type ActionCtx = RuntimeInvoker & {\n  auth: AuthReader;\n  scheduler: Scheduler;\n};\n\ntype ConvexFunctionBuilder<Ctx> = <\n  Definition extends { handler?: (ctx: Ctx, args: any) => any },\n>(\n  definition: Definition\n) => any;\n\nexport const action = actionGeneric as unknown as ConvexFunctionBuilder<ActionCtx>;\nexport const httpAction =\n  httpActionGeneric as unknown as ConvexFunctionBuilder<ActionCtx>;\nexport const internalAction =\n  internalActionGeneric as unknown as ConvexFunctionBuilder<ActionCtx>;\nexport const internalMutation =\n  internalMutationGeneric as unknown as ConvexFunctionBuilder<MutationCtx>;\nexport const internalQuery =\n  internalQueryGeneric as unknown as ConvexFunctionBuilder<QueryCtx>;\nexport const mutation =\n  mutationGeneric as unknown as ConvexFunctionBuilder<MutationCtx>;\nexport const query = queryGeneric as unknown as ConvexFunctionBuilder<QueryCtx>;\n","/**\n * Epistemic Spine helper module split from epistemicHelpers.ts.\n */\n\nimport type { Id } from \"./convex\";\n\n// =============================================================================\n// TYPE MAPPINGS\n// =============================================================================\n\ntype EpistemicNodeType =\n  // L4: Audit targets\n  | \"decision\"\n  // L3: Traversal anchors\n  | \"belief\"\n  | \"question\"\n  | \"theme\"\n  | \"deal\"\n  // L2: Compression boundary\n  | \"claim\"\n  | \"evidence\"\n  | \"synthesis\"\n  | \"answer\"\n  // L1: Terminal leaves\n  | \"atomic_fact\"\n  | \"excerpt\"\n  | \"source\";\n\ntype OntologicalNodeType =\n  | \"company\"\n  | \"person\"\n  | \"investor\"\n  | \"function\"\n  | \"value_chain\";\n\ntype NodeType = EpistemicNodeType | OntologicalNodeType;\n\n// =============================================================================\n// EPISTEMIC LAYER ARCHITECTURE (Lucern Invariant Compliance)\n// =============================================================================\n\n/**\n * Epistemic Layer - governs traversal rules\n * L4 → L3 → L2 → L1 (never skip layers)\n */\nexport type EpistemicLayer =\n  | \"L4\"\n  | \"L3\"\n  | \"L2\"\n  | \"L1\"\n  | \"ontological\"\n  | \"organizational\";\n\n/**\n * Map nodeType to its epistemic layer\n *\n * Layer semantics:\n * - L4: Audit targets (decisions, outcomes) - what we committed to\n * - L3: Traversal anchors (beliefs, questions, themes) - epistemic structure\n * - L2: Compression boundary (claims, evidence, synthesis) - minimum reasoning unit\n * - L1: Terminal leaves (atomic_fact, excerpt, source) - non-traversable grounding\n * - ontological: Entities in the world (companies, people) - not epistemic\n * - organizational: Structural containers (topics, lenses, worktrees) - not epistemic\n */\nexport function getNodeLayer(nodeType: string): EpistemicLayer {\n  switch (nodeType) {\n    // L4: Audit targets\n    case \"decision\":\n      return \"L4\";\n\n    // L3: Traversal anchors\n    case \"belief\":\n    case \"question\":\n    case \"theme\":\n    case \"deal\":\n      return \"L3\";\n\n    // L2: Compression boundary\n    case \"claim\":\n    case \"evidence\":\n    case \"synthesis\":\n    case \"answer\":\n      return \"L2\";\n\n    // L1: Terminal leaves\n    case \"atomic_fact\":\n    case \"excerpt\":\n    case \"source\":\n      return \"L1\";\n\n    // Ontological entities\n    case \"company\":\n    case \"person\":\n    case \"investor\":\n    case \"function\":\n    case \"value_chain\":\n      return \"ontological\";\n\n    // Organizational containers\n    case \"topic\":\n      return \"organizational\";\n\n    default:\n      // Unknown types default to L2 (safest for traversal)\n      console.warn(\n        `[EpistemicLayer] Unknown nodeType: ${nodeType}, defaulting to L2`\n      );\n      return \"L2\";\n  }\n}\n\n/**\n * Layer traversal rules\n * Key constraint: Cannot skip layers during traversal\n */\nexport const LAYER_TRAVERSAL_RULES = {\n  L4: {\n    canReach: [\"L3\", \"L4\"], // Decisions can reach beliefs/questions\n    mustPassThrough: \"L3\", // Must go through L3 to reach L2\n  },\n  L3: {\n    canReach: [\"L2\", \"L3\", \"L4\"], // Beliefs can reach evidence, other beliefs, or decisions\n    mustPassThrough: \"L2\", // Must go through L2 to reach L1\n  },\n  L2: {\n    canReach: [\"L1\", \"L2\", \"L3\"], // Evidence can reach sources, other evidence, or beliefs\n    mustPassThrough: null, // L2 can reach L1 directly\n  },\n  L1: {\n    canReach: [\"L1\"], // Sources can only reach other sources\n    mustPassThrough: null, // Terminal - no traversal beyond\n  },\n  ontological: {\n    canReach: [\"L3\", \"L2\", \"ontological\"], // Entities can link to epistemic structure\n    mustPassThrough: null, // No layer constraints for entities\n  },\n  organizational: {\n    canReach: [\"L3\", \"L2\", \"organizational\"], // Containers scope epistemic structure + nest\n    mustPassThrough: null, // No layer constraints for containers\n  },\n} as const;\n\n/**\n * Check if a direct edge between two layers is allowed\n */\nexport function isValidLayerConnection(\n  fromLayer: EpistemicLayer,\n  toLayer: EpistemicLayer\n): boolean {\n  const rules = LAYER_TRAVERSAL_RULES[fromLayer];\n  return (rules.canReach as readonly string[]).includes(toLayer);\n}\n\n/**\n * Get layer hierarchy number (for comparison)\n * Higher number = higher layer\n */\nexport function getLayerDepth(layer: EpistemicLayer): number {\n  switch (layer) {\n    case \"L4\":\n      return 4;\n    case \"L3\":\n      return 3;\n    case \"L2\":\n      return 2;\n    case \"L1\":\n      return 1;\n    case \"ontological\":\n      return 0; // Ontological exists outside the epistemic hierarchy\n    case \"organizational\":\n      return 0; // Organizational exists outside the epistemic hierarchy\n    default:\n      return 2;\n  }\n}\n\n/**\n * Check if we can traverse from one layer to another\n * (considering intermediate layers)\n */\nexport function canTraverseToLayer(\n  fromLayer: EpistemicLayer,\n  toLayer: EpistemicLayer\n): boolean {\n  const fromDepth = getLayerDepth(fromLayer);\n  const toDepth = getLayerDepth(toLayer);\n\n  // Ontological/organizational layers are special - use explicit rules\n  if (\n    fromLayer === \"ontological\" ||\n    toLayer === \"ontological\" ||\n    fromLayer === \"organizational\" ||\n    toLayer === \"organizational\"\n  ) {\n    return isValidLayerConnection(fromLayer, toLayer);\n  }\n\n  // Can always stay at same layer\n  if (fromDepth === toDepth) {\n    return true;\n  }\n\n  // Can go up (L1→L2→L3→L4) or down (L4→L3→L2→L1)\n  // But must respect layer rules\n  return isValidLayerConnection(fromLayer, toLayer);\n}\n\n// =============================================================================\n// PHASE 2D: LAYER-AWARE TRAVERSAL\n// =============================================================================\n\n/**\n * Traversal mode - determines how to traverse the graph\n *\n * anchor_down: Start at L3 belief, traverse to L2 evidence, stop at L1 sources\n * anchor_up: Start at L2 evidence, traverse to L3 beliefs it supports\n * same_layer: Traverse within a single layer (e.g., belief → belief)\n * decision_trace: Start at L4 decision, traverse to L3 beliefs it was based on\n */\nexport type TraversalMode =\n  | \"anchor_down\"\n  | \"anchor_up\"\n  | \"same_layer\"\n  | \"decision_trace\";\n\n/**\n * Traversal options for layer-aware queries\n */\nexport type TraversalOptions = {\n  /** Starting node ID */\n  startNodeId: Id<\"epistemicNodes\">;\n  /** Traversal mode */\n  mode: TraversalMode;\n  /** Edge types to follow (empty = all valid for mode) */\n  allowedEdgeTypes?: string[];\n  /** Maximum depth */\n  maxDepth?: number;\n  /** Minimum layer to stop at (L1 = 1, L4 = 4) */\n  minLayer?: number;\n  /** Maximum layer to reach */\n  maxLayer?: number;\n};\n\n/**\n * Check if traversal should continue based on layer constraints\n */\nexport function shouldContinueTraversal(\n  currentLayer: EpistemicLayer,\n  targetLayer: EpistemicLayer,\n  options: {\n    mode: TraversalMode;\n    minLayer?: number;\n    maxLayer?: number;\n  }\n): boolean {\n  const currentDepth = getLayerDepth(currentLayer);\n  const targetDepth = getLayerDepth(targetLayer);\n\n  // Check min/max layer constraints\n  if (options.minLayer !== undefined && targetDepth < options.minLayer) {\n    return false; // Would go below minimum layer\n  }\n  if (options.maxLayer !== undefined && targetDepth > options.maxLayer) {\n    return false; // Would go above maximum layer\n  }\n\n  // Mode-specific rules\n  switch (options.mode) {\n    case \"anchor_down\":\n      // Can only go down (L4→L3→L2→L1)\n      return targetDepth < currentDepth || targetDepth === currentDepth;\n\n    case \"anchor_up\":\n      // Can only go up (L1→L2→L3→L4)\n      return targetDepth > currentDepth || targetDepth === currentDepth;\n\n    case \"same_layer\":\n      // Must stay at same layer\n      return targetDepth === currentDepth;\n\n    case \"decision_trace\":\n      // Decisions (L4) can trace to beliefs (L3), stop there\n      return currentDepth === 4\n        ? targetDepth === 3\n        : targetDepth === currentDepth;\n\n    default:\n      return true;\n  }\n}\n\n/**\n * Get default minLayer for a traversal mode\n */\nexport function getDefaultMinLayer(mode: TraversalMode): number {\n  switch (mode) {\n    case \"anchor_down\":\n      return 1; // Can go all the way to L1 sources\n    case \"anchor_up\":\n      return 2; // Start at L2 evidence minimum\n    case \"same_layer\":\n      return 1; // No constraint\n    case \"decision_trace\":\n      return 3; // Stop at L3 beliefs (don't go to L2 evidence)\n    default:\n      return 1;\n  }\n}\n\n/**\n * Get allowed edge types for a traversal mode\n */\nexport function getDefaultEdgeTypesForMode(mode: TraversalMode): string[] {\n  switch (mode) {\n    case \"anchor_down\":\n      // From beliefs/questions down to evidence and sources\n      return [\n        \"informs\", // evidence → belief (traverse backwards)\n        \"derived_from\", // evidence → source (provenance) + evidence → question\n      ];\n    case \"anchor_up\":\n      // From evidence up to beliefs\n      return [\"informs\", \"derived_from\"];\n    case \"same_layer\":\n      // Within-layer relationships\n      return [\n        // L3: Belief ↔ Belief\n        \"depends_on\",\n        \"supports\",\n        \"contains\",\n        // L3: Question ↔ Question\n        \"prerequisite_for\",\n        \"parallel_to\",\n        // L2: Evidence ↔ Evidence\n        \"corroborates\",\n        \"extends\",\n        \"same_source_as\",\n        \"same_theme_as\",\n      ];\n    case \"decision_trace\":\n      // From decisions to beliefs\n      return [\n        \"derived_from\",\n        \"depends_on\",\n        \"contains\",\n      ];\n    default:\n      return [];\n  }\n}\n\n// =============================================================================\n// PHASE 2C: EDGE LAYER RULES\n// =============================================================================\n\n/**\n * Edge Layer Rules - defines valid layer combinations for each edge type\n *\n * Format: { from: [allowed source layers], to: [allowed target layers] }\n *\n * Key rules:\n * - L4 edges: Decision → L3 (beliefs, questions, themes)\n * - Cross-layer edges: L2 → L3 (evidence informs beliefs)\n * - Same-layer edges: L3 → L3, L2 → L2 (beliefs depend on beliefs)\n * - Downward edges: L2 → L1 (evidence extracted from source)\n * - Lifecycle edges: same layer only (supersedes)\n */\nexport const EDGE_LAYER_RULES: Record<\n  string,\n  { from: EpistemicLayer[]; to: EpistemicLayer[]; description: string }\n> = {\n  // === L4 Decision Edges ===\n  based_on_belief: {\n    from: [\"L4\"],\n    to: [\"L3\"],\n    description: \"Decision → Belief (L4 → L3)\",\n  },\n  based_on_question: {\n    from: [\"L4\"],\n    to: [\"L3\"],\n    description: \"Decision → Question (L4 → L3)\",\n  },\n  blocked_by_contradiction: {\n    from: [\"L4\"],\n    to: [\"L3\"],\n    description: \"Decision → Contradiction (L4 → L3)\",\n  },\n  informed_by_theme: {\n    from: [\"L4\"],\n    to: [\"L3\"],\n    description: \"Decision → Theme (L4 → L3)\",\n  },\n\n  // === Evidence Flow (L2 → L3, L2 → L1) ===\n  derived_from: {\n    from: [\"L2\", \"L3\", \"L4\"],\n    to: [\"L1\", \"L2\", \"L3\"],\n    description: \"A was produced from B (provenance chain)\",\n  },\n  answers: {\n    from: [\"L2\"],\n    to: [\"L3\"],\n    description: \"Evidence → Question (L2 → L3)\",\n  },\n  responds_to: {\n    from: [\"L2\"],\n    to: [\"L3\"],\n    description: \"Answer → Question (L2 → L3)\",\n  },\n  informs: {\n    from: [\"L2\"],\n    to: [\"L3\"],\n    description: \"Evidence → Belief (L2 → L3)\",\n  },\n  qualifies: {\n    from: [\"L2\"],\n    to: [\"L3\"],\n    description: \"Evidence → Belief (L2 → L3)\",\n  },\n\n  // === Question → Belief (L3 → L3) ===\n  tests: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Question → Belief (L3 → L3)\",\n  },\n  explores: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Question → Belief assumption (L3 → L3)\",\n  },\n\n  // === Synthesis (L2 → L2, L2 → L1) ===\n  based_on: {\n    from: [\"L2\"],\n    to: [\"L2\", \"L1\"],\n    description: \"Synthesis → Evidence/Source (L2 → L2/L1)\",\n  },\n\n  // === Theme Relationships (L3 → L3) ===\n  relates_to_thesis: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Belief → Theme (L3 → L3)\",\n  },\n  belongs_to: {\n    from: [\"L3\", \"L2\"], // Can belong to theme from L3 or L2\n    to: [\"L3\"],\n    description: \"Any → Theme (L3/L2 → L3)\",\n  },\n  plays_theme: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Deal → Theme (L3 → L3)\",\n  },\n\n  // === Topic Hierarchy (L3 → organizational) ===\n  scoped_by: {\n    from: [\"L3\"],\n    to: [\"organizational\"],\n    description: \"Belief/Question → Topic (L3 → organizational)\",\n  },\n\n  // === Deal/Company ===\n  evaluates: {\n    from: [\"L3\"],\n    to: [\"ontological\"],\n    description: \"Deal → Company (L3 → ontological)\",\n  },\n\n  // === People (ontological → ontological, ontological → L3) ===\n  perspective_on: {\n    from: [\"ontological\"],\n    to: [\"L3\"],\n    description: \"Person → Belief/Theme (ontological → L3)\",\n  },\n  works_at: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Person → Company (ontological → ontological)\",\n  },\n\n  // === Value Chain (ontological) ===\n  participates_in: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Company → ValueChain (ontological → ontological)\",\n  },\n  performs: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Company → Function (ontological → ontological)\",\n  },\n  function_in: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Function → ValueChain (ontological → ontological)\",\n  },\n  impacts: {\n    from: [\"L3\"],\n    to: [\"ontological\"],\n    description: \"Theme → ValueChain (L3 → ontological)\",\n  },\n\n  // === Investment (ontological) ===\n  invested_in: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Investor → Company (ontological → ontological)\",\n  },\n  raised_from: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Company → Investor (ontological → ontological)\",\n  },\n\n  // === Entity↔Belief Bridge (OE-B) ===\n  about_entity: {\n    from: [\"L3\"],\n    to: [\"ontological\"],\n    description: \"Belief/Question/Theme → Entity (L3 → ontological)\",\n  },\n  entity_referenced_in: {\n    from: [\"ontological\"],\n    to: [\"L2\"],\n    description: \"Entity → Evidence (ontological → L2)\",\n  },\n  mentioned_in: {\n    from: [\"ontological\"],\n    to: [\"L1\"],\n    description: \"Entity → Source document (ontological → L1)\",\n  },\n  founded_by: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Company → Person (ontological → ontological)\",\n  },\n  competes_with: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"Company → Company (ontological → ontological)\",\n  },\n  contains: {\n    from: [\"ontological\"],\n    to: [\"ontological\"],\n    description: \"ValueChain → Function (ontological → ontological)\",\n  },\n\n  // === Lifecycle (same layer only) ===\n  supersedes: {\n    from: [\"L4\", \"L3\", \"L2\", \"L1\", \"ontological\", \"organizational\"],\n    to: [\"L4\", \"L3\", \"L2\", \"L1\", \"ontological\", \"organizational\"],\n    description: \"NewNode → OldNode (same layer only - validated separately)\",\n  },\n  same_as: {\n    from: [\"L4\", \"L3\", \"L2\", \"L1\", \"ontological\", \"organizational\"],\n    to: [\"L4\", \"L3\", \"L2\", \"L1\", \"ontological\", \"organizational\"],\n    description: \"Duplicate detection (same layer only - validated separately)\",\n  },\n\n  // === Same-Type: Belief ↔ Belief (L3 → L3) ===\n  depends_on: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Belief B requires Belief A (L3 → L3)\",\n  },\n  reinforces: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Beliefs strengthen each other (L3 → L3)\",\n  },\n  parent_of: {\n    from: [\"L3\", \"organizational\"],\n    to: [\"L3\", \"organizational\"],\n    description:\n      \"A is higher-level than B (L3 → L3, organizational → organizational)\",\n  },\n  child_of: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Belief A is more specific (L3 → L3)\",\n  },\n\n  // === Same-Type: Question ↔ Question (L3 → L3) ===\n  prerequisite_for: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Question A must be answered first (L3 → L3)\",\n  },\n  parallel_to: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Same topic, different angles (L3 → L3)\",\n  },\n\n  // === Same-Type: Evidence ↔ Evidence (L2 → L2) ===\n  corroborates: {\n    from: [\"L2\"],\n    to: [\"L2\"],\n    description: \"Independent support (L2 → L2)\",\n  },\n  extends: {\n    from: [\"L2\"],\n    to: [\"L2\"],\n    description: \"Adds depth (L2 → L2)\",\n  },\n  same_source_as: {\n    from: [\"L2\"],\n    to: [\"L2\"],\n    description: \"Same document/study (L2 → L2)\",\n  },\n  same_theme_as: {\n    from: [\"L2\"],\n    to: [\"L2\"],\n    description: \"Same topic/entity (L2 → L2)\",\n  },\n\n  // === NEW: Deep Epistemic Analysis Edges (Phase: Schema Upgrade) ===\n  assumes: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description:\n      \"Hidden dependency - Belief B implicitly assumes Belief A (L3 → L3)\",\n  },\n  would_predict: {\n    from: [\"L3\"],\n    to: [\"L2\"],\n    description:\n      \"Pre-registered prediction - If Belief true, expect Evidence (L3 → L2)\",\n  },\n  analogous_to: {\n    from: [\"L3\"],\n    to: [\"L3\"],\n    description: \"Explicit analogy - Belief A is like Belief B (L3 → L3)\",\n  },\n  independent_of: {\n    from: [\"L2\"],\n    to: [\"L2\"],\n    description:\n      \"True evidence independence - Evidence A independent of B (L2 → L2)\",\n  },\n\n  // NOTE: Deprecated edge types (supports, contradicts, derived_from, cites,\n  // summarizes, related_to, partially_answers, blocks, refines, branches_from)\n  // have been REMOVED from the system. Use compliant alternatives instead.\n};\n\n/**\n * Validate an edge against layer rules\n *\n * Returns { valid: true } or { valid: false, reason: string }\n */\nexport function validateEdgeLayers(\n  edgeType: string,\n  fromLayer: EpistemicLayer,\n  toLayer: EpistemicLayer\n): { valid: boolean; reason?: string } {\n  const rules = EDGE_LAYER_RULES[edgeType];\n\n  // Unknown edge type - allow but warn\n  if (!rules) {\n    console.warn(\n      `[EdgeValidation] Unknown edge type: ${edgeType}, allowing by default`\n    );\n    return { valid: true };\n  }\n\n  // Special handling for same-layer edges (supersedes)\n  if (edgeType === \"supersedes\") {\n    if (fromLayer !== toLayer) {\n      return {\n        valid: false,\n        reason: `${edgeType} edges must be between nodes of the same layer. Got ${fromLayer} → ${toLayer}`,\n      };\n    }\n    return { valid: true };\n  }\n\n  // Check from layer\n  if (!rules.from.includes(fromLayer)) {\n    return {\n      valid: false,\n      reason: `Edge type '${edgeType}' does not allow source layer ${fromLayer}. Allowed: ${rules.from.join(\", \")}`,\n    };\n  }\n\n  // Check to layer\n  if (!rules.to.includes(toLayer)) {\n    return {\n      valid: false,\n      reason: `Edge type '${edgeType}' does not allow target layer ${toLayer}. Allowed: ${rules.to.join(\", \")}`,\n    };\n  }\n\n  return { valid: true };\n}\n\n","/**\n * Epistemic Spine helper module split from epistemicHelpers.ts.\n */\n\nimport { internal } from \"./convex\";\nimport type { Id, MutationCtx } from \"./convex\";\nimport { generateGlobalId } from \"./globalId\";\nimport { getNodeLayer, validateEdgeLayers } from \"./epistemicLayerRules\";\n\ntype NodeTypeIndexQuery = {\n  eq(field: string, value: unknown): NodeTypeIndexQuery;\n};\n\n/**\n * Edge type union for createEpistemicEdge\n * Phase 2C: Updated to include L4 edges and modern edge types\n * Phase 3: Added full epistemic impact edges for confidence propagation\n */\ntype EpistemicEdgeType =\n  // Canonical edge types (K-tier compliant)\n  | \"derived_from\" // replaces: answers, extracted_from, based_on, same_as, based_on_belief, based_on_question\n  | \"supports\" // replaces: reinforces, strengthened_by, validated_by, weakened_by, alternative_to, falsified_by, exclusive_with (with appropriate weight)\n  | \"contains\" // replaces: parent_of, child_of, about_entity, entity_referenced_in, subsumes, informed_by_theme\n  | \"depends_on\" // replaces: collapses_if, cascade_from, required_for, blocks, blocked_by_contradiction\n  | \"informs\"\n  | \"tests\" // replaces: explores\n  | \"responds_to\"\n  // Theme relationships\n  | \"relates_to_thesis\"\n  | \"belongs_to\"\n  | \"plays_theme\"\n  // Lifecycle\n  | \"supersedes\"\n  // Same-type: Belief - Cluster Mapping (Thesis Validation Sprints)\n  | \"counterfactual_of\"\n  | \"cascade_to\"\n  | \"mutually_exclusive\"\n  | \"correlates_with\"\n  | \"amplifies\"\n  | \"precondition_for\"\n  | \"in_tension_with\"\n  // Same-type: Belief - Deep Epistemic Analysis (Tier 2)\n  | \"assumes\"\n  | \"would_predict\"\n  | \"analogous_to\"\n  | \"independent_of\"\n  // Same-type: Question\n  | \"prerequisite_for\"\n  | \"parallel_to\"\n  // Same-type: Evidence\n  | \"corroborates\"\n  | \"extends\"\n  | \"same_source_as\"\n  | \"same_theme_as\"\n  // Ontological\n  | \"evaluates\"\n  | \"perspective_on\"\n  | \"works_at\"\n  | \"participates_in\"\n  | \"performs\"\n  | \"function_in\"\n  | \"impacts\"\n  | \"invested_in\"\n  | \"raised_from\"\n  // People/Entity References\n  | \"mentioned_in\"\n  | \"founded_by\"\n  | \"competes_with\";\n\n// NOTE: Deprecated edge types have been REMOVED from this type.\n// See schema.ts for the list of removed types and their compliant alternatives.\n\n// =============================================================================\n// CONFIDENCE NORMALIZATION\n// =============================================================================\n\n/**\n * Normalize confidence to a 0-1 number regardless of input format.\n *\n * Handles:\n * - number (0-1): returned as-is\n * - number (1-100): divided by 100\n * - string (\"high\"/\"medium\"/\"low\"): mapped to 0.8/0.5/0.3\n * - undefined/null/other: returns 0.5 default\n *\n * This is the canonical way to read confidence from any source.\n */\nexport function normalizeConfidence(confidence: unknown): number {\n  if (typeof confidence === \"number\") {\n    return confidence > 1 ? confidence / 100 : confidence;\n  }\n  if (typeof confidence === \"string\") {\n    switch (confidence) {\n      case \"high\":\n        return 0.8;\n      case \"medium\":\n        return 0.5;\n      case \"low\":\n        return 0.3;\n      default:\n        return 0.5;\n    }\n  }\n  return 0.5;\n}\n\n/**\n * Epistemic Edge Propagation Semantics\n *\n * Each edge type has specific propagation rules for confidence cascades:\n *\n * | Edge Type         | Direction    | Propagation Rule                                          |\n * |-------------------|--------------|-----------------------------------------------------------|\n * | depends_on        | B → A        | A.conf = min(A.conf, B.conf + 0.2)                       |\n * | reinforces        | A ↔ B        | Both get boost when either validated                      |\n * | falsified_by      | B → A        | A.conf = 1 - B.conf (inverse)                            |\n * | exclusive_with    | A ↔ B        | A.conf + B.conf ≤ 1.0 (redistribute on evidence)         |\n * | contradicts       | A ↔ B        | Creates tension - neither can be validated without fork   |\n * | collapses_if      | A → B        | If A.conf < threshold, B.conf → 0                        |\n * | cascade_from      | A → B        | B.conf_delta = A.conf_delta * damping_factor             |\n * | strengthened_by   | A → B        | B.conf += A.conf_delta * correlation                     |\n * | weakened_by       | A → B        | B.conf -= A.conf_delta * correlation                     |\n * | alternative_to    | A ↔ B        | Evidence for A reduces B, and vice versa                 |\n * | subsumes          | A → B        | A.conf >= B.conf always                                  |\n * | validated_by      | A → B        | If A validated, B gains confidence                       |\n * | required_for      | A → B        | B cannot be validated until A is validated               |\n * | blocks            | A → B        | B resolution blocked until A resolved                    |\n */\n\n/**\n * Create an epistemic edge between two nodes\n *\n * Phase 1 (Graph Architecture): Writes to Neo4j directly - Neo4j is source of truth.\n * Returns globalId (string) instead of Convex edge ID.\n *\n * Phase 2C: Validates layer rules before creation\n */\nexport async function createEpistemicEdge(\n  ctx: MutationCtx,\n  params: {\n    fromNodeId: Id<\"epistemicNodes\">;\n    toNodeId: Id<\"epistemicNodes\">;\n    edgeType: EpistemicEdgeType;\n    weight?: number;\n    confidence?: number;\n    context?: string;\n    // NOTE: 'relation' field has been removed. Use 'weight' instead.\n    projectId?: string;\n    createdBy: string;\n    // Phase 2C: Allow skipping validation for migrations\n    skipLayerValidation?: boolean;\n  }\n): Promise<string> {\n  const globalId = generateGlobalId();\n\n  // Get node types for denormalization\n  const fromNode = await ctx.db.get(params.fromNodeId);\n  const toNode = await ctx.db.get(params.toNodeId);\n\n  if (!fromNode || !toNode) {\n    throw new Error(\"One or both nodes not found\");\n  }\n\n  // Phase 2C: Get layers (use stored or derive from nodeType)\n  const fromLayer = fromNode.epistemicLayer || getNodeLayer(fromNode.nodeType);\n  const toLayer = toNode.epistemicLayer || getNodeLayer(toNode.nodeType);\n\n  // Phase 2C: Validate layer rules\n  if (!params.skipLayerValidation) {\n    const validation = validateEdgeLayers(params.edgeType, fromLayer, toLayer);\n    if (!validation.valid) {\n      throw new Error(\n        `[EdgeValidation] Invalid edge: ${validation.reason}. ` +\n          `Attempted: ${params.edgeType} from ${fromNode.nodeType}(${fromLayer}) → ${toNode.nodeType}(${toLayer})`\n      );\n    }\n  }\n\n  // Phase 1 (Graph Architecture): Write to Neo4j directly - Neo4j is source of truth\n  await ctx.scheduler.runAfter(0, internal.neo4jEdgeAPI.createEdge, {\n    globalId,\n    fromGlobalId: fromNode.globalId,\n    toGlobalId: toNode.globalId,\n    edgeType: params.edgeType,\n    weight: params.weight,\n    confidence: params.confidence,\n    context: params.context,\n    createdBy: params.createdBy,\n    topicId: params.projectId ? String(params.projectId) : undefined,\n    fromNodeType: fromNode.nodeType,\n    toNodeType: toNode.nodeType,\n    fromLayer,\n    toLayer,\n  });\n\n  return globalId;\n}\n\n/**\n * Create an edge when linking an insight to a question\n * This creates a \"derived_from\" edge (evidence answers/informs question)\n */\nexport async function createEdgeForInsightQuestionLink(\n  ctx: MutationCtx,\n  questionId: Id<\"epistemicNodes\">,\n  insightId: Id<\"epistemicNodes\">,\n  createdBy: string\n): Promise<string | null> {\n  console.log(\"[EpistemicSpine] Creating edge for insight-question link:\", {\n    questionId: String(questionId),\n    insightId: String(insightId),\n  });\n\n  // Find the epistemic nodes for both entities\n  const questionNode = await findNodeByLegacyId(ctx, \"question\", questionId);\n  const insightNode = await findNodeByLegacyId(ctx, \"insight\", insightId);\n\n  console.log(\"[EpistemicSpine] Found nodes:\", {\n    questionNode: questionNode ? String(questionNode) : null,\n    insightNode: insightNode ? String(insightNode) : null,\n  });\n\n  if (!questionNode || !insightNode) {\n    // Nodes don't exist yet - this can happen for legacy data\n    // They'll be created during backfill\n    console.log(\"[EpistemicSpine] Missing nodes, skipping edge creation\");\n    return null;\n  }\n\n  // Get the question for projectId\n  const question = await ctx.db.get(questionId);\n  const projectId = question?.projectId;\n\n  // Create the edge: Evidence -> Question\n  // Use \"derived_from\" - canonical replacement for \"answers\" edge type\n  return await createEpistemicEdge(ctx, {\n    fromNodeId: insightNode,\n    toNodeId: questionNode,\n    edgeType: \"derived_from\",\n    projectId,\n    createdBy,\n    context: \"Linked from questions workspace\",\n  });\n}\n\n/**\n * Find an epistemic node by its legacy ID (stored in metadata)\n */\nasync function findNodeByLegacyId(\n  ctx: MutationCtx,\n  legacyType: \"insight\" | \"belief\" | \"question\" | \"artifact\",\n  legacyId: Id<\"epistemicNodes\"> | Id<\"finalArtifacts\">\n): Promise<Id<\"epistemicNodes\"> | null> {\n  // Query all nodes and find the one with matching legacy ID\n  // This is not ideal for performance, but works for now\n  // TODO: Add a dedicated index for legacy IDs\n  const nodeType =\n    legacyType === \"insight\"\n      ? \"evidence\"\n      : legacyType === \"artifact\"\n        ? \"source\"\n        : legacyType;\n\n  const nodes = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_nodeType\", (q: NodeTypeIndexQuery) =>\n      q.eq(\"nodeType\", nodeType),\n    )\n    .collect();\n\n  const legacyKey = `legacy${legacyType.charAt(0).toUpperCase() + legacyType.slice(1)}Id`;\n\n  // Convert legacyId to string for comparison (Convex Id objects need string comparison)\n  const legacyIdStr = String(legacyId);\n\n  const found = nodes.find((n) => {\n    const metadata = n.metadata as Record<string, unknown> | undefined;\n    const storedId = metadata?.[legacyKey];\n    // Compare as strings to handle Convex Id serialization\n    return storedId && String(storedId) === legacyIdStr;\n  });\n\n  if (!found) {\n    console.log(\n      `[EpistemicSpine] Node not found for ${legacyType}:${legacyIdStr}, searched ${nodes.length} ${nodeType} nodes`\n    );\n  }\n\n  return found?._id ?? null;\n}\n","/**\n * Epistemic Spine helper module split from epistemicHelpers.ts.\n */\n\nimport type { Id, MutationCtx } from \"./convex\";\nimport { generateGlobalId } from \"./globalId\";\nimport { createEpistemicEdge } from \"./epistemicEdgeCreation\";\n\n// =============================================================================\n// CONTENT HASHING (Convex-compatible sync version)\n// =============================================================================\n\n/**\n * Generate a simple content hash for deduplication\n * Uses a basic hash since crypto.subtle isn't available in Convex runtime\n */\nfunction generateContentHash(nodeType: string, text: string): string {\n  const content = `${nodeType}:${normalizeText(text)}`;\n\n  // Simple hash function (djb2)\n  let hash = 5381;\n  for (let i = 0; i < content.length; i++) {\n    hash = (hash << 5) + hash + content.charCodeAt(i);\n    hash &= hash; // Convert to 32-bit integer\n  }\n\n  // Convert to hex string and pad to consistent length\n  const hashHex = Math.abs(hash).toString(16).padStart(8, \"0\");\n  // Add length and checksum for better uniqueness\n  const lengthHex = content.length.toString(16).padStart(4, \"0\");\n  const checksum = content\n    .split(\"\")\n    .reduce((a, c) => a + c.charCodeAt(0), 0)\n    .toString(16)\n    .padStart(8, \"0\");\n\n  return `${hashHex}${lengthHex}${checksum}`;\n}\n\n/**\n * Normalize text for consistent hashing\n */\nfunction normalizeText(text: string): string {\n  return text.trim().toLowerCase().replace(/\\s+/g, \" \");\n}\n\ntype EpistemicNodeType =\n  | \"claim\"\n  | \"evidence\"\n  | \"synthesis\"\n  | \"answer\"\n  | \"atomic_fact\"\n  | \"excerpt\"\n  | \"source\";\n\ntype EpistemicSourceType =\n  | \"human\"\n  | \"ai_extracted\"\n  | \"ai_generated\"\n  | \"imported\";\ntype EpistemicVerificationStatus =\n  | \"unverified\"\n  | \"human_verified\"\n  | \"ai_verified\"\n  | \"contradicted\"\n  | \"outdated\";\n\n/**\n * Map legacy insight sourceType to epistemic sourceType\n */\nfunction mapInsightSourceType(sourceType?: string): EpistemicSourceType {\n  switch (sourceType) {\n    case \"verified\":\n    case \"proprietary\":\n      return \"human\";\n    case \"ai_generated\":\n      return \"ai_generated\";\n    default:\n      return \"human\";\n  }\n}\n\n/**\n * Map legacy verification status to epistemic verification status\n */\nfunction mapVerificationStatus(status?: string): EpistemicVerificationStatus {\n  switch (status) {\n    case \"manually_verified\":\n      return \"human_verified\";\n    case \"deep_verified\":\n    case \"pre_screened\":\n      return \"ai_verified\";\n    default:\n      return \"unverified\";\n  }\n}\n\n// =============================================================================\n// DUAL-WRITE FUNCTIONS\n// =============================================================================\n\n/**\n * Create an epistemic node for an insight (evidence)\n * Called after inserting into the insights table\n */\nexport async function createEpistemicNodeForInsight(\n  ctx: MutationCtx,\n  _insightId: Id<\"epistemicNodes\">,\n  insight: {\n    projectId: string;\n    text: string;\n    kind: string;\n    tags?: string[];\n    sourceType?: string;\n    aiProvider?: string;\n    verificationStatus?: string;\n    sourceArtifactId?: Id<\"finalArtifacts\">;\n    sourceQuestionId?: Id<\"epistemicNodes\">; // If this evidence was created to answer a question\n    sourceAnchor?: {\n      artifactId: string;\n      artifactType: string;\n      artifactTitle?: string;\n      sectionHeading?: string;\n      selectedText?: string;\n      startOffset?: number;\n      endOffset?: number;\n      pageNumber?: number;\n    };\n    createdBy: string;\n  }\n): Promise<Id<\"epistemicNodes\">> {\n  const now = Date.now();\n  const globalId = generateGlobalId();\n  const contentHash = generateContentHash(\"evidence\", insight.text);\n\n  // Check for duplicate\n  const existing = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_contentHash\", (q) => q.eq(\"contentHash\", contentHash))\n    .first();\n\n  if (existing && existing.status === \"active\") {\n    await ctx.db.patch(existing._id, {\n      updatedAt: now,\n    });\n    return existing._id;\n  }\n\n  const nodeId = await ctx.db.insert(\"epistemicNodes\", {\n    globalId,\n    nodeType: \"evidence\",\n    epistemicLayer: \"L2\", // Evidence is at L2 (compression boundary)\n    canonicalText: insight.text,\n    contentHash,\n    title:\n      insight.text.slice(0, 100) + (insight.text.length > 100 ? \"...\" : \"\"),\n    tags: insight.tags,\n    metadata: {\n      kind: insight.kind,\n      pillar: insight.tags?.find((t) =>\n        [\n          \"market\",\n          \"competition\",\n          \"product\",\n          \"team\",\n          \"financials\",\n          \"regulatory\",\n          \"timing\",\n          \"customer\",\n          \"technology\",\n          \"distribution\",\n        ].includes(t)\n      ),\n      // Include sourceArtifactId for source document panel\n      sourceArtifactId: insight.sourceArtifactId,\n      // Include sourceQuestionId if this evidence was created to answer a question\n      sourceQuestionId: insight.sourceQuestionId,\n      // Include sourceAnchor for linking evidence back to source documents\n      sourceAnchor: insight.sourceAnchor,\n    },\n    sourceType: mapInsightSourceType(insight.sourceType),\n    aiProvider: insight.aiProvider,\n    confidence:\n      insight.verificationStatus === \"manually_verified\"\n        ? 0.9\n        : insight.verificationStatus === \"deep_verified\"\n          ? 0.7\n          : insight.verificationStatus === \"pre_screened\"\n            ? 0.5\n            : 0.3,\n    verificationStatus: mapVerificationStatus(insight.verificationStatus),\n    status: \"active\",\n    topicId: insight.projectId,\n    createdBy: insight.createdBy,\n    createdAt: now,\n    updatedAt: now,\n  });\n\n  // If there's a source artifact, create a derived_from edge\n  if (insight.sourceArtifactId) {\n    // Find or create the source node\n    const sourceNode = await findOrCreateSourceNode(\n      ctx,\n      insight.sourceArtifactId,\n      insight.createdBy,\n      insight.projectId\n    );\n    if (sourceNode) {\n      await createEpistemicEdge(ctx, {\n        fromNodeId: nodeId,\n        toNodeId: sourceNode,\n        edgeType: \"derived_from\",\n        projectId: insight.projectId,\n        createdBy: insight.createdBy,\n      });\n    }\n  }\n\n  return nodeId;\n}\n\n/**\n * Create an epistemic node for a belief\n * Called after inserting into the beliefs table\n */\nexport async function createEpistemicNodeForBelief(\n  ctx: MutationCtx,\n  beliefId: Id<\"epistemicNodes\">,\n  belief: {\n    projectId: string;\n    belief: string;\n    rationale?: string;\n    confidence: string;\n    topic?: string;\n    sourceAnchor?: {\n      artifactId: string;\n      artifactType: string;\n      artifactTitle?: string;\n      sectionHeading?: string;\n      selectedText?: string;\n      startOffset?: number;\n      endOffset?: number;\n    };\n    createdBy: string;\n  }\n): Promise<Id<\"epistemicNodes\">> {\n  const now = Date.now();\n  const globalId = generateGlobalId();\n  const contentHash = generateContentHash(\"belief\", belief.belief);\n\n  // Check for duplicate\n  const existing = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_contentHash\", (q) => q.eq(\"contentHash\", contentHash))\n    .first();\n\n  if (existing && existing.status === \"active\") {\n    await ctx.db.patch(existing._id, {\n      metadata: {\n        ...((existing.metadata as Record<string, unknown>) || {}),\n        sourceBeliefId: beliefId,\n      },\n      updatedAt: now,\n    });\n    return existing._id;\n  }\n\n  const nodeId = await ctx.db.insert(\"epistemicNodes\", {\n    globalId,\n    nodeType: \"belief\",\n    epistemicLayer: \"L3\", // Beliefs are at L3 (traversal anchors)\n    canonicalText: belief.belief,\n    contentHash,\n    content: belief.rationale,\n    title:\n      belief.belief.slice(0, 100) + (belief.belief.length > 100 ? \"...\" : \"\"),\n    metadata: {\n      sourceBeliefId: beliefId,\n      beliefStatus: \"assumption\",\n      topic: belief.topic, // Use 'topic' for consistency with legacy schema\n      pillar: belief.topic, // Keep 'pillar' for backward compat with existing data\n      // No confidence/confidenceLevel — only set after sprint completion\n      rationale: belief.rationale,\n      status: \"active\",\n      // Include sourceAnchor for linking beliefs back to source documents\n      sourceAnchor: belief.sourceAnchor,\n    },\n    beliefStatus: \"assumption\" as any,\n    epistemicStatus: \"assumption\" as any,\n    sourceType: \"human\",\n    confidence: undefined, // No confidence until sprint completion\n    verificationStatus: \"unverified\",\n    status: \"active\",\n    topicId: belief.projectId,\n    createdBy: belief.createdBy,\n    createdAt: now,\n    updatedAt: now,\n  });\n\n  return nodeId;\n}\n\n/**\n * Create an epistemic node for a question\n * Called after inserting into the questions table\n */\nexport async function createEpistemicNodeForQuestion(\n  ctx: MutationCtx,\n  _questionId: Id<\"epistemicNodes\">,\n  question: {\n    projectId: string;\n    question: string;\n    category?: string;\n    priority: string;\n    source: string;\n    sourceAnchor?: {\n      artifactId: string;\n      artifactType: string;\n      artifactTitle?: string;\n      sectionHeading?: string;\n      selectedText?: string;\n      startOffset?: number;\n      endOffset?: number;\n    };\n    createdBy: string;\n  }\n): Promise<Id<\"epistemicNodes\">> {\n  const now = Date.now();\n  const globalId = generateGlobalId();\n  const contentHash = generateContentHash(\"question\", question.question);\n\n  // Check for duplicate\n  const existing = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_contentHash\", (q) => q.eq(\"contentHash\", contentHash))\n    .first();\n\n  if (existing && existing.status === \"active\") {\n    await ctx.db.patch(existing._id, {\n      updatedAt: now,\n    });\n    return existing._id;\n  }\n\n  const sourceType: EpistemicSourceType =\n    question.source === \"manual\"\n      ? \"human\"\n      : question.source === \"ai_suggested\"\n        ? \"ai_generated\"\n        : \"ai_extracted\";\n\n  const nodeId = await ctx.db.insert(\"epistemicNodes\", {\n    globalId,\n    nodeType: \"question\",\n    epistemicLayer: \"L3\", // Questions are at L3 (traversal anchors)\n    canonicalText: question.question,\n    contentHash,\n    title:\n      question.question.slice(0, 100) +\n      (question.question.length > 100 ? \"...\" : \"\"),\n    metadata: {\n      pillar: question.category,\n      priority: question.priority,\n      source: question.source,\n      // Include sourceAnchor for linking questions back to source documents\n      sourceAnchor: question.sourceAnchor,\n    },\n    sourceType,\n    verificationStatus: \"unverified\",\n    status: \"active\",\n    topicId: question.projectId,\n    createdBy: question.createdBy,\n    createdAt: now,\n    updatedAt: now,\n  });\n\n  return nodeId;\n}\n\n/**\n * Create an epistemic node for a synthesis artifact (primer or deep research).\n *\n * ⚠️ IMPORTANT: This function should NOT be called for primers/deep research\n * unless the node is being connected to evidence as a source.\n * Standalone synthesis nodes create orphans in the graph.\n *\n * The correct pattern is:\n * 1. Store the artifact in finalArtifacts (for UI display)\n * 2. Only create epistemic node when extracting evidence FROM the artifact\n * 3. Create edge: evidence -> derived_from -> synthesis\n *\n * @deprecated Consider removing automatic node creation for primers.\n * Use the artifact ID reference in evidence metadata instead.\n */\nexport async function createEpistemicNodeForArtifact(\n  ctx: MutationCtx,\n  artifactId: Id<\"finalArtifacts\">,\n  artifact: {\n    projectId?: string;\n    title: string;\n    content: string;\n    type: string;\n    isDeepResearch?: boolean;\n    aiProvider?: string;\n    createdBy: string;\n  }\n): Promise<Id<\"epistemicNodes\">> {\n  const now = Date.now();\n  const globalId = generateGlobalId();\n\n  // Determine node type\n  let nodeType: EpistemicNodeType = \"source\";\n  const isSynthesis =\n    artifact.isDeepResearch ||\n    artifact.type.includes(\"deep\") ||\n    artifact.type.includes(\"research\") ||\n    artifact.type.includes(\"primer\");\n\n  if (isSynthesis) {\n    nodeType = \"synthesis\";\n\n    // ⚠️ DO NOT create standalone synthesis nodes\n    // Primers/deep research should be stored in finalArtifacts for UI display\n    // Epistemic nodes should only be created when:\n    // 1. Evidence is extracted FROM the artifact\n    // 2. The node is connected via derived_from edge\n    console.log(\n      `[EpistemicHelpers] Skipping synthesis node creation for \"${artifact.type}\" - ` +\n        \"will create when evidence is extracted\"\n    );\n\n    // Return a placeholder - callers should handle null\n    // For backward compatibility, we check for existing node first\n    const contentHash = generateContentHash(\n      nodeType,\n      artifact.title + artifact.content.slice(0, 500)\n    );\n    const existing = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_contentHash\", (q) => q.eq(\"contentHash\", contentHash))\n      .first();\n\n    if (existing && existing.status === \"active\") {\n      return existing._id; // Return existing node if found\n    }\n\n    // Don't create new synthesis nodes - they become orphans\n    // Throw to signal to callers that no node was created\n    throw new Error(\"SKIP_SYNTHESIS_NODE_CREATION\");\n  }\n\n  const contentHash = generateContentHash(\n    nodeType,\n    artifact.title + artifact.content.slice(0, 500)\n  );\n\n  // Check for duplicate\n  const existing = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_contentHash\", (q) => q.eq(\"contentHash\", contentHash))\n    .first();\n\n  if (existing && existing.status === \"active\") {\n    await ctx.db.patch(existing._id, {\n      metadata: {\n        ...((existing.metadata as Record<string, unknown>) || {}),\n        legacyArtifactId: artifactId,\n      },\n      updatedAt: now,\n    });\n    return existing._id;\n  }\n\n  // Source artifacts are L1 terminal leaves.\n  const epistemicLayer = \"L1\";\n\n  const nodeId = await ctx.db.insert(\"epistemicNodes\", {\n    globalId,\n    nodeType,\n    epistemicLayer, // Synthesis is L2, Source is L1\n    canonicalText: artifact.title,\n    contentHash,\n    content: artifact.content,\n    contentType: \"markdown\",\n    title: artifact.title,\n    metadata: {\n      legacyArtifactId: artifactId,\n      artifactType: artifact.type,\n    },\n    sourceType: \"ai_generated\",\n    aiProvider:\n      artifact.aiProvider || (artifact.isDeepResearch ? \"gemini\" : \"anthropic\"),\n    verificationStatus: \"unverified\",\n    status: \"active\",\n    topicId: artifact.projectId,\n    createdBy: artifact.createdBy,\n    createdAt: now,\n    updatedAt: now,\n  });\n\n  return nodeId;\n}\n\n/**\n * Find or create an epistemic node for a source artifact\n */\nasync function findOrCreateSourceNode(\n  ctx: MutationCtx,\n  artifactId: Id<\"finalArtifacts\">,\n  createdBy: string,\n  scopeProjectId?: string\n): Promise<Id<\"epistemicNodes\"> | null> {\n  // Check if we already have a node for this artifact.\n  // Scope by topicId when available; projectId indexes have been removed.\n  const artifact = await ctx.db.get(artifactId);\n  const effectiveProjectId = scopeProjectId || artifact?.projectId;\n  const effectiveTopicId = (artifact as any)?.topicId as string | undefined;\n\n  let existingNodes;\n  if (effectiveTopicId) {\n    existingNodes = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_topic\", (q: any) => q.eq(\"topicId\", effectiveTopicId))\n      .collect();\n  } else {\n    // Last resort: scan by nodeType and filter below.\n    existingNodes = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_nodeType\", (q) => q.eq(\"nodeType\", \"source\"))\n      .collect();\n  }\n\n  const existing = existingNodes.find((n) => {\n    if (effectiveProjectId && n.projectId && n.projectId !== effectiveProjectId) {\n      return false;\n    }\n    const metadata = n.metadata as Record<string, unknown> | undefined;\n    return metadata?.legacyArtifactId === artifactId;\n  });\n\n  if (existing) {\n    return existing._id;\n  }\n\n  // artifact was already fetched above for scoping; recheck in case it was null\n  if (!artifact) {\n    return null;\n  }\n\n  const now = Date.now();\n  const globalId = generateGlobalId();\n\n  // Determine node type based on artifact metadata\n  const artifactType =\n    ((artifact.metadata as Record<string, unknown>)?.type as string) || \"\";\n  const isDeepResearch = (artifact.metadata as Record<string, unknown>)\n    ?.isDeepResearch as boolean;\n\n  let nodeType: EpistemicNodeType = \"source\";\n  if (\n    isDeepResearch ||\n    artifactType.includes(\"deep\") ||\n    artifactType.includes(\"research\")\n  ) {\n    nodeType = \"synthesis\";\n  } else if (artifactType.includes(\"primer\")) {\n    nodeType = \"synthesis\";\n  }\n\n  const title =\n    ((artifact.metadata as Record<string, unknown>)?.title as string) ||\n    ((artifact.metadata as Record<string, unknown>)?.theme as string) ||\n    \"Untitled\";\n\n  const contentHash = generateContentHash(\n    nodeType,\n    title + (artifact.content?.slice(0, 500) || \"\")\n  );\n\n  // Determine layer based on nodeType\n  const epistemicLayer = nodeType === \"synthesis\" ? \"L2\" : \"L1\";\n\n  const nodeId = await ctx.db.insert(\"epistemicNodes\", {\n    globalId,\n    nodeType,\n    epistemicLayer, // Synthesis is L2, Source is L1\n    canonicalText: title,\n    contentHash,\n    content: artifact.content,\n    contentType: \"markdown\",\n    title,\n    metadata: {\n      legacyArtifactId: artifactId,\n      artifactType,\n      stage: artifact.stage,\n    },\n    sourceType: isDeepResearch ? \"ai_generated\" : \"ai_extracted\",\n    aiProvider: isDeepResearch ? \"gemini\" : \"anthropic\",\n    verificationStatus: \"unverified\",\n    status: \"active\",\n    topicId: artifact.projectId,\n    createdBy,\n    createdAt: now,\n    updatedAt: now,\n  });\n\n  return nodeId;\n}\n"]}

package/dist/epistemicNodes-BCQxpYx_.d.ts

@@ -0,0 +1,54 @@
+import { epistemicLayerValidator, epistemicNodeTypeValidator, l1NodeTypeValidator, l2NodeTypeValidator, l3NodeTypeValidator, l4NodeTypeValidator, nodeTypeValidator, ontologicalNodeTypeValidator, organizationalNodeTypeValidator, sourceTypeValidator, statusValidator, verificationStatusValidator } from './epistemicNodes.validators.js';
+import { get, getByContentHash, getByGlobalId, getByProject, getByProjectAndType, getByProjectAndTypeLite, listAll, search } from './epistemicNodes.queries.js';
+import { archive, batchCreate, create, supersede, update, verify } from './epistemicNodes.mutations.js';
+import { backfillTopicId, createInternal, getInternal, getNodesPendingEdgeSync, hardDelete, updateSyncStatus } from './epistemicNodes.internal.js';
+
+/**
+ * Epistemic Nodes - CRUD operations for the knowledge graph nodes
+ *
+ * Every belief, question, evidence, and source in StackOS is an epistemic node.
+ * This is the canonical identity layer - these records are the source of truth.
+ *
+ * @see /docs/architecture/EPISTEMIC_SPINE.md
+ */
+
+declare const getByTopic: any;
+
+declare const epistemicNodes_archive: typeof archive;
+declare const epistemicNodes_backfillTopicId: typeof backfillTopicId;
+declare const epistemicNodes_batchCreate: typeof batchCreate;
+declare const epistemicNodes_create: typeof create;
+declare const epistemicNodes_createInternal: typeof createInternal;
+declare const epistemicNodes_epistemicLayerValidator: typeof epistemicLayerValidator;
+declare const epistemicNodes_epistemicNodeTypeValidator: typeof epistemicNodeTypeValidator;
+declare const epistemicNodes_get: typeof get;
+declare const epistemicNodes_getByContentHash: typeof getByContentHash;
+declare const epistemicNodes_getByGlobalId: typeof getByGlobalId;
+declare const epistemicNodes_getByProject: typeof getByProject;
+declare const epistemicNodes_getByProjectAndType: typeof getByProjectAndType;
+declare const epistemicNodes_getByProjectAndTypeLite: typeof getByProjectAndTypeLite;
+declare const epistemicNodes_getByTopic: typeof getByTopic;
+declare const epistemicNodes_getInternal: typeof getInternal;
+declare const epistemicNodes_getNodesPendingEdgeSync: typeof getNodesPendingEdgeSync;
+declare const epistemicNodes_hardDelete: typeof hardDelete;
+declare const epistemicNodes_l1NodeTypeValidator: typeof l1NodeTypeValidator;
+declare const epistemicNodes_l2NodeTypeValidator: typeof l2NodeTypeValidator;
+declare const epistemicNodes_l3NodeTypeValidator: typeof l3NodeTypeValidator;
+declare const epistemicNodes_l4NodeTypeValidator: typeof l4NodeTypeValidator;
+declare const epistemicNodes_listAll: typeof listAll;
+declare const epistemicNodes_nodeTypeValidator: typeof nodeTypeValidator;
+declare const epistemicNodes_ontologicalNodeTypeValidator: typeof ontologicalNodeTypeValidator;
+declare const epistemicNodes_organizationalNodeTypeValidator: typeof organizationalNodeTypeValidator;
+declare const epistemicNodes_search: typeof search;
+declare const epistemicNodes_sourceTypeValidator: typeof sourceTypeValidator;
+declare const epistemicNodes_statusValidator: typeof statusValidator;
+declare const epistemicNodes_supersede: typeof supersede;
+declare const epistemicNodes_update: typeof update;
+declare const epistemicNodes_updateSyncStatus: typeof updateSyncStatus;
+declare const epistemicNodes_verificationStatusValidator: typeof verificationStatusValidator;
+declare const epistemicNodes_verify: typeof verify;
+declare namespace epistemicNodes {
+  export { epistemicNodes_archive as archive, epistemicNodes_backfillTopicId as backfillTopicId, epistemicNodes_batchCreate as batchCreate, epistemicNodes_create as create, epistemicNodes_createInternal as createInternal, epistemicNodes_epistemicLayerValidator as epistemicLayerValidator, epistemicNodes_epistemicNodeTypeValidator as epistemicNodeTypeValidator, epistemicNodes_get as get, epistemicNodes_getByContentHash as getByContentHash, epistemicNodes_getByGlobalId as getByGlobalId, epistemicNodes_getByProject as getByProject, epistemicNodes_getByProjectAndType as getByProjectAndType, epistemicNodes_getByProjectAndTypeLite as getByProjectAndTypeLite, epistemicNodes_getByTopic as getByTopic, epistemicNodes_getInternal as getInternal, epistemicNodes_getNodesPendingEdgeSync as getNodesPendingEdgeSync, epistemicNodes_hardDelete as hardDelete, epistemicNodes_l1NodeTypeValidator as l1NodeTypeValidator, epistemicNodes_l2NodeTypeValidator as l2NodeTypeValidator, epistemicNodes_l3NodeTypeValidator as l3NodeTypeValidator, epistemicNodes_l4NodeTypeValidator as l4NodeTypeValidator, epistemicNodes_listAll as listAll, epistemicNodes_nodeTypeValidator as nodeTypeValidator, epistemicNodes_ontologicalNodeTypeValidator as ontologicalNodeTypeValidator, epistemicNodes_organizationalNodeTypeValidator as organizationalNodeTypeValidator, epistemicNodes_search as search, epistemicNodes_sourceTypeValidator as sourceTypeValidator, epistemicNodes_statusValidator as statusValidator, epistemicNodes_supersede as supersede, epistemicNodes_update as update, epistemicNodes_updateSyncStatus as updateSyncStatus, epistemicNodes_verificationStatusValidator as verificationStatusValidator, epistemicNodes_verify as verify };
+}
+
+export { epistemicNodes as e, getByTopic as g };

package/dist/epistemicNodes.d.ts

@@ -1,2 +1,6 @@
+export { epistemicLayerValidator, epistemicNodeTypeValidator, l1NodeTypeValidator, l2NodeTypeValidator, l3NodeTypeValidator, l4NodeTypeValidator, nodeTypeValidator, ontologicalNodeTypeValidator, organizationalNodeTypeValidator, sourceTypeValidator, statusValidator, verificationStatusValidator } from './epistemicNodes.validators.js';
+export { get, getByContentHash, getByGlobalId, getByProject, getByProjectAndType, getByProjectAndTypeLite, listAll, search } from './epistemicNodes.queries.js';
+export { archive, batchCreate, create, supersede, update, verify } from './epistemicNodes.mutations.js';
+export { backfillTopicId, createInternal, getInternal, getNodesPendingEdgeSync, hardDelete, updateSyncStatus } from './epistemicNodes.internal.js';
+export { g as getByTopic } from './epistemicNodes-BCQxpYx_.js';
 import 'convex/values';
-export { a as archive, b as backfillTopicId, c as batchCreate, d as create, f as createInternal, g as epistemicLayerValidator, h as epistemicNodeTypeValidator, i as get, j as getByContentHash, k as getByGlobalId, l as getByProject, m as getByProjectAndType, n as getByProjectAndTypeLite, o as getByTopic, p as getInternal, q as getNodesPendingEdgeSync, r as hardDelete, s as l1NodeTypeValidator, t as l2NodeTypeValidator, u as l3NodeTypeValidator, v as l4NodeTypeValidator, w as listAll, x as nodeTypeValidator, y as ontologicalNodeTypeValidator, z as organizationalNodeTypeValidator, A as search, B as sourceTypeValidator, C as statusValidator, D as supersede, E as update, F as updateSyncStatus, G as verificationStatusValidator, H as verify } from './epistemicNodes-DjSUfvyD.js';

package/dist/epistemicNodes.helpers.d.ts

@@ -0,0 +1,51 @@
+import { Id, QueryCtx } from './convex.js';
+import { r as resolveTopicProjectScope } from './topicScope-By_zp4tt.js';
+import 'convex/values';
+
+declare const MAX_NODE_PAGE_SIZE = 8000;
+type WorkspaceNodeScope = Awaited<ReturnType<typeof resolveTopicProjectScope>>;
+type NodeIndexQuery = {
+    eq(field: string, value: unknown): NodeIndexQuery;
+};
+type NodeQueryChain<T> = {
+    withIndex(_name: string, callback: (q: NodeIndexQuery) => NodeIndexQuery): NodeQueryChain<T>;
+    order(direction: "asc" | "desc"): NodeQueryChain<T>;
+    collect(): Promise<T[]>;
+    take(limit: number): Promise<T[]>;
+};
+type ScopedNodeCtx = QueryCtx & {
+    db: {
+        query<T = unknown>(_table: string): NodeQueryChain<T>;
+    };
+};
+type WorkspaceScopedNode = {
+    _id: Id<"epistemicNodes">;
+    topicId?: Id<"topics">;
+    projectId?: string;
+    status: string;
+    nodeType: string;
+};
+declare function clampNodeLimit(limit: number | undefined, fallback?: number): number;
+type NodeStatusResult = {
+    success: true;
+} | {
+    success: true;
+    effectiveStatus: "archived";
+} | {
+    success: false;
+    error: "Node not found";
+} | {
+    success: true;
+    deletedEdgeCount: number;
+};
+declare function buildNodeStatusSuccessResult(): NodeStatusResult;
+declare function buildNodeArchivedResult(): NodeStatusResult;
+declare function buildNodeNotFoundResult(): NodeStatusResult;
+declare function buildNodeDeletedResult(deletedEdgeCount: number): NodeStatusResult;
+declare function nodeMatchesWorkspaceReasoningScope(node: Pick<WorkspaceScopedNode, "topicId" | "projectId">, scope: WorkspaceNodeScope): boolean;
+declare function collectScopedNodes(ctx: ScopedNodeCtx, scope: WorkspaceNodeScope, args: {
+    nodeType?: string;
+    scanLimit: number;
+}): Promise<WorkspaceScopedNode[]>;
+
+export { MAX_NODE_PAGE_SIZE, type WorkspaceNodeScope, type WorkspaceScopedNode, buildNodeArchivedResult, buildNodeDeletedResult, buildNodeNotFoundResult, buildNodeStatusSuccessResult, clampNodeLimit, collectScopedNodes, nodeMatchesWorkspaceReasoningScope };

package/dist/epistemicNodes.helpers.js

@@ -0,0 +1,73 @@
+// src/epistemicNodes.helpers.ts
+var DEFAULT_NODE_PAGE_SIZE = 250;
+var MAX_NODE_PAGE_SIZE = 8e3;
+function clampNodeLimit(limit, fallback = DEFAULT_NODE_PAGE_SIZE) {
+  if (!Number.isFinite(limit)) {
+    return fallback;
+  }
+  return Math.max(1, Math.min(Math.floor(limit), MAX_NODE_PAGE_SIZE));
+}
+function buildNodeStatusSuccessResult() {
+  return { success: true };
+}
+function buildNodeArchivedResult() {
+  return {
+    success: true,
+    effectiveStatus: "archived"
+  };
+}
+function buildNodeNotFoundResult() {
+  const result = {};
+  result.success = false;
+  result.error = "Node not found";
+  return result;
+}
+function buildNodeDeletedResult(deletedEdgeCount) {
+  return {
+    success: true,
+    deletedEdgeCount
+  };
+}
+function dedupeWorkspaceNodes(nodes) {
+  const seen = /* @__PURE__ */ new Set();
+  const deduped = [];
+  for (const node of nodes) {
+    const key = String(node._id);
+    if (seen.has(key)) {
+      continue;
+    }
+    seen.add(key);
+    deduped.push(node);
+  }
+  return deduped;
+}
+function nodeMatchesWorkspaceReasoningScope(node, scope) {
+  return scope.topicId !== void 0 && node.topicId === scope.topicId || scope.projectId !== void 0 && node.projectId === scope.projectId;
+}
+async function collectScopedNodes(ctx, scope, args) {
+  const queries = [];
+  if (scope.topicId) {
+    queries.push(
+      args.nodeType ? ctx.db.query("epistemicNodes").withIndex(
+        "by_topic_type",
+        (q) => q.eq("topicId", scope.topicId).eq("nodeType", args.nodeType)
+      ).order("desc").take(args.scanLimit) : ctx.db.query("epistemicNodes").withIndex("by_topic", (q) => q.eq("topicId", scope.topicId)).order("desc").take(args.scanLimit)
+    );
+  }
+  if (scope.projectId && !scope.topicId) {
+    queries.push(
+      args.nodeType ? ctx.db.query("epistemicNodes").withIndex(
+        "by_topic_type",
+        (q) => q.eq("topicId", scope.projectId).eq("nodeType", args.nodeType)
+      ).order("desc").take(args.scanLimit) : ctx.db.query("epistemicNodes").withIndex("by_topic", (q) => q.eq("topicId", scope.projectId)).order("desc").take(args.scanLimit)
+    );
+  }
+  const combined = dedupeWorkspaceNodes((await Promise.all(queries)).flat());
+  return combined.filter(
+    (node) => nodeMatchesWorkspaceReasoningScope(node, scope)
+  );
+}
+
+export { MAX_NODE_PAGE_SIZE, buildNodeArchivedResult, buildNodeDeletedResult, buildNodeNotFoundResult, buildNodeStatusSuccessResult, clampNodeLimit, collectScopedNodes, nodeMatchesWorkspaceReasoningScope };
+//# sourceMappingURL=epistemicNodes.helpers.js.map
+//# sourceMappingURL=epistemicNodes.helpers.js.map

package/dist/epistemicNodes.helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/epistemicNodes.helpers.ts"],"names":[],"mappings":";AAIA,IAAM,sBAAA,GAAyB,GAAA;AACxB,IAAM,kBAAA,GAAqB;AA8B3B,SAAS,cAAA,CACd,KAAA,EACA,QAAA,GAAW,sBAAA,EACH;AACR,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,KAAK,KAAA,CAAM,KAAe,CAAA,EAAG,kBAAkB,CAAC,CAAA;AAC9E;AAQO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO,EAAE,SAAS,IAAA,EAAK;AACzB;AAEO,SAAS,uBAAA,GAA4C;AAC1D,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,IAAA;AAAA,IACT,eAAA,EAAiB;AAAA,GACnB;AACF;AAEO,SAAS,uBAAA,GAA4C;AAC1D,EAAA,MAAM,SAAS,EAAC;AAChB,EAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AACjB,EAAA,MAAA,CAAO,KAAA,GAAQ,gBAAA;AACf,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,uBAAuB,gBAAA,EAA4C;AACjF,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,IAAA;AAAA,IACT;AAAA,GACF;AACF;AAEA,SAAS,qBAAiD,KAAA,EAAiB;AACzE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,UAAe,EAAC;AAEtB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AACjB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,IAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AAAA,EACnB;AAEA,EAAA,OAAO,OAAA;AACT;AAEO,SAAS,kCAAA,CACd,MACA,KAAA,EACS;AACT,EAAA,OACG,KAAA,CAAM,OAAA,KAAY,MAAA,IAAa,IAAA,CAAK,OAAA,KAAY,KAAA,CAAM,OAAA,IACtD,KAAA,CAAM,SAAA,KAAc,MAAA,IAAa,IAAA,CAAK,SAAA,KAAc,KAAA,CAAM,SAAA;AAE/D;AAEA,eAAsB,kBAAA,CACpB,GAAA,EACA,KAAA,EACA,IAAA,EAIgC;AAChC,EAAA,MAAM,UAA4C,EAAC;AAEnD,EAAA,IAAI,MAAM,OAAA,EAAS;AACjB,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,KAAK,QAAA,GACD,GAAA,CAAI,EAAA,CACD,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA;AAAA,QAAU,eAAA;AAAA,QAAiB,CAAC,CAAA,KAC3B,CAAA,CAAE,EAAA,CAAG,SAAA,EAAW,KAAA,CAAM,OAAO,CAAA,CAAE,EAAA,CAAG,UAAA,EAAY,IAAA,CAAK,QAAQ;AAAA,OAC7D,CACC,KAAA,CAAM,MAAM,CAAA,CACZ,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA,GACtB,GAAA,CAAI,EAAA,CACD,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,UAAA,EAAY,CAAC,CAAA,KAAW,CAAA,CAAE,EAAA,CAAG,SAAA,EAAW,KAAA,CAAM,OAAO,CAAC,CAAA,CAChE,KAAA,CAAM,MAAM,CAAA,CACZ,IAAA,CAAK,KAAK,SAAS;AAAA,KAC5B;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,CAAM,SAAA,IAAa,CAAC,KAAA,CAAM,OAAA,EAAS;AACrC,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,KAAK,QAAA,GACD,GAAA,CAAI,EAAA,CACD,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA;AAAA,QAAU,eAAA;AAAA,QAAiB,CAAC,CAAA,KAC3B,CAAA,CAAE,EAAA,CAAG,SAAA,EAAW,KAAA,CAAM,SAAS,CAAA,CAAE,EAAA,CAAG,UAAA,EAAY,IAAA,CAAK,QAAQ;AAAA,OAC/D,CACC,KAAA,CAAM,MAAM,CAAA,CACZ,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA,GACtB,GAAA,CAAI,EAAA,CACD,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,UAAA,EAAY,CAAC,CAAA,KAAW,CAAA,CAAE,EAAA,CAAG,SAAA,EAAW,KAAA,CAAM,SAAS,CAAC,CAAA,CAClE,KAAA,CAAM,MAAM,CAAA,CACZ,IAAA,CAAK,KAAK,SAAS;AAAA,KAC5B;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,sBAAsB,MAAM,OAAA,CAAQ,IAAI,OAAO,CAAA,EAAG,MAAM,CAAA;AACzE,EAAA,OAAO,QAAA,CAAS,MAAA;AAAA,IAAO,CAAC,IAAA,KACtB,kCAAA,CAAmC,IAAA,EAAM,KAAK;AAAA,GAChD;AACF","file":"epistemicNodes.helpers.js","sourcesContent":["import { checkScopeAccess } from \"@lucern/access-control/access\";\nimport type { Id, QueryCtx } from \"./convex\";\nimport { resolveTopicProjectScope } from \"./topicScope\";\n\nconst DEFAULT_NODE_PAGE_SIZE = 250;\nexport const MAX_NODE_PAGE_SIZE = 8000;\n\ntype WorkspaceNodeScope = Awaited<ReturnType<typeof resolveTopicProjectScope>>;\ntype NodeIndexQuery = {\n  eq(field: string, value: unknown): NodeIndexQuery;\n};\n\ntype NodeQueryChain<T> = {\n  withIndex(\n    _name: string,\n    callback: (q: NodeIndexQuery) => NodeIndexQuery,\n  ): NodeQueryChain<T>;\n  order(direction: \"asc\" | \"desc\"): NodeQueryChain<T>;\n  collect(): Promise<T[]>;\n  take(limit: number): Promise<T[]>;\n};\n\ntype ScopedNodeCtx = QueryCtx & {\n  db: {\n    query<T = unknown>(_table: string): NodeQueryChain<T>;\n  };\n};\nexport type WorkspaceScopedNode = {\n  _id: Id<\"epistemicNodes\">;\n  topicId?: Id<\"topics\">;\n  projectId?: string;\n  status: string;\n  nodeType: string;\n};\n\nexport function clampNodeLimit(\n  limit: number | undefined,\n  fallback = DEFAULT_NODE_PAGE_SIZE,\n): number {\n  if (!Number.isFinite(limit)) {\n    return fallback;\n  }\n  return Math.max(1, Math.min(Math.floor(limit as number), MAX_NODE_PAGE_SIZE));\n}\n\ntype NodeStatusResult =\n  | { success: true }\n  | { success: true; effectiveStatus: \"archived\" }\n  | { success: false; error: \"Node not found\" }\n  | { success: true; deletedEdgeCount: number };\n\nexport function buildNodeStatusSuccessResult(): NodeStatusResult {\n  return { success: true };\n}\n\nexport function buildNodeArchivedResult(): NodeStatusResult {\n  return {\n    success: true,\n    effectiveStatus: \"archived\",\n  };\n}\n\nexport function buildNodeNotFoundResult(): NodeStatusResult {\n  const result = {} as Extract<NodeStatusResult, { success: false }>;\n  result.success = false;\n  result.error = \"Node not found\";\n  return result;\n}\n\nexport function buildNodeDeletedResult(deletedEdgeCount: number): NodeStatusResult {\n  return {\n    success: true,\n    deletedEdgeCount,\n  };\n}\n\nfunction dedupeWorkspaceNodes<T extends { _id: unknown }>(nodes: T[]): T[] {\n  const seen = new Set<string>();\n  const deduped: T[] = [];\n\n  for (const node of nodes) {\n    const key = String(node._id);\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    deduped.push(node);\n  }\n\n  return deduped;\n}\n\nexport function nodeMatchesWorkspaceReasoningScope(\n  node: Pick<WorkspaceScopedNode, \"topicId\" | \"projectId\">,\n  scope: WorkspaceNodeScope,\n): boolean {\n  return (\n    (scope.topicId !== undefined && node.topicId === scope.topicId) ||\n    (scope.projectId !== undefined && node.projectId === scope.projectId)\n  );\n}\n\nexport async function collectScopedNodes(\n  ctx: ScopedNodeCtx,\n  scope: WorkspaceNodeScope,\n  args: {\n    nodeType?: string;\n    scanLimit: number;\n  },\n): Promise<WorkspaceScopedNode[]> {\n  const queries: Promise<WorkspaceScopedNode[]>[] = [];\n\n  if (scope.topicId) {\n    queries.push(\n      args.nodeType\n        ? ctx.db\n            .query(\"epistemicNodes\")\n            .withIndex(\"by_topic_type\", (q: any) =>\n              q.eq(\"topicId\", scope.topicId).eq(\"nodeType\", args.nodeType),\n            )\n            .order(\"desc\")\n            .take(args.scanLimit)\n        : ctx.db\n            .query(\"epistemicNodes\")\n            .withIndex(\"by_topic\", (q: any) => q.eq(\"topicId\", scope.topicId))\n            .order(\"desc\")\n            .take(args.scanLimit),\n    );\n  }\n\n  if (scope.projectId && !scope.topicId) {\n    queries.push(\n      args.nodeType\n        ? ctx.db\n            .query(\"epistemicNodes\")\n            .withIndex(\"by_topic_type\", (q: any) =>\n              q.eq(\"topicId\", scope.projectId).eq(\"nodeType\", args.nodeType),\n            )\n            .order(\"desc\")\n            .take(args.scanLimit)\n        : ctx.db\n            .query(\"epistemicNodes\")\n            .withIndex(\"by_topic\", (q: any) => q.eq(\"topicId\", scope.projectId))\n            .order(\"desc\")\n            .take(args.scanLimit),\n    );\n  }\n\n  const combined = dedupeWorkspaceNodes((await Promise.all(queries)).flat());\n  return combined.filter((node) =>\n    nodeMatchesWorkspaceReasoningScope(node, scope),\n  );\n}\n\nexport type { WorkspaceNodeScope };\n"]}

package/dist/epistemicNodes.internal.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Internal mutation to create a node with syncStatus tracking
+ * Used by neo4jEdgeAPI.createNodeWithEdges for atomic node+edge creation
+ */
+declare const createInternal: any;
+/**
+ * Internal query to get a node by ID
+ * Used by neo4jEdgeAPI for reading node data
+ */
+declare const getInternal: any;
+/**
+ * Update the sync status of a node (for Neo4j edge sync tracking)
+ * Used by neo4jEdgeAPI to mark nodes as synced or failed
+ */
+declare const updateSyncStatus: any;
+/**
+ * Backfill: move nodes from one topicId to another.
+ * Used for data migration when nodes are accidentally scoped to Root.
+ */
+declare const backfillTopicId: any;
+/**
+ * Find nodes that need edge sync retry
+ * Used by background reconciliation job
+ */
+declare const getNodesPendingEdgeSync: any;
+/**
+ * Permanently delete a node (hard delete)
+ * INTERNAL ONLY - not exposed to clients
+ * Use with extreme caution - prefer archive for most cases
+ * Violates Lucern Invariant #1 (append-only) - only use for data cleanup/migration
+ */
+declare const hardDelete: any;
+
+export { backfillTopicId, createInternal, getInternal, getNodesPendingEdgeSync, hardDelete, updateSyncStatus };