@lucern/graph-primitives 1.0.26 → 1.0.28

package/dist/epistemicEdgeCreation.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/convex.ts","../src/epistemicLayerRules.ts","../src/epistemicEdgeCreation.ts"],"names":[],"mappings":";;;;AAc0B,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;;;AChmBO,SAAS,oBAAoB,UAAA,EAA6B;AAC/D,EAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,IAAA,OAAO,UAAA,GAAa,CAAA,GAAI,UAAA,GAAa,GAAA,GAAM,UAAA;AAAA,EAC7C;AACA,EAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,IAAA,QAAQ,UAAA;AAAY,MAClB,KAAK,MAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT,KAAK,QAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT,KAAK,KAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT;AACE,QAAA,OAAO,GAAA;AAAA;AACX,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAiCA,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;AAMA,eAAsB,gCAAA,CACpB,GAAA,EACA,UAAA,EACA,SAAA,EACA,SAAA,EACwB;AACxB,EAAA,OAAA,CAAQ,IAAI,2DAAA,EAA6D;AAAA,IACvE,UAAA,EAAY,OAAO,UAAU,CAAA;AAAA,IAC7B,SAAA,EAAW,OAAO,SAAS;AAAA,GAC5B,CAAA;AAGD,EAAA,MAAM,YAAA,GAAe,MAAM,kBAAA,CAAmB,GAAA,EAAK,YAAY,UAAU,CAAA;AACzE,EAAA,MAAM,WAAA,GAAc,MAAM,kBAAA,CAAmB,GAAA,EAAK,WAAW,SAAS,CAAA;AAEtE,EAAA,OAAA,CAAQ,IAAI,+BAAA,EAAiC;AAAA,IAC3C,YAAA,EAAc,YAAA,GAAe,MAAA,CAAO,YAAY,CAAA,GAAI,IAAA;AAAA,IACpD,WAAA,EAAa,WAAA,GAAc,MAAA,CAAO,WAAW,CAAA,GAAI;AAAA,GAClD,CAAA;AAED,EAAA,IAAI,CAAC,YAAA,IAAgB,CAAC,WAAA,EAAa;AAGjC,IAAA,OAAA,CAAQ,IAAI,wDAAwD,CAAA;AACpE,IAAA,OAAO,IAAA;AAAA,EACT;AAGA,EAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,EAAA,CAAG,IAAI,UAAU,CAAA;AAC5C,EAAA,MAAM,YAAY,QAAA,EAAU,SAAA;AAI5B,EAAA,OAAO,MAAM,oBAAoB,GAAA,EAAK;AAAA,IACpC,UAAA,EAAY,WAAA;AAAA,IACZ,QAAA,EAAU,YAAA;AAAA,IACV,QAAA,EAAU,cAAA;AAAA,IACV,SAAA;AAAA,IACA,SAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACV,CAAA;AACH;AAKA,eAAe,kBAAA,CACb,GAAA,EACA,UAAA,EACA,QAAA,EACsC;AAItC,EAAA,MAAM,WACJ,UAAA,KAAe,SAAA,GACX,UAAA,GACA,UAAA,KAAe,aACb,QAAA,GACA,UAAA;AAER,EAAA,MAAM,QAAQ,MAAM,GAAA,CAAI,EAAA,CACrB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA;AAAA,IAAU,aAAA;AAAA,IAAe,CAAC,CAAA,KACzB,CAAA,CAAE,EAAA,CAAG,YAAY,QAAQ;AAAA,IAE1B,OAAA,EAAQ;AAEX,EAAA,MAAM,SAAA,GAAY,CAAA,MAAA,EAAS,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,EAAY,GAAI,UAAA,CAAW,KAAA,CAAM,CAAC,CAAC,CAAA,EAAA,CAAA;AAGnF,EAAA,MAAM,WAAA,GAAc,OAAO,QAAQ,CAAA;AAEnC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM;AAC9B,IAAA,MAAM,WAAW,CAAA,CAAE,QAAA;AACnB,IAAA,MAAM,QAAA,GAAW,WAAW,SAAS,CAAA;AAErC,IAAA,OAAO,QAAA,IAAY,MAAA,CAAO,QAAQ,CAAA,KAAM,WAAA;AAAA,EAC1C,CAAC,CAAA;AAED,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAA,CAAQ,GAAA;AAAA,MACN,CAAA,oCAAA,EAAuC,UAAU,CAAA,CAAA,EAAI,WAAW,cAAc,KAAA,CAAM,MAAM,IAAI,QAAQ,CAAA,MAAA;AAAA,KACxG;AAAA,EACF;AAEA,EAAA,OAAO,OAAO,GAAA,IAAO,IAAA;AACvB","file":"epistemicEdgeCreation.js","sourcesContent":["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"]}
+{"version":3,"sources":["../src/convex.ts","../src/epistemicLayerRules.ts","../src/epistemicEdgeCreation.ts"],"names":[],"mappings":";;;;AAyB0B,iBAAA;AACnB,IAAM,QAAA,GAAW,MAAA;;;ACsCjB,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;;;AChmBO,SAAS,oBAAoB,UAAA,EAA6B;AAC/D,EAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,IAAA,OAAO,UAAA,GAAa,CAAA,GAAI,UAAA,GAAa,GAAA,GAAM,UAAA;AAAA,EAC7C;AACA,EAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,IAAA,QAAQ,UAAA;AAAY,MAClB,KAAK,MAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT,KAAK,QAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT,KAAK,KAAA;AACH,QAAA,OAAO,GAAA;AAAA,MACT;AACE,QAAA,OAAO,GAAA;AAAA;AACX,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAiCA,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;AAMA,eAAsB,gCAAA,CACpB,GAAA,EACA,UAAA,EACA,SAAA,EACA,SAAA,EACwB;AACxB,EAAA,OAAA,CAAQ,IAAI,2DAAA,EAA6D;AAAA,IACvE,UAAA,EAAY,OAAO,UAAU,CAAA;AAAA,IAC7B,SAAA,EAAW,OAAO,SAAS;AAAA,GAC5B,CAAA;AAGD,EAAA,MAAM,YAAA,GAAe,MAAM,kBAAA,CAAmB,GAAA,EAAK,YAAY,UAAU,CAAA;AACzE,EAAA,MAAM,WAAA,GAAc,MAAM,kBAAA,CAAmB,GAAA,EAAK,WAAW,SAAS,CAAA;AAEtE,EAAA,OAAA,CAAQ,IAAI,+BAAA,EAAiC;AAAA,IAC3C,YAAA,EAAc,YAAA,GAAe,MAAA,CAAO,YAAY,CAAA,GAAI,IAAA;AAAA,IACpD,WAAA,EAAa,WAAA,GAAc,MAAA,CAAO,WAAW,CAAA,GAAI;AAAA,GAClD,CAAA;AAED,EAAA,IAAI,CAAC,YAAA,IAAgB,CAAC,WAAA,EAAa;AAGjC,IAAA,OAAA,CAAQ,IAAI,wDAAwD,CAAA;AACpE,IAAA,OAAO,IAAA;AAAA,EACT;AAGA,EAAA,MAAM,QAAA,GAAW,MAAM,GAAA,CAAI,EAAA,CAAG,IAAI,UAAU,CAAA;AAC5C,EAAA,MAAM,YAAY,QAAA,EAAU,SAAA;AAI5B,EAAA,OAAO,MAAM,oBAAoB,GAAA,EAAK;AAAA,IACpC,UAAA,EAAY,WAAA;AAAA,IACZ,QAAA,EAAU,YAAA;AAAA,IACV,QAAA,EAAU,cAAA;AAAA,IACV,SAAA;AAAA,IACA,SAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACV,CAAA;AACH;AAKA,eAAe,kBAAA,CACb,GAAA,EACA,UAAA,EACA,QAAA,EACsC;AAItC,EAAA,MAAM,WACJ,UAAA,KAAe,SAAA,GACX,UAAA,GACA,UAAA,KAAe,aACb,QAAA,GACA,UAAA;AAER,EAAA,MAAM,QAAQ,MAAM,GAAA,CAAI,EAAA,CACrB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA;AAAA,IAAU,aAAA;AAAA,IAAe,CAAC,CAAA,KACzB,CAAA,CAAE,EAAA,CAAG,YAAY,QAAQ;AAAA,IAE1B,OAAA,EAAQ;AAEX,EAAA,MAAM,SAAA,GAAY,CAAA,MAAA,EAAS,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,EAAY,GAAI,UAAA,CAAW,KAAA,CAAM,CAAC,CAAC,CAAA,EAAA,CAAA;AAGnF,EAAA,MAAM,WAAA,GAAc,OAAO,QAAQ,CAAA;AAEnC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM;AAC9B,IAAA,MAAM,WAAW,CAAA,CAAE,QAAA;AACnB,IAAA,MAAM,QAAA,GAAW,WAAW,SAAS,CAAA;AAErC,IAAA,OAAO,QAAA,IAAY,MAAA,CAAO,QAAQ,CAAA,KAAM,WAAA;AAAA,EAC1C,CAAC,CAAA;AAED,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAA,CAAQ,GAAA;AAAA,MACN,CAAA,oCAAA,EAAuC,UAAU,CAAA,CAAA,EAAI,WAAW,cAAc,KAAA,CAAM,MAAM,IAAI,QAAQ,CAAA,MAAA;AAAA,KACxG;AAAA,EACF;AAEA,EAAA,OAAO,OAAO,GAAA,IAAO,IAAA;AACvB","file":"epistemicEdgeCreation.js","sourcesContent":["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\n// TODO(FR.11-structural): `api`/`internal`/`components` are `anyApi as any`\n// because this module source tree is bundled into the kernel host at deploy time\n// and has NO top-level Convex `_generated/` directory to import a typed surface\n// from. Every `api.*` / `internal.*` / string-literal cross-component ref in this\n// module (topicScope.ts, topicProjectOverlay.ts, questionEvidenceLinks.ts,\n// beliefEvidenceLinks*.ts, epistemicQuestions.helpers.ts) inherits `any` from\n// here. The fix is structural — generate a per-module typed surface or a shared\n// typed function-reference manifest (template: the typed `components.controlPlane`\n// in modules/control-plane/src/component/convex.ts and the\n// `KERNEL_API_REF_MANIFEST` pattern in packages/server-core/src/kernelApi.ts) —\n// owned by the FR.11 closing/synthesis pass, not a mechanical swap.\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"]}

package/dist/epistemicEdges.handlers.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/epistemicEdges.helpers.ts","../src/convex.ts","../src/topicScope.ts","../src/epistemicInsert.ts","../src/epistemicEdges.handlers.ts"],"names":["v"],"mappings":";;;;;;;AAiBuC,CAAA,CAAE,KAAA;AAAA,EACvC,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,gBAAgB;AAC5B;AAEO,IAAM,0BAAA,GAA6B,EAAE,MAAA,CAAO;AAAA,EACjD,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA;AACP,CAA4D,CAAA;AAE3B,CAAA,CAAE,KAAA;AAAA;AAAA,EAEjC,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,0BAA0B,CAAA;AAAA,EACpC,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA;AAAA,EAG7B,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,OAAO,CAAA;AAAA,EACjB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA;AAAA;AAAA,EAMrB,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA,EAGrB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA,EAGrB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA;AAAA,EAGtB,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA;AAAA,EAGnB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA;AAAA,EAGvB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA;AAAA,EAGnB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA;AAAA,EAGpB,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,oBAAoB,CAAA;AAAA,EAC9B,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA,EACrB,CAAA,CAAE,QAAQ,kBAAkB,CAAA;AAAA,EAC5B,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA;AAAA,EAG3B,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,QAAQ,CAAA;AAAA;AAAA,EAGlB,CAAA,CAAE,QAAQ,kBAAkB,CAAA;AAAA,EAC5B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA;AAAA,EAGvB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,eAAe,CAAA;AAAA;AAAA,EAGzB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,eAAe,CAAA;AAAA,EACzB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA;AAAA,EAG1B,CAAA,CAAE,QAAQ,eAAe;AAC3B;AAEO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO,EAAE,SAAS,IAAA,EAAK;AACzB;AAYO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA;AAAA,IACT,MAAA,EAAQ;AAAA,GACV;AACF;AAEO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA;AAAA,IACT,MAAA,EAAQ;AAAA,GACV;AACF;AAEO,SAAS,0BAAA,CACd,QACA,OAAA,EACkB;AAClB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,IAAA;AAAA,IACT,MAAA;AAAA,IACA;AAAA,GACF;AACF;ACvJ0B,iBAAA;AAsGnB,IAAM,gBAAA,GACX,uBAAA;;;ACwSK,IAAM,iBAAA,GAAoB;AAAA,EAC/B,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,EAChC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ;AAChC,CAAA;ACjYA,eAAe,0BAAA,CACb,GAAA,EACA,YAAA,EACA,QAAA,EACe;AACf,EAAA,4BAAA,CAA6B,cAAc,QAAQ,CAAA;AACnD,EAAA,MAAM,OAAO,MAAM,GAAA,CAAI,EAAA,CACpB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,aAAA,EAAe,CAAC,MAAW,CAAA,CAAE,EAAA,CAAG,YAAY,QAAQ,CAAC,EAC/D,KAAA,EAAM;AACT,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,CAAA,4DAAA,EAA+D,YAAY,CAAA,gEAAA,EAAmE,QAAQ,CAAA,6BAAA;AAAA,KACxJ;AAAA,EACF;AACF;AAEA,eAAsB,mBAAA,CACpB,KACA,GAAA,EAC+B;AAC/B,EAAA,oBAAA,CAAqB,gBAAA,EAAkB,IAAI,QAAQ,CAAA;AAGnD,EAAA,2BAAA,CAA4B,IAAI,QAAQ,CAAA;AAGxC,EAAA,IAAI,CAAC,GAAA,CAAI,UAAA,IAAc,OAAO,GAAA,CAAI,eAAe,QAAA,EAAU;AACzD,IAAA,MAAM,IAAI,KAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAA,IAAI,CAAC,GAAA,CAAI,QAAA,IAAY,OAAO,GAAA,CAAI,aAAa,QAAA,EAAU;AACrD,IAAA,MAAM,IAAI,KAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAOA,EAAA,MAAM,0BAAA,CAA2B,GAAA,EAAK,YAAA,EAAc,GAAA,CAAI,UAAU,CAAA;AAClE,EAAA,MAAM,0BAAA,CAA2B,GAAA,EAAK,UAAA,EAAY,GAAA,CAAI,QAAQ,CAAA;AAG9D,EAAA,IAAI,IAAI,YAAA,IAAgB,GAAA,CAAI,UAAA,IAAc,GAAA,CAAI,aAAa,gBAAA,EAAkB;AAC3E,IAAA,uBAAA;AAAA,MACE,kBAAA;AAAA,MACA,GAAA,CAAI,QAAA;AAAA,MACJ;AAAA,QACE,IAAA,EAAM,gBAAA;AAAA,QACN,QAAQ,GAAA,CAAI,UAAA;AAAA,QACZ,UAAU,GAAA,CAAI;AAAA,OAChB;AAAA,MACA;AAAA,QACE,IAAA,EAAM,gBAAA;AAAA,QACN,QAAQ,GAAA,CAAI,QAAA;AAAA,QACZ,UAAU,GAAA,CAAI;AAAA;AAChB,KACF;AAAA,EACF;AAEA,EAAA,OAAO,GAAA,CAAI,EAAA,CAAG,MAAA,CAAO,gBAAA,EAAkB,GAAG,CAAA;AAC5C;;;AC3EO,IAAM,qBAAqB,gBAAA,CAAiB;AAAA,EACjD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,YAAA,EAAcA,EAAE,MAAA,EAAO;AAAA,IACvB,UAAA,EAAYA,EAAE,MAAA,EAAO;AAAA,IACrB,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,MAAA,EAAQA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC7B,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,cAAA,EAAgBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACrC,SAAA,EAAWA,EAAE,MAAA,EAAO;AAAA,IACpB,GAAG,iBAAA;AAAA,IACH,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAChC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACnC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACtC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,aAAA,EAAeA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACpC,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAChC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAAS,0BAA0B,CAAA;AAAA,IACnD,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAAS,0BAA0B;AAAA,GACxD;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,YAAY,CAAC,EACnE,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,0DAAA,EAA6D,KAAK,YAAY,CAAA;AAAA,OAChF;AACA,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,SAAS,MAAM,GAAA,CAAI,GACtB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,UAAU,CAAC,EACjE,KAAA,EAAM;AAET,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,QAAA,EAAU;AACZ,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,kCAAA,EAAqC,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AAChE,MAAA,OAAO,0BAAA,CAA2B,QAAA,CAAS,GAAA,EAAK,IAAI,CAAA;AAAA,IACtD;AAEA,IAAA,IAAI,CAAC,MAAA,EAAQ;AACX,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,sDAAA,EAAyD,KAAK,UAAU,CAAA,OAAA,EAAU,KAAK,QAAQ,CAAA,MAAA,EAAS,KAAK,QAAQ,CAAA,CAAA;AAAA,OACvH;AACA,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAAA,GAAS,MAAM,mBAAA,CAAoB,GAAA,EAAK;AAAA,MAC5C,UAAU,IAAA,CAAK,QAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAKf,YAAY,QAAA,CAAS,QAAA;AAAA,MACrB,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,gBAAgB,IAAA,CAAK,YAAA;AAAA,MACrB,gBAAgB,IAAA,CAAK,UAAA;AAAA;AAAA,MAErB,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,gBAAgB,IAAA,CAAK,cAAA;AAAA,MACrB,YAAY,IAAA,CAAK,UAAA;AAAA,MAKjB,aAAa,IAAA,CAAK,WAAA;AAAA,MAClB,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,cAAc,IAAA,CAAK,YAAA;AAAA,MACnB,iBAAiB,IAAA,CAAK,eAAA;AAAA,MACtB,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,SAAA,EAAW,GAAA;AAAA,MACX,SAAA,EAAW,GAAA;AAAA,MACX,SAAS,IAAA,CAAK,SAAA;AAAA,MACd,WAAW,IAAA,CAAK,SAAA;AAAA,MAOhB,SAAS,IAAA,CAAK,OAAA;AAAA,MAOd,cAAc,IAAA,CAAK,YAAA;AAAA,MACnB,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,iBAAiB,IAAA,CAAK,eAAA;AAAA,MAYtB,aAAa,IAAA,CAAK,WAAA;AAAA,MAOlB,eAAe,IAAA,CAAK,aAAA;AAAA,MAMpB,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,YAAY,IAAA,CAAK;AAAA,KAClB,CAAA;AAED,IAAA,OAAA,CAAQ,GAAA;AAAA,MACN,CAAA,sCAAA,EAAyC,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK,KAAK,QAAQ,CAAA,CAAA;AAAA,KAC1E;AACA,IAAA,OAAO,0BAAA,CAA2B,QAAQ,KAAK,CAAA;AAAA,EACjD;AACF,CAAC;AAMM,IAAM,uBAAuB,gBAAA,CAAiB;AAAA,EACnD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA;AAAO,GACrB;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA;AAChC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,uCAAA,EAA0C,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AACrE,IAAA,OAAO,4BAAA,EAA6B;AAAA,EACtC;AACF,CAAC;AAMM,IAAM,qBAAqB,gBAAA,CAAiB;AAAA,EACjD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,MAAA,EAAQA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC7B,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,cAAA,EAAgBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACrC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAAS,0BAA0B,CAAA;AAAA,IACnD,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAAS,0BAA0B;AAAA,GACxD;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,OAAA,GAAmC;AAAA,MACvC,SAAA,EAAW,KAAK,GAAA;AAAI,KACtB;AAEA,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,EAAW;AAC7B,MAAA,OAAA,CAAQ,SAAS,IAAA,CAAK,MAAA;AAAA,IACxB;AACA,IAAA,IAAI,IAAA,CAAK,eAAe,MAAA,EAAW;AACjC,MAAA,OAAA,CAAQ,aAAa,IAAA,CAAK,UAAA;AAAA,IAC5B;AACA,IAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW;AAC9B,MAAA,OAAA,CAAQ,UAAU,IAAA,CAAK,OAAA;AAAA,IACzB;AACA,IAAA,IAAI,IAAA,CAAK,mBAAmB,MAAA,EAAW;AACrC,MAAA,OAAA,CAAQ,iBAAiB,IAAA,CAAK,cAAA;AAAA,IAChC;AACA,IAAA,IAAI,IAAA,CAAK,eAAe,MAAA,EAAW;AACjC,MAAA,OAAA,CAAQ,aAAa,IAAA,CAAK,UAAA;AAAA,IAC5B;AACA,IAAA,IAAI,IAAA,CAAK,gBAAgB,MAAA,EAAW;AAClC,MAAA,OAAA,CAAQ,cAAc,IAAA,CAAK,WAAA;AAAA,IAC7B;AACA,IAAA,IAAI,IAAA,CAAK,aAAa,MAAA,EAAW;AAC/B,MAAA,OAAA,CAAQ,WAAW,IAAA,CAAK,QAAA;AAAA,IAC1B;AACA,IAAA,IAAI,IAAA,CAAK,aAAa,MAAA,EAAW;AAC/B,MAAA,OAAA,CAAQ,WAAW,IAAA,CAAK,QAAA;AAAA,IAC1B;AACA,IAAA,IAAI,IAAA,CAAK,iBAAiB,MAAA,EAAW;AACnC,MAAA,OAAA,CAAQ,eAAe,IAAA,CAAK,YAAA;AAAA,IAC9B;AACA,IAAA,IAAI,IAAA,CAAK,oBAAoB,MAAA,EAAW;AACtC,MAAA,OAAA,CAAQ,kBAAkB,IAAA,CAAK,eAAA;AAAA,IACjC;AAEA,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,KAAK,OAAO,CAAA;AACxC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,qCAAA,EAAwC,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AAEnE,IAAA,OAAO,4BAAA,EAA6B;AAAA,EACtC;AACF,CAAC","file":"epistemicEdges.handlers.js","sourcesContent":["/**\n * Shared validators and private helpers for epistemic edge operations.\n */\n\nimport { v } from \"convex/values\";\nimport type {\n  EdgeStatusResult,\n  SubjectiveOpinionDocument,\n  WorkspaceEdgeScope,\n  WorkspaceScopedEdge,\n} from \"./epistemicEdges.types\";\nimport type { Id, QueryCtx } from \"./convex\";\n\ntype TopicIndexQuery = {\n  eq(field: string, value: unknown): TopicIndexQuery;\n};\n\nexport const epistemicLayerValidator = v.union(\n  v.literal(\"L4\"),\n  v.literal(\"L3\"),\n  v.literal(\"L2\"),\n  v.literal(\"L1\"),\n  v.literal(\"ontological\"),\n  v.literal(\"organizational\"),\n);\n\nexport const subjectiveOpinionValidator = v.object({\n  b: v.number(),\n  d: v.number(),\n  u: v.number(),\n  a: v.number(),\n} satisfies Record<keyof SubjectiveOpinionDocument, unknown>);\n\nexport const edgeTypeValidator = v.union(\n  // --- L4 Decision Edges (Phase 2A) ---\n  v.literal(\"based_on_belief\"),\n  v.literal(\"based_on_question\"),\n  v.literal(\"blocked_by_contradiction\"),\n  v.literal(\"informed_by_theme\"),\n\n  // --- Evidence Flow (L2 → L3, L2 → L1) ---\n  v.literal(\"derived_from\"),\n  v.literal(\"responds_to\"),\n  v.literal(\"informs\"),\n  v.literal(\"tests\"),\n  v.literal(\"explores\"),\n  v.literal(\"qualifies\"),\n\n  // --- Synthesis (L2 → L2, L2 → L1) ---\n  // \"based_on\" removed — use \"derived_from\" instead\n\n  // --- Theme Relationships (L3 → L3) ---\n  v.literal(\"relates_to_thesis\"),\n  v.literal(\"belongs_to\"),\n  v.literal(\"plays_theme\"),\n  v.literal(\"scoped_by\"),\n\n  // --- Deal/Company ---\n  v.literal(\"evaluates\"),\n\n  // --- People (ontological → ontological, ontological → L3) ---\n  v.literal(\"perspective_on\"),\n  v.literal(\"works_at\"),\n  v.literal(\"mentioned_in\"),\n  v.literal(\"founded_by\"),\n\n  // --- Value Chain (ontological → ontological) ---\n  v.literal(\"participates_in\"),\n  v.literal(\"performs\"),\n  v.literal(\"function_in\"),\n  v.literal(\"impacts\"),\n\n  // --- Investment (ontological → ontological) ---\n  v.literal(\"invested_in\"),\n  v.literal(\"raised_from\"),\n\n  // --- Lifecycle (same layer only) ---\n  v.literal(\"supersedes\"),\n  v.literal(\"same_as\"),\n\n  // --- Same-Type Relationships: Belief ↔ Belief (L3 → L3) ---\n  v.literal(\"depends_on\"),\n  v.literal(\"supports\"),\n  v.literal(\"contains\"),\n\n  // --- Belief Cluster Mapping (L3 → L3) ---\n  v.literal(\"counterfactual_of\"),\n  v.literal(\"cascade_to\"),\n  v.literal(\"cascade_from\"),\n  v.literal(\"mutually_exclusive\"),\n  v.literal(\"correlates_with\"),\n  v.literal(\"amplifies\"),\n  v.literal(\"precondition_for\"),\n  v.literal(\"in_tension_with\"),\n\n  // --- Belief ↔ Belief: Epistemic Impact (Confidence Propagation) ---\n  v.literal(\"falsified_by\"),\n  v.literal(\"exclusive_with\"),\n  v.literal(\"contradicts\"),\n  v.literal(\"collapses_if\"),\n  v.literal(\"strengthened_by\"),\n  v.literal(\"weakened_by\"),\n  v.literal(\"alternative_to\"),\n  v.literal(\"subsumes\"),\n  v.literal(\"validated_by\"),\n  v.literal(\"required_for\"),\n  v.literal(\"blocks\"),\n\n  // --- Same-Type Relationships: Question ↔ Question (L3 → L3) ---\n  v.literal(\"prerequisite_for\"),\n  v.literal(\"parallel_to\"),\n\n  // --- Same-Type Relationships: Evidence ↔ Evidence (L2 → L2) ---\n  v.literal(\"corroborates\"),\n  v.literal(\"extends\"),\n  v.literal(\"same_source_as\"),\n  v.literal(\"same_theme_as\"),\n\n  // --- NEW: Deep Epistemic Analysis Edges (Phase: Schema Upgrade) ---\n  v.literal(\"assumes\"),\n  v.literal(\"would_predict\"),\n  v.literal(\"analogous_to\"),\n  v.literal(\"independent_of\"),\n\n  // --- Entity↔Belief Bridge (OE-B) ---\n  v.literal(\"competes_with\"),\n);\n\nexport function buildEdgeStatusSuccessResult(): EdgeStatusResult {\n  return { success: true };\n}\n\nexport function buildEdgeNotFoundResult(): EdgeStatusResult {\n  const result = {} as Extract<\n    EdgeStatusResult,\n    { success: false; error: \"Edge not found\" }\n  >;\n  result.success = false;\n  result.error = \"Edge not found\";\n  return result;\n}\n\nexport function buildEdgeMirrorSkippedResult(): EdgeStatusResult {\n  return {\n    success: false,\n    reason: \"source_not_in_convex\",\n  };\n}\n\nexport function buildEdgeMirrorMissingResult(): EdgeStatusResult {\n  return {\n    success: false,\n    reason: \"not_found\",\n  };\n}\n\nexport function buildEdgeMirrorWriteResult(\n  edgeId: Id<\"epistemicEdges\">,\n  existed: boolean,\n): EdgeStatusResult {\n  return {\n    success: true,\n    edgeId,\n    existed,\n  };\n}\n\nexport function edgeMatchesWorkspaceReasoningScope(\n  edge: Pick<WorkspaceScopedEdge, \"topicId\" | \"projectId\">,\n  scope: WorkspaceEdgeScope,\n): boolean {\n  return (\n    (scope.topicId !== undefined && edge.topicId === scope.topicId) ||\n    (scope.projectId !== undefined && edge.projectId === scope.projectId)\n  );\n}\n\nexport async function collectScopedEdges(\n  ctx: QueryCtx,\n  scope: WorkspaceEdgeScope,\n  scanLimit: number,\n): Promise<WorkspaceScopedEdge[]> {\n  const queries: Promise<WorkspaceScopedEdge[]>[] = [];\n\n  if (scope.topicId) {\n    queries.push(\n      ctx.db\n        .query(\"epistemicEdges\")\n        .withIndex(\"by_topic\", (q: TopicIndexQuery) =>\n          q.eq(\"topicId\", scope.topicId),\n        )\n        .order(\"desc\")\n        .take(scanLimit) as Promise<WorkspaceScopedEdge[]>,\n    );\n  }\n\n  // Kernel v2: also check edges scoped to projectId (many edges still have\n  // topicId=s97 scope while UI passes projectId=n97). Query both to catch all.\n  if (scope.projectId) {\n    queries.push(\n      ctx.db\n        .query(\"epistemicEdges\")\n        .withIndex(\"by_topic\", (q: TopicIndexQuery) =>\n          q.eq(\"topicId\", scope.projectId),\n        )\n        .order(\"desc\")\n        .take(scanLimit) as Promise<WorkspaceScopedEdge[]>,\n    );\n  }\n\n  const seen = new Set<string>();\n  const deduped: WorkspaceScopedEdge[] = [];\n\n  const flattened = (await Promise.all(queries)).flat();\n  for (const edge of flattened) {\n    const key = String(edge._id);\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    deduped.push(edge);\n  }\n\n  return deduped;\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","/** Topic-scope resolution helpers for graph-primitive operations. */\nimport { v } from \"convex/values\";\nimport { api as appApi } from \"./convex\";\nimport type { Id } from \"./convex\";\nimport { debugGraphPrimitiveFallback } from \"./debug\";\n\nconst LEGACY_SCOPE_FIELD = \"graphScope\" + \"ProjectId\";\n\ntype TopicDoc = Record<string, unknown> & {\n  _id: Id<\"topics\">;\n  globalId?: string;\n  name?: string;\n  depth?: number;\n  createdAt?: number;\n  parentTopicId?: Id<\"topics\">;\n  tenantId?: string;\n  workspaceId?: string;\n  metadata?: Record<string, unknown>;\n};\n\nexport type TopicProjectScope = {\n  topicId: Id<\"topics\">;\n  projectId?: string;\n  tenantId?: string;\n  workspaceId?: string;\n  source:\n    | \"topic\"\n    | \"project_mapped_topic\"\n    | \"topic_inferred\"\n    | \"topic_node\";\n};\n\n/**\n * RR.5 (legacy topics-table retirement) — graph-primitives mirror of the\n * kernel's epistemicNodes-first topic-scope fallback. Kept in lockstep with\n * `packages/reasoning-kernel/src/adapters/lib/topicScope.ts`\n * (`tests/unit/convex/topic-scope-fallbacks.test.ts` asserts parity).\n *\n * Resolves a topic that exists only as `epistemicNodes(nodeType=\"topic\")` —\n * the write-of-record — when no legacy `topics` row backs the ref, returning the\n * node's `topicId` self-key so scoped beliefs/evidence/questions stay reachable.\n * See the kernel module for the full silent-empty-result rationale.\n */\ntype TopicNodeScopeDoc = {\n  _id: string | Id<\"epistemicNodes\">;\n  globalId?: string;\n  nodeType?: string;\n  topicId?: string;\n  metadata?: Record<string, unknown>;\n};\n\nasync function resolveTopicNodeScopeOrNull(\n  ctx: any,\n  ref: string,\n): Promise<TopicProjectScope | null> {\n  if (!ctx?.db || typeof ctx.db.query !== \"function\") {\n    return null;\n  }\n\n  let node: TopicNodeScopeDoc | null = null;\n\n  // 1. The ref IS the topic node's UUIDv7 globalId.\n  try {\n    const byGlobalId = (await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q: any) => q.eq(\"globalId\", ref))\n      .first()) as TopicNodeScopeDoc | null;\n    if (byGlobalId && byGlobalId.nodeType === \"topic\") {\n      node = byGlobalId;\n    }\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] topic-node scope lookup by globalId failed\",\n      { error, ref },\n    );\n  }\n\n  if (!node) {\n    return null;\n  }\n\n  const scopeKey =\n    normalizeScopeValue(node.topicId) ?? normalizeScopeValue(node.globalId);\n  if (!scopeKey) {\n    return null;\n  }\n\n  return {\n    topicId: scopeKey as Id<\"topics\">,\n    projectId: asMappedProjectId(node as unknown as TopicDoc),\n    source: \"topic_node\",\n  };\n}\n\ntype MaterializedTopicNodeDoc = {\n  _id: string | Id<\"epistemicNodes\">;\n  metadata?: Record<string, unknown>;\n};\n\nfunction asMappedProjectId(\n  topic: TopicDoc | null | undefined,\n): string | undefined {\n  if (!topic) {\n    return;\n  }\n  const directLegacyProjectId = normalizeScopeValue(topic[LEGACY_SCOPE_FIELD]);\n  if (directLegacyProjectId) {\n    return directLegacyProjectId;\n  }\n  const metadata = (topic.metadata || {}) as Record<string, unknown>;\n  const candidate =\n    (metadata[LEGACY_SCOPE_FIELD] as string | undefined) ||\n    (metadata.legacyProjectId as string | undefined) ||\n    (metadata.projectId as string | undefined) ||\n    (metadata.scopeProjectId as string | undefined);\n  return candidate ? (candidate as string) : undefined;\n}\n\nfunction normalizeScopeValue(value: unknown): string | undefined {\n  if (typeof value !== \"string\") {\n    return;\n  }\n  const normalized = value.trim();\n  return normalized.length > 0 ? normalized : undefined;\n}\n\nfunction pickPrimaryTopic(candidates: TopicDoc[]): TopicDoc | undefined {\n  return [...candidates].sort((a, b) => {\n    const depthA = a.depth ?? 9999;\n    const depthB = b.depth ?? 9999;\n    if (depthA !== depthB) {\n      return depthA - depthB;\n    }\n    const createdA = a.createdAt ?? Number.MAX_SAFE_INTEGER;\n    const createdB = b.createdAt ?? Number.MAX_SAFE_INTEGER;\n    if (createdA !== createdB) {\n      return createdA - createdB;\n    }\n    return String(a.name || \"\").localeCompare(String(b.name || \"\"));\n  })[0];\n}\n\nasync function findTopicsByScopeAlias(\n  ctx: any,\n  scopeId: string,\n): Promise<TopicDoc[]> {\n  try {\n    return (await ctx.db\n      .query(\"topics\")\n      .withIndex(\"by_graph_scope_project\", (q: any) =>\n        q.eq(LEGACY_SCOPE_FIELD, scopeId),\n      )\n      .collect()) as TopicDoc[];\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve scope alias via index\",\n      {\n        error,\n        scopeId,\n      },\n    );\n    // Older Lucern dev deployments can lag index backfills while still carrying\n    // the underlying topics table. Scan and filter so scope resolution keeps\n    // working during the rollout.\n    const topics = (await ctx.db.query(\"topics\").collect()) as TopicDoc[];\n    return topics.filter((topic) => {\n      const normalizedGlobalId = normalizeScopeValue(topic.globalId);\n      const mappedProjectId = asMappedProjectId(topic);\n      return (\n        String(topic._id) === scopeId ||\n        normalizedGlobalId === scopeId ||\n        mappedProjectId === scopeId\n      );\n    });\n  }\n}\n\nasync function tryResolveHostTopicById(\n  ctx: any,\n  topicId: string,\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.get as any, {\n      id: topicId,\n    })) ?? null) as TopicDoc | null;\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve topic by host query\",\n      {\n        error,\n        topicId,\n      },\n    );\n    return null;\n  }\n}\n\nasync function tryResolveHostTopicByLegacyScope(\n  ctx: any,\n  legacyScopeId: string,\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.getByLegacyScopeId as any, {\n      projectId: legacyScopeId,\n    })) ?? null) as TopicDoc | null;\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve topic by legacy scope\",\n      {\n        error,\n        legacyScopeId,\n      },\n    );\n    return null;\n  }\n}\n\nexport function readMaterializedTopicTableId(\n  topicNode: MaterializedTopicNodeDoc | null | undefined,\n): string | undefined {\n  if (!topicNode) {\n    return;\n  }\n\n  const metadata = (topicNode.metadata || {}) as Record<string, unknown>;\n  const topicTableId =\n    (metadata.topicTableId as string | undefined) ||\n    (metadata.topicId as string | undefined);\n\n  return typeof topicTableId === \"string\" && topicTableId.trim().length > 0\n    ? topicTableId.trim()\n    : undefined;\n}\n\n/**\n * Walk the topic parent chain to find inherited workspaceId and tenantId.\n * Mirrors the pattern used by resolveTopicOntology for ontologyId inheritance.\n * Max depth: 10 (defensive limit against pathological nesting).\n */\nasync function resolveInheritedWorkspaceScope(\n  ctx: any,\n  topic: TopicDoc,\n): Promise<{ tenantId?: string; workspaceId?: string }> {\n  const MAX_DEPTH = 10;\n  let tenantId = normalizeScopeValue(topic.tenantId);\n  let workspaceId = normalizeScopeValue(topic.workspaceId);\n\n  if (tenantId && workspaceId) {\n    return { tenantId, workspaceId };\n  }\n\n  let current: TopicDoc | null = topic;\n  for (let i = 0; i < MAX_DEPTH && current?.parentTopicId; i++) {\n    current = (await ctx.db.get(current.parentTopicId)) as TopicDoc | null;\n    if (!current) break;\n\n    if (!tenantId) {\n      tenantId = normalizeScopeValue(current.tenantId);\n    }\n    if (!workspaceId) {\n      workspaceId = normalizeScopeValue(current.workspaceId);\n    }\n    if (tenantId && workspaceId) break;\n  }\n\n  return { tenantId, workspaceId };\n}\n\nexport async function resolveTopicProjectScope(\n  ctx: any,\n  args: { topicId?: Id<\"topics\"> | string; projectId?: string },\n): Promise<TopicProjectScope> {\n  if (args.topicId) {\n    // Try direct lookup, fall back to the legacy mapped-project bridge\n    let topic: TopicDoc | null = null;\n    try {\n      topic = (await ctx.db.get(\n        args.topicId as Id<\"topics\">,\n      )) as TopicDoc | null;\n    } catch (error) {\n      debugGraphPrimitiveFallback(\n        \"[topicScope] Failed to load topic by direct id\",\n        {\n          error,\n          topicId: args.topicId,\n        },\n      );\n      // Not a valid topics table ID\n    }\n    if (!topic) {\n      topic = await tryResolveHostTopicById(ctx, String(args.topicId));\n    }\n    if (!topic) {\n      // Try as legacy projectId / globalId via the mapped-project bridge.\n      topic =\n        pickPrimaryTopic(\n          await findTopicsByScopeAlias(ctx, String(args.topicId)),\n        ) ?? null;\n    }\n    if (!topic) {\n      // RR.5: no legacy topics row — resolve the canonical topic node store\n      // before throwing (silent-empty-result fix).\n      const nodeScope = await resolveTopicNodeScopeOrNull(\n        ctx,\n        String(args.topicId),\n      );\n      if (nodeScope) {\n        return nodeScope;\n      }\n      throw new Error(`Topic not found: ${String(args.topicId)}`);\n    }\n    const inherited = await resolveInheritedWorkspaceScope(ctx, topic);\n    const mapped = asMappedProjectId(topic);\n    if (mapped) {\n      return {\n        topicId: topic._id,\n        projectId: mapped,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic\",\n      };\n    }\n    return {\n      topicId: topic._id,\n      tenantId: inherited.tenantId,\n      workspaceId: inherited.workspaceId,\n      source: \"topic\",\n    };\n  }\n\n  if (args.projectId) {\n    let directTopic: TopicDoc | null = null;\n    try {\n      directTopic = (await ctx.db.get(\n        args.projectId as Id<\"topics\">,\n      )) as TopicDoc | null;\n    } catch (error) {\n      debugGraphPrimitiveFallback(\n        \"[topicScope] Failed to load direct project topic\",\n        {\n          error,\n          projectId: args.projectId,\n        },\n      );\n      // Not a valid topics table ID, continue to legacy graph-scope lookup.\n    }\n\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    directTopic = await tryResolveHostTopicByLegacyScope(ctx, args.projectId);\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    const topics = await findTopicsByScopeAlias(ctx, args.projectId);\n    const primary = pickPrimaryTopic(topics);\n    if (primary) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, primary);\n      return {\n        topicId: primary._id,\n        projectId: args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"project_mapped_topic\",\n      };\n    }\n    // RR.5: try the canonical topic node store before failing.\n    const nodeScope = await resolveTopicNodeScopeOrNull(\n      ctx,\n      String(args.projectId),\n    );\n    if (nodeScope) {\n      return {\n        ...nodeScope,\n        projectId: nodeScope.projectId ?? String(args.projectId),\n      };\n    }\n\n    throw new Error(\n      `Legacy project scope ${String(args.projectId)} has no mapped topic.`,\n    );\n  }\n\n  throw new Error(\n    \"Missing scope: provide topicId (preferred) or legacy projectId alias.\",\n  );\n}\n\n/** Shared scope args for graph-primitive functions. topicId is canonical; projectId is a legacy alias. */\nexport const optionalScopeArgs = {\n  projectId: v.optional(v.string()),\n  topicId: v.optional(v.string()),\n} as const;\n","import type { WithoutSystemFields } from \"convex/server\";\nimport {\n  assertUuidV7Identity,\n  assertStorageEdgeVocabulary,\n  assertUuidShapedEdgeEndpoint,\n} from \"@lucern/contracts/ids\";\nimport {\n  assertEdgePolicyAllowed,\n  edgePolicyManifest,\n  type EpistemicNodeType,\n} from \"@lucern/contracts\";\nimport type { Doc, Id, MutationCtx } from \"./convex\";\n\nexport async function insertEpistemicNode(\n  ctx: MutationCtx,\n  doc: WithoutSystemFields<Doc<\"epistemicNodes\">>,\n): Promise<Id<\"epistemicNodes\">> {\n  assertUuidV7Identity(\"epistemicNodes\", doc.globalId);\n  return ctx.db.insert(\"epistemicNodes\", doc);\n}\n\n/**\n * C2-RR.4b — REFERENTIAL edge-endpoint canonicality (amends RR.4's FORMAT guard).\n *\n * Proves an endpoint is the `globalId` of an EXISTING `epistemicNodes` row, not\n * that it has a v7 shape. Refuses doc-ids and fabricated/unknown endpoints while\n * keeping legacy v4-`globalId` nodes (the established prod corpus) linkable.\n * SHAPE pre-filter accepts both v4 and v7; the indexed `by_globalId` lookup is\n * the referential authority (no full scan). v7-format stays enforced only at new\n * identity minting (`assertUuidV7Identity`). See c2-rr4b-endpoint-referential.\n */\nasync function assertExistingNodeEndpoint(\n  ctx: MutationCtx,\n  endpointRole: \"fromNodeId\" | \"toNodeId\",\n  endpoint: string,\n): Promise<void> {\n  assertUuidShapedEdgeEndpoint(endpointRole, endpoint);\n  const node = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_globalId\", (q: any) => q.eq(\"globalId\", endpoint))\n    .first();\n  if (!node) {\n    throw new Error(\n      `edge_endpoint_not_canonical: epistemicEdges insert requires ${endpointRole} to be the globalId of an existing epistemicNodes row, received ${endpoint} (no node with that globalId)`,\n    );\n  }\n}\n\nexport async function insertEpistemicEdge(\n  ctx: MutationCtx,\n  doc: WithoutSystemFields<Doc<\"epistemicEdges\">>,\n): Promise<Id<\"epistemicEdges\">> {\n  assertUuidV7Identity(\"epistemicEdges\", doc.globalId);\n\n  // R1.1a — STORAGE-VOCABULARY MEMBERSHIP\n  assertStorageEdgeVocabulary(doc.edgeType);\n\n  // R1.1b — ENDPOINT PRESENCE\n  if (!doc.fromNodeId || typeof doc.fromNodeId !== \"string\") {\n    throw new Error(\n      \"edge_endpoint_missing: epistemicEdges insert requires a non-empty fromNodeId\"\n    );\n  }\n  if (!doc.toNodeId || typeof doc.toNodeId !== \"string\") {\n    throw new Error(\n      \"edge_endpoint_missing: epistemicEdges insert requires a non-empty toNodeId\"\n    );\n  }\n\n  // C2-RR.4b Defect E (REFERENTIAL) — ENDPOINT CANONICAL IDENTITY. Edge\n  // endpoints must each be the globalId of an EXISTING epistemicNodes row,\n  // never a Convex doc id, a legacy topic id, or a fabricated/unknown uuid.\n  // This refuses the mixed _id/globalId endpoint writes at the floor while\n  // keeping legacy v4-globalId nodes linkable (RR.4b prod-incident cure).\n  await assertExistingNodeEndpoint(ctx, \"fromNodeId\", doc.fromNodeId);\n  await assertExistingNodeEndpoint(ctx, \"toNodeId\", doc.toNodeId);\n\n  // R1.1c — FULL POLICY ASSERT (when nodeTypes are present and edgeType is in public manifest)\n  if (doc.fromNodeType && doc.toNodeType && doc.edgeType !== \"extracted_from\") {\n    assertEdgePolicyAllowed(\n      edgePolicyManifest,\n      doc.edgeType,\n      {\n        kind: \"epistemic_node\",\n        nodeId: doc.fromNodeId,\n        nodeType: doc.fromNodeType as EpistemicNodeType,\n      },\n      {\n        kind: \"epistemic_node\",\n        nodeId: doc.toNodeId,\n        nodeType: doc.toNodeType as EpistemicNodeType,\n      }\n    );\n  }\n\n  return ctx.db.insert(\"epistemicEdges\", doc);\n}\n","/**\n * Internal mutations for Neo4j/Convex dual-write edge mirroring.\n */\n\nimport { v } from \"convex/values\";\nimport { permissiveReturn } from \"@lucern/contracts/schema-helpers/validators\";\nimport {\n  buildEdgeMirrorMissingResult,\n  buildEdgeMirrorSkippedResult,\n  buildEdgeMirrorWriteResult,\n  buildEdgeStatusSuccessResult,\n  subjectiveOpinionValidator,\n} from \"./epistemicEdges.helpers\";\nimport { optionalScopeArgs } from \"./topicScope\";\nimport { internalMutation } from \"./convex\";\nimport { insertEpistemicEdge } from \"./epistemicInsert.js\";\n\n/**\n * Internal mutation to mirror a Neo4j edge to Convex for reactive UI.\n * Called by createEdge action for edge types that need reactive UI updates.\n */\nexport const mirrorEdgeToConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n    fromGlobalId: v.string(),\n    toGlobalId: v.string(),\n    edgeType: v.string(),\n    weight: v.optional(v.number()),\n    confidence: v.optional(v.number()),\n    context: v.optional(v.string()),\n    derivationType: v.optional(v.string()),\n    createdBy: v.string(),\n    ...optionalScopeArgs,\n    fromLayer: v.optional(v.string()),\n    toLayer: v.optional(v.string()),\n    fromNodeType: v.optional(v.string()),\n    toNodeType: v.optional(v.string()),\n    reasoningMethod: v.optional(v.string()),\n    logicalRole: v.optional(v.string()),\n    temporalClass: v.optional(v.string()),\n    validFrom: v.optional(v.number()),\n    validUntil: v.optional(v.number()),\n    constraint: v.optional(v.string()),\n    propagation: v.optional(v.string()),\n    blocking: v.optional(v.boolean()),\n    implicit: v.optional(v.boolean()),\n    conditionalA: v.optional(subjectiveOpinionValidator),\n    conditionalNotA: v.optional(subjectiveOpinionValidator),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const fromNode = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.fromGlobalId))\n      .first();\n\n    if (!fromNode) {\n      console.log(\n        `[Dual-Write] Skipping mirror - source node not in Convex: ${args.fromGlobalId}`,\n      );\n      return buildEdgeMirrorSkippedResult();\n    }\n\n    const toNode = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.toGlobalId))\n      .first();\n\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (existing) {\n      console.log(`[Dual-Write] Edge already exists: ${args.globalId}`);\n      return buildEdgeMirrorWriteResult(existing._id, true);\n    }\n\n    if (!toNode) {\n      console.log(\n        `[Dual-Write] Skipping mirror - to-node not in Convex: ${args.toGlobalId} (edge ${args.globalId} type ${args.edgeType})`\n      );\n      return buildEdgeMirrorSkippedResult();\n    }\n\n    const now = Date.now();\n    const edgeId = await insertEpistemicEdge(ctx, {\n      globalId: args.globalId,\n      // C2-RR.4 Defect E — endpoints are canonical node globalIds, not Convex\n      // doc ids. fromNode/toNode are resolved by_globalId above, so their\n      // stored globalId equals args.from/toGlobalId; persisting the doc _id here\n      // was the \"mixed _id/globalId\" defect.\n      fromNodeId: fromNode.globalId,\n      toNodeId: toNode.globalId,\n      sourceGlobalId: args.fromGlobalId,\n      targetGlobalId: args.toGlobalId,\n      // Preserve the canonical string value even when the local schema lags.\n      edgeType: args.edgeType as string,\n      weight: args.weight,\n      confidence: args.confidence,\n      context: args.context,\n      derivationType: args.derivationType,\n      constraint: args.constraint as\n        | \"xor\"\n        | \"alternative\"\n        | \"counterfactual\"\n        | undefined,\n      propagation: args.propagation as \"threshold\" | \"continuous\" | undefined,\n      blocking: args.blocking,\n      implicit: args.implicit,\n      conditionalA: args.conditionalA,\n      conditionalNotA: args.conditionalNotA,\n      createdBy: args.createdBy,\n      createdAt: now,\n      updatedAt: now,\n      topicId: args.projectId as string | undefined,\n      fromLayer: args.fromLayer as\n        | \"L4\"\n        | \"L3\"\n        | \"L2\"\n        | \"L1\"\n        | \"ontological\"\n        | undefined,\n      toLayer: args.toLayer as\n        | \"L4\"\n        | \"L3\"\n        | \"L2\"\n        | \"L1\"\n        | \"ontological\"\n        | undefined,\n      fromNodeType: args.fromNodeType,\n      toNodeType: args.toNodeType,\n      reasoningMethod: args.reasoningMethod as\n        | \"deductive\"\n        | \"causal\"\n        | \"inductive\"\n        | \"abductive\"\n        | \"statistical\"\n        | \"analogical\"\n        | \"correlational\"\n        | \"testimonial\"\n        | \"implicit\"\n        | \"pattern_match\"\n        | undefined,\n      logicalRole: args.logicalRole as\n        | \"necessary\"\n        | \"sufficient\"\n        | \"necessary_sufficient\"\n        | \"contributory\"\n        | \"corroborative\"\n        | undefined,\n      temporalClass: args.temporalClass as\n        | \"structural\"\n        | \"cyclical\"\n        | \"transient\"\n        | \"point_in_time\"\n        | undefined,\n      validFrom: args.validFrom,\n      validUntil: args.validUntil,\n    });\n\n    console.log(\n      `[Dual-Write] Mirrored edge to Convex: ${args.globalId} (${args.edgeType})`,\n    );\n    return buildEdgeMirrorWriteResult(edgeId, false);\n  },\n});\n\n/**\n * Internal mutation to delete a mirrored edge from Convex.\n * Called by deleteEdge action to maintain Convex mirror consistency.\n */\nexport const deleteEdgeFromConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (!existing) {\n      return buildEdgeMirrorMissingResult();\n    }\n\n    await ctx.db.delete(existing._id);\n    console.log(`[Dual-Write] Deleted edge from Convex: ${args.globalId}`);\n    return buildEdgeStatusSuccessResult();\n  },\n});\n\n/**\n * Internal mutation to update a mirrored edge in Convex.\n * Called by updateEdge action to maintain Convex mirror consistency.\n */\nexport const updateEdgeInConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n    weight: v.optional(v.number()),\n    confidence: v.optional(v.number()),\n    context: v.optional(v.string()),\n    derivationType: v.optional(v.string()),\n    constraint: v.optional(v.string()),\n    propagation: v.optional(v.string()),\n    blocking: v.optional(v.boolean()),\n    implicit: v.optional(v.boolean()),\n    conditionalA: v.optional(subjectiveOpinionValidator),\n    conditionalNotA: v.optional(subjectiveOpinionValidator),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (!existing) {\n      return buildEdgeMirrorMissingResult();\n    }\n\n    const updates: Record<string, unknown> = {\n      updatedAt: Date.now(),\n    };\n\n    if (args.weight !== undefined) {\n      updates.weight = args.weight;\n    }\n    if (args.confidence !== undefined) {\n      updates.confidence = args.confidence;\n    }\n    if (args.context !== undefined) {\n      updates.context = args.context;\n    }\n    if (args.derivationType !== undefined) {\n      updates.derivationType = args.derivationType;\n    }\n    if (args.constraint !== undefined) {\n      updates.constraint = args.constraint;\n    }\n    if (args.propagation !== undefined) {\n      updates.propagation = args.propagation;\n    }\n    if (args.blocking !== undefined) {\n      updates.blocking = args.blocking;\n    }\n    if (args.implicit !== undefined) {\n      updates.implicit = args.implicit;\n    }\n    if (args.conditionalA !== undefined) {\n      updates.conditionalA = args.conditionalA;\n    }\n    if (args.conditionalNotA !== undefined) {\n      updates.conditionalNotA = args.conditionalNotA;\n    }\n\n    await ctx.db.patch(existing._id, updates);\n    console.log(`[Dual-Write] Updated edge in Convex: ${args.globalId}`);\n\n    return buildEdgeStatusSuccessResult();\n  },\n});\n"]}
+{"version":3,"sources":["../src/epistemicEdges.helpers.ts","../src/convex.ts","../src/topicScope.ts","../src/epistemicInsert.ts","../src/epistemicEdges.handlers.ts"],"names":["v"],"mappings":";;;;;;;AAiBuC,CAAA,CAAE,KAAA;AAAA,EACvC,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,IAAI,CAAA;AAAA,EACd,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,gBAAgB;AAC5B;AAEO,IAAM,0BAAA,GAA6B,EAAE,MAAA,CAAO;AAAA,EACjD,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA,EAAO;AAAA,EACZ,CAAA,EAAG,EAAE,MAAA;AACP,CAA4D,CAAA;AAE3B,CAAA,CAAE,KAAA;AAAA;AAAA,EAEjC,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,0BAA0B,CAAA;AAAA,EACpC,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA;AAAA,EAG7B,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,OAAO,CAAA;AAAA,EACjB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA;AAAA;AAAA,EAMrB,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA,EAGrB,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA;AAAA,EAGrB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA;AAAA,EAGtB,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA;AAAA,EAGnB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA;AAAA,EAGvB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA;AAAA,EAGnB,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA;AAAA,EAGpB,CAAA,CAAE,QAAQ,mBAAmB,CAAA;AAAA,EAC7B,CAAA,CAAE,QAAQ,YAAY,CAAA;AAAA,EACtB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,oBAAoB,CAAA;AAAA,EAC9B,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,WAAW,CAAA;AAAA,EACrB,CAAA,CAAE,QAAQ,kBAAkB,CAAA;AAAA,EAC5B,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA;AAAA,EAG3B,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,iBAAiB,CAAA;AAAA,EAC3B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA,EACvB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,UAAU,CAAA;AAAA,EACpB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,QAAQ,CAAA;AAAA;AAAA,EAGlB,CAAA,CAAE,QAAQ,kBAAkB,CAAA;AAAA,EAC5B,CAAA,CAAE,QAAQ,aAAa,CAAA;AAAA;AAAA,EAGvB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA,EAC1B,CAAA,CAAE,QAAQ,eAAe,CAAA;AAAA;AAAA,EAGzB,CAAA,CAAE,QAAQ,SAAS,CAAA;AAAA,EACnB,CAAA,CAAE,QAAQ,eAAe,CAAA;AAAA,EACzB,CAAA,CAAE,QAAQ,cAAc,CAAA;AAAA,EACxB,CAAA,CAAE,QAAQ,gBAAgB,CAAA;AAAA;AAAA,EAG1B,CAAA,CAAE,QAAQ,eAAe;AAC3B;AAEO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO,EAAE,SAAS,IAAA,EAAK;AACzB;AAYO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA;AAAA,IACT,MAAA,EAAQ;AAAA,GACV;AACF;AAEO,SAAS,4BAAA,GAAiD;AAC/D,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA;AAAA,IACT,MAAA,EAAQ;AAAA,GACV;AACF;AAEO,SAAS,0BAAA,CACd,QACA,OAAA,EACkB;AAClB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,IAAA;AAAA,IACT,MAAA;AAAA,IACA;AAAA,GACF;AACF;AC5I0B,iBAAA;AAsGnB,IAAM,gBAAA,GACX,uBAAA;;;AC6RK,IAAM,iBAAA,GAAoB;AAAA,EAC/B,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,EAChC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ;AAChC,CAAA;ACjYA,eAAe,0BAAA,CACb,GAAA,EACA,YAAA,EACA,QAAA,EACe;AACf,EAAA,4BAAA,CAA6B,cAAc,QAAQ,CAAA;AACnD,EAAA,MAAM,OAAO,MAAM,GAAA,CAAI,EAAA,CACpB,KAAA,CAAM,gBAAgB,CAAA,CACtB,SAAA,CAAU,aAAA,EAAe,CAAC,MAAW,CAAA,CAAE,EAAA,CAAG,YAAY,QAAQ,CAAC,EAC/D,KAAA,EAAM;AACT,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,CAAA,4DAAA,EAA+D,YAAY,CAAA,gEAAA,EAAmE,QAAQ,CAAA,6BAAA;AAAA,KACxJ;AAAA,EACF;AACF;AAEA,eAAsB,mBAAA,CACpB,KACA,GAAA,EAC+B;AAC/B,EAAA,oBAAA,CAAqB,gBAAA,EAAkB,IAAI,QAAQ,CAAA;AAGnD,EAAA,2BAAA,CAA4B,IAAI,QAAQ,CAAA;AAGxC,EAAA,IAAI,CAAC,GAAA,CAAI,UAAA,IAAc,OAAO,GAAA,CAAI,eAAe,QAAA,EAAU;AACzD,IAAA,MAAM,IAAI,KAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AACA,EAAA,IAAI,CAAC,GAAA,CAAI,QAAA,IAAY,OAAO,GAAA,CAAI,aAAa,QAAA,EAAU;AACrD,IAAA,MAAM,IAAI,KAAA;AAAA,MACR;AAAA,KACF;AAAA,EACF;AAOA,EAAA,MAAM,0BAAA,CAA2B,GAAA,EAAK,YAAA,EAAc,GAAA,CAAI,UAAU,CAAA;AAClE,EAAA,MAAM,0BAAA,CAA2B,GAAA,EAAK,UAAA,EAAY,GAAA,CAAI,QAAQ,CAAA;AAG9D,EAAA,IAAI,IAAI,YAAA,IAAgB,GAAA,CAAI,UAAA,IAAc,GAAA,CAAI,aAAa,gBAAA,EAAkB;AAC3E,IAAA,uBAAA;AAAA,MACE,kBAAA;AAAA,MACA,GAAA,CAAI,QAAA;AAAA,MACJ;AAAA,QACE,IAAA,EAAM,gBAAA;AAAA,QACN,QAAQ,GAAA,CAAI,UAAA;AAAA,QACZ,UAAU,GAAA,CAAI;AAAA,OAChB;AAAA,MACA;AAAA,QACE,IAAA,EAAM,gBAAA;AAAA,QACN,QAAQ,GAAA,CAAI,QAAA;AAAA,QACZ,UAAU,GAAA,CAAI;AAAA;AAChB,KACF;AAAA,EACF;AAEA,EAAA,OAAO,GAAA,CAAI,EAAA,CAAG,MAAA,CAAO,gBAAA,EAAkB,GAAG,CAAA;AAC5C;;;AC3EO,IAAM,qBAAqB,gBAAA,CAAiB;AAAA,EACjD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,YAAA,EAAcA,EAAE,MAAA,EAAO;AAAA,IACvB,UAAA,EAAYA,EAAE,MAAA,EAAO;AAAA,IACrB,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,MAAA,EAAQA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC7B,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,cAAA,EAAgBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACrC,SAAA,EAAWA,EAAE,MAAA,EAAO;AAAA,IACpB,GAAG,iBAAA;AAAA,IACH,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAChC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACnC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACtC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,aAAA,EAAeA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACpC,SAAA,EAAWA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAChC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAAS,0BAA0B,CAAA;AAAA,IACnD,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAAS,0BAA0B;AAAA,GACxD;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,YAAY,CAAC,EACnE,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,0DAAA,EAA6D,KAAK,YAAY,CAAA;AAAA,OAChF;AACA,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,SAAS,MAAM,GAAA,CAAI,GACtB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,UAAU,CAAC,EACjE,KAAA,EAAM;AAET,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,QAAA,EAAU;AACZ,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,kCAAA,EAAqC,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AAChE,MAAA,OAAO,0BAAA,CAA2B,QAAA,CAAS,GAAA,EAAK,IAAI,CAAA;AAAA,IACtD;AAEA,IAAA,IAAI,CAAC,MAAA,EAAQ;AACX,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,sDAAA,EAAyD,KAAK,UAAU,CAAA,OAAA,EAAU,KAAK,QAAQ,CAAA,MAAA,EAAS,KAAK,QAAQ,CAAA,CAAA;AAAA,OACvH;AACA,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAAA,GAAS,MAAM,mBAAA,CAAoB,GAAA,EAAK;AAAA,MAC5C,UAAU,IAAA,CAAK,QAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAKf,YAAY,QAAA,CAAS,QAAA;AAAA,MACrB,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,gBAAgB,IAAA,CAAK,YAAA;AAAA,MACrB,gBAAgB,IAAA,CAAK,UAAA;AAAA;AAAA,MAErB,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,gBAAgB,IAAA,CAAK,cAAA;AAAA,MACrB,YAAY,IAAA,CAAK,UAAA;AAAA,MAKjB,aAAa,IAAA,CAAK,WAAA;AAAA,MAClB,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,cAAc,IAAA,CAAK,YAAA;AAAA,MACnB,iBAAiB,IAAA,CAAK,eAAA;AAAA,MACtB,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,SAAA,EAAW,GAAA;AAAA,MACX,SAAA,EAAW,GAAA;AAAA,MACX,SAAS,IAAA,CAAK,SAAA;AAAA,MACd,WAAW,IAAA,CAAK,SAAA;AAAA,MAOhB,SAAS,IAAA,CAAK,OAAA;AAAA,MAOd,cAAc,IAAA,CAAK,YAAA;AAAA,MACnB,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,iBAAiB,IAAA,CAAK,eAAA;AAAA,MAYtB,aAAa,IAAA,CAAK,WAAA;AAAA,MAOlB,eAAe,IAAA,CAAK,aAAA;AAAA,MAMpB,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,YAAY,IAAA,CAAK;AAAA,KAClB,CAAA;AAED,IAAA,OAAA,CAAQ,GAAA;AAAA,MACN,CAAA,sCAAA,EAAyC,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK,KAAK,QAAQ,CAAA,CAAA;AAAA,KAC1E;AACA,IAAA,OAAO,0BAAA,CAA2B,QAAQ,KAAK,CAAA;AAAA,EACjD;AACF,CAAC;AAMM,IAAM,uBAAuB,gBAAA,CAAiB;AAAA,EACnD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA;AAAO,GACrB;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA;AAChC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,uCAAA,EAA0C,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AACrE,IAAA,OAAO,4BAAA,EAA6B;AAAA,EACtC;AACF,CAAC;AAMM,IAAM,qBAAqB,gBAAA,CAAiB;AAAA,EACjD,IAAA,EAAM;AAAA,IACJ,QAAA,EAAUA,EAAE,MAAA,EAAO;AAAA,IACnB,MAAA,EAAQA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC7B,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,OAAA,EAASA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAC9B,cAAA,EAAgBA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACrC,UAAA,EAAYA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IACjC,WAAA,EAAaA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,QAAQ,CAAA;AAAA,IAClC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,QAAA,EAAUA,CAAAA,CAAE,QAAA,CAASA,CAAAA,CAAE,SAAS,CAAA;AAAA,IAChC,YAAA,EAAcA,CAAAA,CAAE,QAAA,CAAS,0BAA0B,CAAA;AAAA,IACnD,eAAA,EAAiBA,CAAAA,CAAE,QAAA,CAAS,0BAA0B;AAAA,GACxD;AAAA,EACA,OAAA,EAAS,gBAAA;AAAA,EACT,OAAA,EAAS,OAAO,GAAA,EAAK,IAAA,KAAS;AAC5B,IAAA,MAAM,WAAW,MAAM,GAAA,CAAI,GACxB,KAAA,CAAM,gBAAgB,EACtB,SAAA,CAAU,aAAA,EAAe,CAAC,CAAA,KAAM,EAAE,EAAA,CAAG,UAAA,EAAY,KAAK,QAAQ,CAAC,EAC/D,KAAA,EAAM;AAET,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,OAAO,4BAAA,EAA6B;AAAA,IACtC;AAEA,IAAA,MAAM,OAAA,GAAmC;AAAA,MACvC,SAAA,EAAW,KAAK,GAAA;AAAI,KACtB;AAEA,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,EAAW;AAC7B,MAAA,OAAA,CAAQ,SAAS,IAAA,CAAK,MAAA;AAAA,IACxB;AACA,IAAA,IAAI,IAAA,CAAK,eAAe,MAAA,EAAW;AACjC,MAAA,OAAA,CAAQ,aAAa,IAAA,CAAK,UAAA;AAAA,IAC5B;AACA,IAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW;AAC9B,MAAA,OAAA,CAAQ,UAAU,IAAA,CAAK,OAAA;AAAA,IACzB;AACA,IAAA,IAAI,IAAA,CAAK,mBAAmB,MAAA,EAAW;AACrC,MAAA,OAAA,CAAQ,iBAAiB,IAAA,CAAK,cAAA;AAAA,IAChC;AACA,IAAA,IAAI,IAAA,CAAK,eAAe,MAAA,EAAW;AACjC,MAAA,OAAA,CAAQ,aAAa,IAAA,CAAK,UAAA;AAAA,IAC5B;AACA,IAAA,IAAI,IAAA,CAAK,gBAAgB,MAAA,EAAW;AAClC,MAAA,OAAA,CAAQ,cAAc,IAAA,CAAK,WAAA;AAAA,IAC7B;AACA,IAAA,IAAI,IAAA,CAAK,aAAa,MAAA,EAAW;AAC/B,MAAA,OAAA,CAAQ,WAAW,IAAA,CAAK,QAAA;AAAA,IAC1B;AACA,IAAA,IAAI,IAAA,CAAK,aAAa,MAAA,EAAW;AAC/B,MAAA,OAAA,CAAQ,WAAW,IAAA,CAAK,QAAA;AAAA,IAC1B;AACA,IAAA,IAAI,IAAA,CAAK,iBAAiB,MAAA,EAAW;AACnC,MAAA,OAAA,CAAQ,eAAe,IAAA,CAAK,YAAA;AAAA,IAC9B;AACA,IAAA,IAAI,IAAA,CAAK,oBAAoB,MAAA,EAAW;AACtC,MAAA,OAAA,CAAQ,kBAAkB,IAAA,CAAK,eAAA;AAAA,IACjC;AAEA,IAAA,MAAM,GAAA,CAAI,EAAA,CAAG,KAAA,CAAM,QAAA,CAAS,KAAK,OAAO,CAAA;AACxC,IAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,qCAAA,EAAwC,IAAA,CAAK,QAAQ,CAAA,CAAE,CAAA;AAEnE,IAAA,OAAO,4BAAA,EAA6B;AAAA,EACtC;AACF,CAAC","file":"epistemicEdges.handlers.js","sourcesContent":["/**\n * Shared validators and private helpers for epistemic edge operations.\n */\n\nimport { v } from \"convex/values\";\nimport type {\n  EdgeStatusResult,\n  SubjectiveOpinionDocument,\n  WorkspaceEdgeScope,\n  WorkspaceScopedEdge,\n} from \"./epistemicEdges.types\";\nimport type { Id, QueryCtx } from \"./convex\";\n\ntype TopicIndexQuery = {\n  eq(field: string, value: unknown): TopicIndexQuery;\n};\n\nexport const epistemicLayerValidator = v.union(\n  v.literal(\"L4\"),\n  v.literal(\"L3\"),\n  v.literal(\"L2\"),\n  v.literal(\"L1\"),\n  v.literal(\"ontological\"),\n  v.literal(\"organizational\"),\n);\n\nexport const subjectiveOpinionValidator = v.object({\n  b: v.number(),\n  d: v.number(),\n  u: v.number(),\n  a: v.number(),\n} satisfies Record<keyof SubjectiveOpinionDocument, unknown>);\n\nexport const edgeTypeValidator = v.union(\n  // --- L4 Decision Edges (Phase 2A) ---\n  v.literal(\"based_on_belief\"),\n  v.literal(\"based_on_question\"),\n  v.literal(\"blocked_by_contradiction\"),\n  v.literal(\"informed_by_theme\"),\n\n  // --- Evidence Flow (L2 → L3, L2 → L1) ---\n  v.literal(\"derived_from\"),\n  v.literal(\"responds_to\"),\n  v.literal(\"informs\"),\n  v.literal(\"tests\"),\n  v.literal(\"explores\"),\n  v.literal(\"qualifies\"),\n\n  // --- Synthesis (L2 → L2, L2 → L1) ---\n  // \"based_on\" removed — use \"derived_from\" instead\n\n  // --- Theme Relationships (L3 → L3) ---\n  v.literal(\"relates_to_thesis\"),\n  v.literal(\"belongs_to\"),\n  v.literal(\"plays_theme\"),\n  v.literal(\"scoped_by\"),\n\n  // --- Deal/Company ---\n  v.literal(\"evaluates\"),\n\n  // --- People (ontological → ontological, ontological → L3) ---\n  v.literal(\"perspective_on\"),\n  v.literal(\"works_at\"),\n  v.literal(\"mentioned_in\"),\n  v.literal(\"founded_by\"),\n\n  // --- Value Chain (ontological → ontological) ---\n  v.literal(\"participates_in\"),\n  v.literal(\"performs\"),\n  v.literal(\"function_in\"),\n  v.literal(\"impacts\"),\n\n  // --- Investment (ontological → ontological) ---\n  v.literal(\"invested_in\"),\n  v.literal(\"raised_from\"),\n\n  // --- Lifecycle (same layer only) ---\n  v.literal(\"supersedes\"),\n  v.literal(\"same_as\"),\n\n  // --- Same-Type Relationships: Belief ↔ Belief (L3 → L3) ---\n  v.literal(\"depends_on\"),\n  v.literal(\"supports\"),\n  v.literal(\"contains\"),\n\n  // --- Belief Cluster Mapping (L3 → L3) ---\n  v.literal(\"counterfactual_of\"),\n  v.literal(\"cascade_to\"),\n  v.literal(\"cascade_from\"),\n  v.literal(\"mutually_exclusive\"),\n  v.literal(\"correlates_with\"),\n  v.literal(\"amplifies\"),\n  v.literal(\"precondition_for\"),\n  v.literal(\"in_tension_with\"),\n\n  // --- Belief ↔ Belief: Epistemic Impact (Confidence Propagation) ---\n  v.literal(\"falsified_by\"),\n  v.literal(\"exclusive_with\"),\n  v.literal(\"contradicts\"),\n  v.literal(\"collapses_if\"),\n  v.literal(\"strengthened_by\"),\n  v.literal(\"weakened_by\"),\n  v.literal(\"alternative_to\"),\n  v.literal(\"subsumes\"),\n  v.literal(\"validated_by\"),\n  v.literal(\"required_for\"),\n  v.literal(\"blocks\"),\n\n  // --- Same-Type Relationships: Question ↔ Question (L3 → L3) ---\n  v.literal(\"prerequisite_for\"),\n  v.literal(\"parallel_to\"),\n\n  // --- Same-Type Relationships: Evidence ↔ Evidence (L2 → L2) ---\n  v.literal(\"corroborates\"),\n  v.literal(\"extends\"),\n  v.literal(\"same_source_as\"),\n  v.literal(\"same_theme_as\"),\n\n  // --- NEW: Deep Epistemic Analysis Edges (Phase: Schema Upgrade) ---\n  v.literal(\"assumes\"),\n  v.literal(\"would_predict\"),\n  v.literal(\"analogous_to\"),\n  v.literal(\"independent_of\"),\n\n  // --- Entity↔Belief Bridge (OE-B) ---\n  v.literal(\"competes_with\"),\n);\n\nexport function buildEdgeStatusSuccessResult(): EdgeStatusResult {\n  return { success: true };\n}\n\nexport function buildEdgeNotFoundResult(): EdgeStatusResult {\n  const result = {} as Extract<\n    EdgeStatusResult,\n    { success: false; error: \"Edge not found\" }\n  >;\n  result.success = false;\n  result.error = \"Edge not found\";\n  return result;\n}\n\nexport function buildEdgeMirrorSkippedResult(): EdgeStatusResult {\n  return {\n    success: false,\n    reason: \"source_not_in_convex\",\n  };\n}\n\nexport function buildEdgeMirrorMissingResult(): EdgeStatusResult {\n  return {\n    success: false,\n    reason: \"not_found\",\n  };\n}\n\nexport function buildEdgeMirrorWriteResult(\n  edgeId: Id<\"epistemicEdges\">,\n  existed: boolean,\n): EdgeStatusResult {\n  return {\n    success: true,\n    edgeId,\n    existed,\n  };\n}\n\nexport function edgeMatchesWorkspaceReasoningScope(\n  edge: Pick<WorkspaceScopedEdge, \"topicId\" | \"projectId\">,\n  scope: WorkspaceEdgeScope,\n): boolean {\n  return (\n    (scope.topicId !== undefined && edge.topicId === scope.topicId) ||\n    (scope.projectId !== undefined && edge.projectId === scope.projectId)\n  );\n}\n\nexport async function collectScopedEdges(\n  ctx: QueryCtx,\n  scope: WorkspaceEdgeScope,\n  scanLimit: number,\n): Promise<WorkspaceScopedEdge[]> {\n  const queries: Promise<WorkspaceScopedEdge[]>[] = [];\n\n  if (scope.topicId) {\n    queries.push(\n      ctx.db\n        .query(\"epistemicEdges\")\n        .withIndex(\"by_topic\", (q: TopicIndexQuery) =>\n          q.eq(\"topicId\", scope.topicId),\n        )\n        .order(\"desc\")\n        .take(scanLimit) as Promise<WorkspaceScopedEdge[]>,\n    );\n  }\n\n  // Kernel v2: also check edges scoped to projectId (many edges still have\n  // topicId=s97 scope while UI passes projectId=n97). Query both to catch all.\n  if (scope.projectId) {\n    queries.push(\n      ctx.db\n        .query(\"epistemicEdges\")\n        .withIndex(\"by_topic\", (q: TopicIndexQuery) =>\n          q.eq(\"topicId\", scope.projectId),\n        )\n        .order(\"desc\")\n        .take(scanLimit) as Promise<WorkspaceScopedEdge[]>,\n    );\n  }\n\n  const seen = new Set<string>();\n  const deduped: WorkspaceScopedEdge[] = [];\n\n  const flattened = (await Promise.all(queries)).flat();\n  for (const edge of flattened) {\n    const key = String(edge._id);\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    deduped.push(edge);\n  }\n\n  return deduped;\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\n// TODO(FR.11-structural): `api`/`internal`/`components` are `anyApi as any`\n// because this module source tree is bundled into the kernel host at deploy time\n// and has NO top-level Convex `_generated/` directory to import a typed surface\n// from. Every `api.*` / `internal.*` / string-literal cross-component ref in this\n// module (topicScope.ts, topicProjectOverlay.ts, questionEvidenceLinks.ts,\n// beliefEvidenceLinks*.ts, epistemicQuestions.helpers.ts) inherits `any` from\n// here. The fix is structural — generate a per-module typed surface or a shared\n// typed function-reference manifest (template: the typed `components.controlPlane`\n// in modules/control-plane/src/component/convex.ts and the\n// `KERNEL_API_REF_MANIFEST` pattern in packages/server-core/src/kernelApi.ts) —\n// owned by the FR.11 closing/synthesis pass, not a mechanical swap.\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","/** Topic-scope resolution helpers for graph-primitive operations. */\nimport { v } from \"convex/values\";\nimport { api as appApi } from \"./convex\";\nimport type { Id } from \"./convex\";\nimport { debugGraphPrimitiveFallback } from \"./debug\";\n\nconst LEGACY_SCOPE_FIELD = \"graphScope\" + \"ProjectId\";\n\ntype TopicDoc = Record<string, unknown> & {\n  _id: Id<\"topics\">;\n  globalId?: string;\n  name?: string;\n  depth?: number;\n  createdAt?: number;\n  parentTopicId?: Id<\"topics\">;\n  tenantId?: string;\n  workspaceId?: string;\n  metadata?: Record<string, unknown>;\n};\n\nexport type TopicProjectScope = {\n  topicId: Id<\"topics\">;\n  projectId?: string;\n  tenantId?: string;\n  workspaceId?: string;\n  source:\n    | \"topic\"\n    | \"project_mapped_topic\"\n    | \"topic_inferred\"\n    | \"topic_node\";\n};\n\n/**\n * RR.5 (legacy topics-table retirement) — graph-primitives mirror of the\n * kernel's epistemicNodes-first topic-scope fallback. Kept in lockstep with\n * `packages/reasoning-kernel/src/adapters/lib/topicScope.ts`\n * (`tests/unit/convex/topic-scope-fallbacks.test.ts` asserts parity).\n *\n * Resolves a topic that exists only as `epistemicNodes(nodeType=\"topic\")` —\n * the write-of-record — when no legacy `topics` row backs the ref, returning the\n * node's `topicId` self-key so scoped beliefs/evidence/questions stay reachable.\n * See the kernel module for the full silent-empty-result rationale.\n */\ntype TopicNodeScopeDoc = {\n  _id: string | Id<\"epistemicNodes\">;\n  globalId?: string;\n  nodeType?: string;\n  topicId?: string;\n  metadata?: Record<string, unknown>;\n};\n\nasync function resolveTopicNodeScopeOrNull(\n  ctx: any,\n  ref: string,\n): Promise<TopicProjectScope | null> {\n  if (!ctx?.db || typeof ctx.db.query !== \"function\") {\n    return null;\n  }\n\n  let node: TopicNodeScopeDoc | null = null;\n\n  // 1. The ref IS the topic node's UUIDv7 globalId.\n  try {\n    const byGlobalId = (await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q: any) => q.eq(\"globalId\", ref))\n      .first()) as TopicNodeScopeDoc | null;\n    if (byGlobalId && byGlobalId.nodeType === \"topic\") {\n      node = byGlobalId;\n    }\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] topic-node scope lookup by globalId failed\",\n      { error, ref },\n    );\n  }\n\n  if (!node) {\n    return null;\n  }\n\n  const scopeKey =\n    normalizeScopeValue(node.topicId) ?? normalizeScopeValue(node.globalId);\n  if (!scopeKey) {\n    return null;\n  }\n\n  return {\n    topicId: scopeKey as Id<\"topics\">,\n    projectId: asMappedProjectId(node as unknown as TopicDoc),\n    source: \"topic_node\",\n  };\n}\n\ntype MaterializedTopicNodeDoc = {\n  _id: string | Id<\"epistemicNodes\">;\n  metadata?: Record<string, unknown>;\n};\n\nfunction asMappedProjectId(\n  topic: TopicDoc | null | undefined,\n): string | undefined {\n  if (!topic) {\n    return;\n  }\n  const directLegacyProjectId = normalizeScopeValue(topic[LEGACY_SCOPE_FIELD]);\n  if (directLegacyProjectId) {\n    return directLegacyProjectId;\n  }\n  const metadata = (topic.metadata || {}) as Record<string, unknown>;\n  const candidate =\n    (metadata[LEGACY_SCOPE_FIELD] as string | undefined) ||\n    (metadata.legacyProjectId as string | undefined) ||\n    (metadata.projectId as string | undefined) ||\n    (metadata.scopeProjectId as string | undefined);\n  return candidate ? (candidate as string) : undefined;\n}\n\nfunction normalizeScopeValue(value: unknown): string | undefined {\n  if (typeof value !== \"string\") {\n    return;\n  }\n  const normalized = value.trim();\n  return normalized.length > 0 ? normalized : undefined;\n}\n\nfunction pickPrimaryTopic(candidates: TopicDoc[]): TopicDoc | undefined {\n  return [...candidates].sort((a, b) => {\n    const depthA = a.depth ?? 9999;\n    const depthB = b.depth ?? 9999;\n    if (depthA !== depthB) {\n      return depthA - depthB;\n    }\n    const createdA = a.createdAt ?? Number.MAX_SAFE_INTEGER;\n    const createdB = b.createdAt ?? Number.MAX_SAFE_INTEGER;\n    if (createdA !== createdB) {\n      return createdA - createdB;\n    }\n    return String(a.name || \"\").localeCompare(String(b.name || \"\"));\n  })[0];\n}\n\nasync function findTopicsByScopeAlias(\n  ctx: any,\n  scopeId: string,\n): Promise<TopicDoc[]> {\n  try {\n    return (await ctx.db\n      .query(\"topics\")\n      .withIndex(\"by_graph_scope_project\", (q: any) =>\n        q.eq(LEGACY_SCOPE_FIELD, scopeId),\n      )\n      .collect()) as TopicDoc[];\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve scope alias via index\",\n      {\n        error,\n        scopeId,\n      },\n    );\n    // Older Lucern dev deployments can lag index backfills while still carrying\n    // the underlying topics table. Scan and filter so scope resolution keeps\n    // working during the rollout.\n    const topics = (await ctx.db.query(\"topics\").collect()) as TopicDoc[];\n    return topics.filter((topic) => {\n      const normalizedGlobalId = normalizeScopeValue(topic.globalId);\n      const mappedProjectId = asMappedProjectId(topic);\n      return (\n        String(topic._id) === scopeId ||\n        normalizedGlobalId === scopeId ||\n        mappedProjectId === scopeId\n      );\n    });\n  }\n}\n\nasync function tryResolveHostTopicById(\n  ctx: any,\n  topicId: string,\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.get as any, {\n      id: topicId,\n    })) ?? null) as TopicDoc | null;\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve topic by host query\",\n      {\n        error,\n        topicId,\n      },\n    );\n    return null;\n  }\n}\n\nasync function tryResolveHostTopicByLegacyScope(\n  ctx: any,\n  legacyScopeId: string,\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.getByLegacyScopeId as any, {\n      projectId: legacyScopeId,\n    })) ?? null) as TopicDoc | null;\n  } catch (error) {\n    debugGraphPrimitiveFallback(\n      \"[topicScope] Failed to resolve topic by legacy scope\",\n      {\n        error,\n        legacyScopeId,\n      },\n    );\n    return null;\n  }\n}\n\nexport function readMaterializedTopicTableId(\n  topicNode: MaterializedTopicNodeDoc | null | undefined,\n): string | undefined {\n  if (!topicNode) {\n    return;\n  }\n\n  const metadata = (topicNode.metadata || {}) as Record<string, unknown>;\n  const topicTableId =\n    (metadata.topicTableId as string | undefined) ||\n    (metadata.topicId as string | undefined);\n\n  return typeof topicTableId === \"string\" && topicTableId.trim().length > 0\n    ? topicTableId.trim()\n    : undefined;\n}\n\n/**\n * Walk the topic parent chain to find inherited workspaceId and tenantId.\n * Mirrors the pattern used by resolveTopicOntology for ontologyId inheritance.\n * Max depth: 10 (defensive limit against pathological nesting).\n */\nasync function resolveInheritedWorkspaceScope(\n  ctx: any,\n  topic: TopicDoc,\n): Promise<{ tenantId?: string; workspaceId?: string }> {\n  const MAX_DEPTH = 10;\n  let tenantId = normalizeScopeValue(topic.tenantId);\n  let workspaceId = normalizeScopeValue(topic.workspaceId);\n\n  if (tenantId && workspaceId) {\n    return { tenantId, workspaceId };\n  }\n\n  let current: TopicDoc | null = topic;\n  for (let i = 0; i < MAX_DEPTH && current?.parentTopicId; i++) {\n    current = (await ctx.db.get(current.parentTopicId)) as TopicDoc | null;\n    if (!current) break;\n\n    if (!tenantId) {\n      tenantId = normalizeScopeValue(current.tenantId);\n    }\n    if (!workspaceId) {\n      workspaceId = normalizeScopeValue(current.workspaceId);\n    }\n    if (tenantId && workspaceId) break;\n  }\n\n  return { tenantId, workspaceId };\n}\n\nexport async function resolveTopicProjectScope(\n  ctx: any,\n  args: { topicId?: Id<\"topics\"> | string; projectId?: string },\n): Promise<TopicProjectScope> {\n  if (args.topicId) {\n    // Try direct lookup, fall back to the legacy mapped-project bridge\n    let topic: TopicDoc | null = null;\n    try {\n      topic = (await ctx.db.get(\n        args.topicId as Id<\"topics\">,\n      )) as TopicDoc | null;\n    } catch (error) {\n      debugGraphPrimitiveFallback(\n        \"[topicScope] Failed to load topic by direct id\",\n        {\n          error,\n          topicId: args.topicId,\n        },\n      );\n      // Not a valid topics table ID\n    }\n    if (!topic) {\n      topic = await tryResolveHostTopicById(ctx, String(args.topicId));\n    }\n    if (!topic) {\n      // Try as legacy projectId / globalId via the mapped-project bridge.\n      topic =\n        pickPrimaryTopic(\n          await findTopicsByScopeAlias(ctx, String(args.topicId)),\n        ) ?? null;\n    }\n    if (!topic) {\n      // RR.5: no legacy topics row — resolve the canonical topic node store\n      // before throwing (silent-empty-result fix).\n      const nodeScope = await resolveTopicNodeScopeOrNull(\n        ctx,\n        String(args.topicId),\n      );\n      if (nodeScope) {\n        return nodeScope;\n      }\n      throw new Error(`Topic not found: ${String(args.topicId)}`);\n    }\n    const inherited = await resolveInheritedWorkspaceScope(ctx, topic);\n    const mapped = asMappedProjectId(topic);\n    if (mapped) {\n      return {\n        topicId: topic._id,\n        projectId: mapped,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic\",\n      };\n    }\n    return {\n      topicId: topic._id,\n      tenantId: inherited.tenantId,\n      workspaceId: inherited.workspaceId,\n      source: \"topic\",\n    };\n  }\n\n  if (args.projectId) {\n    let directTopic: TopicDoc | null = null;\n    try {\n      directTopic = (await ctx.db.get(\n        args.projectId as Id<\"topics\">,\n      )) as TopicDoc | null;\n    } catch (error) {\n      debugGraphPrimitiveFallback(\n        \"[topicScope] Failed to load direct project topic\",\n        {\n          error,\n          projectId: args.projectId,\n        },\n      );\n      // Not a valid topics table ID, continue to legacy graph-scope lookup.\n    }\n\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    directTopic = await tryResolveHostTopicByLegacyScope(ctx, args.projectId);\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    const topics = await findTopicsByScopeAlias(ctx, args.projectId);\n    const primary = pickPrimaryTopic(topics);\n    if (primary) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, primary);\n      return {\n        topicId: primary._id,\n        projectId: args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"project_mapped_topic\",\n      };\n    }\n    // RR.5: try the canonical topic node store before failing.\n    const nodeScope = await resolveTopicNodeScopeOrNull(\n      ctx,\n      String(args.projectId),\n    );\n    if (nodeScope) {\n      return {\n        ...nodeScope,\n        projectId: nodeScope.projectId ?? String(args.projectId),\n      };\n    }\n\n    throw new Error(\n      `Legacy project scope ${String(args.projectId)} has no mapped topic.`,\n    );\n  }\n\n  throw new Error(\n    \"Missing scope: provide topicId (preferred) or legacy projectId alias.\",\n  );\n}\n\n/** Shared scope args for graph-primitive functions. topicId is canonical; projectId is a legacy alias. */\nexport const optionalScopeArgs = {\n  projectId: v.optional(v.string()),\n  topicId: v.optional(v.string()),\n} as const;\n","import type { WithoutSystemFields } from \"convex/server\";\nimport {\n  assertUuidV7Identity,\n  assertStorageEdgeVocabulary,\n  assertUuidShapedEdgeEndpoint,\n} from \"@lucern/contracts/ids\";\nimport {\n  assertEdgePolicyAllowed,\n  edgePolicyManifest,\n  type EpistemicNodeType,\n} from \"@lucern/contracts\";\nimport type { Doc, Id, MutationCtx } from \"./convex\";\n\nexport async function insertEpistemicNode(\n  ctx: MutationCtx,\n  doc: WithoutSystemFields<Doc<\"epistemicNodes\">>,\n): Promise<Id<\"epistemicNodes\">> {\n  assertUuidV7Identity(\"epistemicNodes\", doc.globalId);\n  return ctx.db.insert(\"epistemicNodes\", doc);\n}\n\n/**\n * C2-RR.4b — REFERENTIAL edge-endpoint canonicality (amends RR.4's FORMAT guard).\n *\n * Proves an endpoint is the `globalId` of an EXISTING `epistemicNodes` row, not\n * that it has a v7 shape. Refuses doc-ids and fabricated/unknown endpoints while\n * keeping legacy v4-`globalId` nodes (the established prod corpus) linkable.\n * SHAPE pre-filter accepts both v4 and v7; the indexed `by_globalId` lookup is\n * the referential authority (no full scan). v7-format stays enforced only at new\n * identity minting (`assertUuidV7Identity`). See c2-rr4b-endpoint-referential.\n */\nasync function assertExistingNodeEndpoint(\n  ctx: MutationCtx,\n  endpointRole: \"fromNodeId\" | \"toNodeId\",\n  endpoint: string,\n): Promise<void> {\n  assertUuidShapedEdgeEndpoint(endpointRole, endpoint);\n  const node = await ctx.db\n    .query(\"epistemicNodes\")\n    .withIndex(\"by_globalId\", (q: any) => q.eq(\"globalId\", endpoint))\n    .first();\n  if (!node) {\n    throw new Error(\n      `edge_endpoint_not_canonical: epistemicEdges insert requires ${endpointRole} to be the globalId of an existing epistemicNodes row, received ${endpoint} (no node with that globalId)`,\n    );\n  }\n}\n\nexport async function insertEpistemicEdge(\n  ctx: MutationCtx,\n  doc: WithoutSystemFields<Doc<\"epistemicEdges\">>,\n): Promise<Id<\"epistemicEdges\">> {\n  assertUuidV7Identity(\"epistemicEdges\", doc.globalId);\n\n  // R1.1a — STORAGE-VOCABULARY MEMBERSHIP\n  assertStorageEdgeVocabulary(doc.edgeType);\n\n  // R1.1b — ENDPOINT PRESENCE\n  if (!doc.fromNodeId || typeof doc.fromNodeId !== \"string\") {\n    throw new Error(\n      \"edge_endpoint_missing: epistemicEdges insert requires a non-empty fromNodeId\"\n    );\n  }\n  if (!doc.toNodeId || typeof doc.toNodeId !== \"string\") {\n    throw new Error(\n      \"edge_endpoint_missing: epistemicEdges insert requires a non-empty toNodeId\"\n    );\n  }\n\n  // C2-RR.4b Defect E (REFERENTIAL) — ENDPOINT CANONICAL IDENTITY. Edge\n  // endpoints must each be the globalId of an EXISTING epistemicNodes row,\n  // never a Convex doc id, a legacy topic id, or a fabricated/unknown uuid.\n  // This refuses the mixed _id/globalId endpoint writes at the floor while\n  // keeping legacy v4-globalId nodes linkable (RR.4b prod-incident cure).\n  await assertExistingNodeEndpoint(ctx, \"fromNodeId\", doc.fromNodeId);\n  await assertExistingNodeEndpoint(ctx, \"toNodeId\", doc.toNodeId);\n\n  // R1.1c — FULL POLICY ASSERT (when nodeTypes are present and edgeType is in public manifest)\n  if (doc.fromNodeType && doc.toNodeType && doc.edgeType !== \"extracted_from\") {\n    assertEdgePolicyAllowed(\n      edgePolicyManifest,\n      doc.edgeType,\n      {\n        kind: \"epistemic_node\",\n        nodeId: doc.fromNodeId,\n        nodeType: doc.fromNodeType as EpistemicNodeType,\n      },\n      {\n        kind: \"epistemic_node\",\n        nodeId: doc.toNodeId,\n        nodeType: doc.toNodeType as EpistemicNodeType,\n      }\n    );\n  }\n\n  return ctx.db.insert(\"epistemicEdges\", doc);\n}\n","/**\n * Internal mutations for Neo4j/Convex dual-write edge mirroring.\n */\n\nimport { v } from \"convex/values\";\nimport { permissiveReturn } from \"@lucern/contracts/schema-helpers/validators\";\nimport {\n  buildEdgeMirrorMissingResult,\n  buildEdgeMirrorSkippedResult,\n  buildEdgeMirrorWriteResult,\n  buildEdgeStatusSuccessResult,\n  subjectiveOpinionValidator,\n} from \"./epistemicEdges.helpers\";\nimport { optionalScopeArgs } from \"./topicScope\";\nimport { internalMutation } from \"./convex\";\nimport { insertEpistemicEdge } from \"./epistemicInsert.js\";\n\n/**\n * Internal mutation to mirror a Neo4j edge to Convex for reactive UI.\n * Called by createEdge action for edge types that need reactive UI updates.\n */\nexport const mirrorEdgeToConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n    fromGlobalId: v.string(),\n    toGlobalId: v.string(),\n    edgeType: v.string(),\n    weight: v.optional(v.number()),\n    confidence: v.optional(v.number()),\n    context: v.optional(v.string()),\n    derivationType: v.optional(v.string()),\n    createdBy: v.string(),\n    ...optionalScopeArgs,\n    fromLayer: v.optional(v.string()),\n    toLayer: v.optional(v.string()),\n    fromNodeType: v.optional(v.string()),\n    toNodeType: v.optional(v.string()),\n    reasoningMethod: v.optional(v.string()),\n    logicalRole: v.optional(v.string()),\n    temporalClass: v.optional(v.string()),\n    validFrom: v.optional(v.number()),\n    validUntil: v.optional(v.number()),\n    constraint: v.optional(v.string()),\n    propagation: v.optional(v.string()),\n    blocking: v.optional(v.boolean()),\n    implicit: v.optional(v.boolean()),\n    conditionalA: v.optional(subjectiveOpinionValidator),\n    conditionalNotA: v.optional(subjectiveOpinionValidator),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const fromNode = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.fromGlobalId))\n      .first();\n\n    if (!fromNode) {\n      console.log(\n        `[Dual-Write] Skipping mirror - source node not in Convex: ${args.fromGlobalId}`,\n      );\n      return buildEdgeMirrorSkippedResult();\n    }\n\n    const toNode = await ctx.db\n      .query(\"epistemicNodes\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.toGlobalId))\n      .first();\n\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (existing) {\n      console.log(`[Dual-Write] Edge already exists: ${args.globalId}`);\n      return buildEdgeMirrorWriteResult(existing._id, true);\n    }\n\n    if (!toNode) {\n      console.log(\n        `[Dual-Write] Skipping mirror - to-node not in Convex: ${args.toGlobalId} (edge ${args.globalId} type ${args.edgeType})`\n      );\n      return buildEdgeMirrorSkippedResult();\n    }\n\n    const now = Date.now();\n    const edgeId = await insertEpistemicEdge(ctx, {\n      globalId: args.globalId,\n      // C2-RR.4 Defect E — endpoints are canonical node globalIds, not Convex\n      // doc ids. fromNode/toNode are resolved by_globalId above, so their\n      // stored globalId equals args.from/toGlobalId; persisting the doc _id here\n      // was the \"mixed _id/globalId\" defect.\n      fromNodeId: fromNode.globalId,\n      toNodeId: toNode.globalId,\n      sourceGlobalId: args.fromGlobalId,\n      targetGlobalId: args.toGlobalId,\n      // Preserve the canonical string value even when the local schema lags.\n      edgeType: args.edgeType as string,\n      weight: args.weight,\n      confidence: args.confidence,\n      context: args.context,\n      derivationType: args.derivationType,\n      constraint: args.constraint as\n        | \"xor\"\n        | \"alternative\"\n        | \"counterfactual\"\n        | undefined,\n      propagation: args.propagation as \"threshold\" | \"continuous\" | undefined,\n      blocking: args.blocking,\n      implicit: args.implicit,\n      conditionalA: args.conditionalA,\n      conditionalNotA: args.conditionalNotA,\n      createdBy: args.createdBy,\n      createdAt: now,\n      updatedAt: now,\n      topicId: args.projectId as string | undefined,\n      fromLayer: args.fromLayer as\n        | \"L4\"\n        | \"L3\"\n        | \"L2\"\n        | \"L1\"\n        | \"ontological\"\n        | undefined,\n      toLayer: args.toLayer as\n        | \"L4\"\n        | \"L3\"\n        | \"L2\"\n        | \"L1\"\n        | \"ontological\"\n        | undefined,\n      fromNodeType: args.fromNodeType,\n      toNodeType: args.toNodeType,\n      reasoningMethod: args.reasoningMethod as\n        | \"deductive\"\n        | \"causal\"\n        | \"inductive\"\n        | \"abductive\"\n        | \"statistical\"\n        | \"analogical\"\n        | \"correlational\"\n        | \"testimonial\"\n        | \"implicit\"\n        | \"pattern_match\"\n        | undefined,\n      logicalRole: args.logicalRole as\n        | \"necessary\"\n        | \"sufficient\"\n        | \"necessary_sufficient\"\n        | \"contributory\"\n        | \"corroborative\"\n        | undefined,\n      temporalClass: args.temporalClass as\n        | \"structural\"\n        | \"cyclical\"\n        | \"transient\"\n        | \"point_in_time\"\n        | undefined,\n      validFrom: args.validFrom,\n      validUntil: args.validUntil,\n    });\n\n    console.log(\n      `[Dual-Write] Mirrored edge to Convex: ${args.globalId} (${args.edgeType})`,\n    );\n    return buildEdgeMirrorWriteResult(edgeId, false);\n  },\n});\n\n/**\n * Internal mutation to delete a mirrored edge from Convex.\n * Called by deleteEdge action to maintain Convex mirror consistency.\n */\nexport const deleteEdgeFromConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (!existing) {\n      return buildEdgeMirrorMissingResult();\n    }\n\n    await ctx.db.delete(existing._id);\n    console.log(`[Dual-Write] Deleted edge from Convex: ${args.globalId}`);\n    return buildEdgeStatusSuccessResult();\n  },\n});\n\n/**\n * Internal mutation to update a mirrored edge in Convex.\n * Called by updateEdge action to maintain Convex mirror consistency.\n */\nexport const updateEdgeInConvex = internalMutation({\n  args: {\n    globalId: v.string(),\n    weight: v.optional(v.number()),\n    confidence: v.optional(v.number()),\n    context: v.optional(v.string()),\n    derivationType: v.optional(v.string()),\n    constraint: v.optional(v.string()),\n    propagation: v.optional(v.string()),\n    blocking: v.optional(v.boolean()),\n    implicit: v.optional(v.boolean()),\n    conditionalA: v.optional(subjectiveOpinionValidator),\n    conditionalNotA: v.optional(subjectiveOpinionValidator),\n  },\n  returns: permissiveReturn,\n  handler: async (ctx, args) => {\n    const existing = await ctx.db\n      .query(\"epistemicEdges\")\n      .withIndex(\"by_globalId\", (q) => q.eq(\"globalId\", args.globalId))\n      .first();\n\n    if (!existing) {\n      return buildEdgeMirrorMissingResult();\n    }\n\n    const updates: Record<string, unknown> = {\n      updatedAt: Date.now(),\n    };\n\n    if (args.weight !== undefined) {\n      updates.weight = args.weight;\n    }\n    if (args.confidence !== undefined) {\n      updates.confidence = args.confidence;\n    }\n    if (args.context !== undefined) {\n      updates.context = args.context;\n    }\n    if (args.derivationType !== undefined) {\n      updates.derivationType = args.derivationType;\n    }\n    if (args.constraint !== undefined) {\n      updates.constraint = args.constraint;\n    }\n    if (args.propagation !== undefined) {\n      updates.propagation = args.propagation;\n    }\n    if (args.blocking !== undefined) {\n      updates.blocking = args.blocking;\n    }\n    if (args.implicit !== undefined) {\n      updates.implicit = args.implicit;\n    }\n    if (args.conditionalA !== undefined) {\n      updates.conditionalA = args.conditionalA;\n    }\n    if (args.conditionalNotA !== undefined) {\n      updates.conditionalNotA = args.conditionalNotA;\n    }\n\n    await ctx.db.patch(existing._id, updates);\n    console.log(`[Dual-Write] Updated edge in Convex: ${args.globalId}`);\n\n    return buildEdgeStatusSuccessResult();\n  },\n});\n"]}