universal-physics-tensor 11.0.0 → 12.0.0

package/dist/composition/probe/problem.js.map

@@ -1 +1 @@
-{"version":3,"file":"problem.js","sourceRoot":"","sources":["../../../src/composition/probe/problem.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AAUzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,yBAAyB,EAAE,MAAM,cAAc,CAAC;AAExE,gGAAgG;AAChG,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,OAAO,CACL,CAAC,KAAK,qBAAqB;QAC3B,CAAC,KAAK,eAAe;QACrB,CAAC,KAAK,mBAAmB;QACzB,CAAC,KAAK,mBAAmB;QACzB,CAAC,KAAK,qBAAqB;QAC3B,CAAC,KAAK,kBAAkB;QACxB,CAAC,KAAK,yBAAyB;QAC/B,CAAC,KAAK,oBAAoB;QAC1B,CAAC,KAAK,kBAAkB;QACxB,CAAC,KAAK,OAAO,CACd,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,eAAe,CAC7B,EAAU,EACV,OAAe,EACf,IAAI,GAAoB,yBAAyB;IAEjD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,UAAU,CAAC,mDAAmD,EAAE,IAAI,CAAC,CAAC;IAClF,CAAC;IACD,IAAI,IAAI,KAAK,eAAe,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QAC7D,MAAM,IAAI,UAAU,CAAC,oBAAoB,IAAI,6CAA6C,CAAC,CAAC;IAC9F,CAAC;IACD,OAAO;QACL,EAAE;QACF,IAAI;QACJ,YAAY,EAAE,EAAE;QAChB,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,EAAE;QACX,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,EAAE;QACf,QAAQ,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE;QACpC,eAAe,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,kBAAkB,CAAC,EAAE;SACjE;QACD,aAAa,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,cAAc,CAAC,EAAE;QAC9D,MAAM,EAAE,YAAY;KACrB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;IACjC,CAAC;CACF;AAED,qFAAqF;AACrF,MAAM,iBAAiB,GAAwB,IAAI,GAAG,CAAC;IACrD,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY;IACjE,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ;CAC3D,CAAC,CAAC;AAEH,kEAAkE;AAClE,SAAS,MAAM,CAAC,CAAU;IACxB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC;IACtC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC;IACzC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,UAAU,CAAC;IAC7C,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IACnD,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,2FAA2F;AAC3F,SAAS,WAAW,CAAC,GAAY,EAAE,KAAa;IAC9C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,+CAA+C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAC1B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,yBAAyB,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACrH,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,wBAAwB,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAClH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;AAChD,CAAC;AAqBD,yFAAyF;AACzF,MAAM,UAAU,yBAAyB,CAAC,IAAY;IACpD,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAgB,CAAC;IAC9C,OAAO,qBAAqB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,GAA0C,EAAE,MAAM,GAAG,QAAQ;IACnG,IAAI,CAAC,GAAG,CAAC,gBAAgB;QAAE,OAAO,IAAI,CAAC;IACvC,OAAO,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,gBAAgB;QACtB,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;AAC3F,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,qBAAqB,CAAC,GAAgB,EAAE,MAAM,GAAG,QAAQ;IACvE,8FAA8F;IAC9F,+EAA+E;IAC/E,MAAM,IAAI,GAAY,GAAG,CAAC;IAC1B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,gBAAgB,CAAC,4EAA4E,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1H,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,kDAAkD,CAAC,CAAC;IAC9G,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,iEAAiE,CAAC,CAAC;IAChI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,gBAAgB,CAAC,oEAAoE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC5H,CAAC;IACD,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,gBAAgB,CAAC,kCAAkC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpF,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAU,EAAE,CAAC;QACvD,MAAM,CAAC,GAAY,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC7C,MAAM,IAAI,gBAAgB,CAAC,OAAO,KAAK,wBAAwB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,IAAI,yBAAyB,CAAC;IAC3D,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,gBAAgB,CAAC,qBAAqB,OAAO,sDAAsD,CAAC,CAAC;IACjH,CAAC;IACD,IAAI,OAAO,KAAK,eAAe,IAAI,OAAO,KAAK,mBAAmB,EAAE,CAAC;QACnE,MAAM,IAAI,gBAAgB,CAAC,aAAa,OAAO,uDAAuD,CAAC,CAAC;IAC1G,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,WAAW,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,gBAAgB,CAAC,WAAW,KAAK,yBAAyB,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,IAAI,uBAAuB,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC;IACjG,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;IACjF,IAAI,WAAqC,CAAC;IAC1C,IAAI,OAAiC,CAAC;IACtC,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,gBAAgB,KAAK,QAAQ,EAAE,CAAC;QACrF,MAAM,IAAI,gBAAgB,CAAC,0CAA0C,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;QAC1D,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;QAChC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;IAC1B,CAAC;IACD,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACpB,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,MAAM,cAAc,EAAE,iBAAiB,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAChB,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,MAAM,UAAU,EAAE,oBAAoB,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IACrF,+EAA+E;IAC/E,+EAA+E;IAC/E,OAAO;QACL,GAAG,OAAO;QACV,QAAQ,EAAE,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC;QAC/F,WAAW,EAAE,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC;QACzG,WAAW,EAAE,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,CAAC;QACzG,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3E,cAAc,EAAE,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,EAAE,gBAAgB,CAAC;QACjH,qBAAqB,EACnB,IAAI,CAAC,qBAAqB,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,EAAE,uBAAuB,CAAC;KACvH,CAAC;AACJ,CAAC;AAED,iDAAiD;AACjD,SAAS,QAAQ,CAAC,GAAY,EAAE,KAAa;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;IACzD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,kCAAkC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9G,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,IAAI,CAAC,yBAAyB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1G,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,0DAA0D;AAC1D,SAAS,UAAU,CAAC,GAAY,EAAE,KAAa;IAC7C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,IAAI,KAAK,iCAAiC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9G,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,IAAI,CAAC,wBAAwB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAY;IACvC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,wEAAwE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5I,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACrE,MAAM,IAAI,gBAAgB,CACxB,qBAAqB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,gCAAgC,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC1G,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,aAAa,EAAE,2BAA2B,CAAC,CAAC;IAC/E,KAAK,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,mBAAmB,CAAU,EAAE,CAAC;QAClE,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC3D,MAAM,IAAI,gBAAgB,CAAC,eAAe,GAAG,wBAAwB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,IAAqC;QAC/C,aAAa;QACb,GAAG,CAAC,OAAO,GAAG,CAAC,aAAa,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,GAAG,CAAC,OAAO,GAAG,CAAC,iBAAiB,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACnG,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,GAAY;IAClC,MAAM,KAAK,GAAG,sCAAsC,CAAC;IACrD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,8BAA8B,KAAK,WAAW,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,aAAa,KAAK,WAAW,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxG,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;QACxG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,wCAAwC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjI,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YACrE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,qCAAqC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACvG,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC5G,CAAC,CAAC,CAAC;AACL,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,GAAwB,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3E,qDAAqD;AACrD,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACrI,0EAA0E;AAC1E,MAAM,eAAe,GAAG,6CAA6C,CAAC;AACtE,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAClE,MAAM,YAAY,GAAG,4FAA4F,CAAC;AAElH,uEAAuE;AACvE,SAAS,KAAK,CAAC,GAA4B,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY;IACpF,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,IAAI,IAAI,eAAe,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,QAAQ,CAAC,CAAC;IACvI,OAAO,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,GAAY,EAAE,IAAY;IAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,0CAA0C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;IACtB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,4BAA4B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjF,CAAC;IACD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ,EAAE,CAAC;YACd,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,gDAAgD,CAAC,CAAC;YACtF,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,0BAA0B,CAAC,CAAC;YAC3F,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC;oBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,wCAAwC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtH,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,oBAAoB,CAAC,mCAAmC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnH,CAAC;YACH,CAAC;YACD,IAAI,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACzE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,aAAa,GAAG,CAAC,IAAI,0BAA0B,CAAC,CAAC;YACrF,CAAC;YACD,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,IAAI,EAAE,CAAC;YACV,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3D,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,kEAAkE,CAAC,CAAC;YACxG,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,oBAAoB,GAAG,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACpH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,UAAU,EAAE,CAAC;YAChB,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC;gBAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS;oBAAE,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC;YACrH,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,YAAY;YACf,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YACtC,OAAO,GAA0B,CAAC;QACpC,KAAK,aAAa,CAAC;QACnB,KAAK,KAAK;YACR,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,OAAO,GAA0B,CAAC;QACpC,KAAK,wBAAwB;YAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3E,OAAO,GAA0B,CAAC;QACpC,KAAK,gBAAgB,EAAE,CAAC;YACtB,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,gCAAgC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,kBAAkB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzI,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD;YACE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,cAAc,IAAI,6CAA6C,YAAY,GAAG,CAAC,CAAC;IACtH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,MAAM,GAAG,GAAY,YAAY,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,IAAI,GAAG;QAAE,OAAO,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1E,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,YAAY,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAChE,OAAO,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,iCAAiC,CAAC,CAAC;AACvE,CAAC","sourcesContent":["/**\n * Search-problem construction and JSON loading for Product B.\n *\n * @internal\n */\n\nimport { readJsonFile } from '../../core/data-file.js';\nimport { isPlainObject } from '../../core/json-schema.js';\nimport { dirname, isAbsolute, resolve } from 'node:path';\nimport { parseDimensionSpec } from '../../dimensional/dimension-spec.js';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type {\n  DimensionalVariableRef,\n  DiscrepancyDefinition,\n  FrontierGap,\n  FrontierGapKind,\n  ProbeDataset,\n  SearchProblem,\n} from './types.js';\nimport { problemFromResidualGap } from './frontier.js';\nimport { asDatasetSafe, loadSplitDatasetsFromJson } from './dataset.js';\n\n/** Return whether a string names a supported frontier-gap kind for probe problems. @internal */\nexport function isGapKind(s: string): s is FrontierGapKind {\n  return (\n    s === 'prediction-residual' ||\n    s === 'relation-link' ||\n    s === 'regime-transition' ||\n    s === 'parameter-tension' ||\n    s === 'assumption-conflict' ||\n    s === 'missing-operator' ||\n    s === 'unexplained-observation' ||\n    s === 'model-disagreement' ||\n    s === 'causal-mechanism' ||\n    s === 'other'\n  );\n}\n\n/** Residual / unexplained-observation gap template. @internal */\nexport function makeResidualGap(\n  id: string,\n  summary: string,\n  kind: FrontierGapKind = 'unexplained-observation',\n): FrontierGap {\n  if (!id.startsWith('fg-')) {\n    throw new RangeError(`makeResidualGap: id must start with 'fg-' (got '${id}')`);\n  }\n  if (kind === 'relation-link' || kind === 'regime-transition') {\n    throw new RangeError(`makeResidualGap: ${kind} is Product A — use upt discover, not probe`);\n  }\n  return {\n    id,\n    kind,\n    participants: [],\n    observations: [],\n    regimes: [],\n    assumptions: [],\n    constraints: [],\n    evidence: { summary, sourceIds: [] },\n    identifiability: {\n      kind: 'parametric',\n      parametric: { status: 'unknown', reasons: ['not yet assessed'] },\n    },\n    searchability: { searchable: true, reasons: ['residual gap'] },\n    status: 'identified',\n  };\n}\n\n/**\n * A JSON file that is not a search-problem file, or not an expression file: a field it must carry\n * is missing or holds a value of another kind. The message names the field; it never reports what\n * a JavaScript engine said on reading it. @internal\n */\nexport class ProblemFileError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'ProblemFileError';\n  }\n}\n\n/** The `DiscrepancyKind` union as a runtime set, for a file's `discrepancy.kind`. */\nconst DISCREPANCY_KINDS: ReadonlySet<string> = new Set([\n  'additive', 'relative', 'log-ratio', 'standardized', 'likelihood',\n  'vector', 'tensor', 'distributional', 'operator', 'custom',\n]);\n\n/** What a JSON value is, in the words a file author would use. */\nfunction kindOf(v: unknown): string {\n  if (v === null) return 'null';\n  if (Array.isArray(v)) return 'a list';\n  if (typeof v === 'string') return 'text';\n  if (typeof v === 'number') return 'a number';\n  if (typeof v === 'boolean') return 'true or false';\n  return typeof v === 'object' ? 'an object' : typeof v;\n}\n\n/** A `{\"name\", \"dim\"}` variable, read from `raw` and located by `where` in any refusal. */\nfunction varFromJson(raw: unknown, where: string): DimensionalVariableRef {\n  if (!isPlainObject(raw)) {\n    throw new ProblemFileError(`${where} must be {\"name\": text, \"dim\": text} (found ${kindOf(raw)})`);\n  }\n  const { name, dim } = raw;\n  if (typeof name !== 'string' || name === '') {\n    throw new ProblemFileError(`${where} needs a \"name\" (text)${name === undefined ? '' : `, found ${kindOf(name)}`}`);\n  }\n  if (typeof dim !== 'string' || dim === '') {\n    throw new ProblemFileError(`${where} needs a \"dim\" (text)${dim === undefined ? '' : `, found ${kindOf(dim)}`}`);\n  }\n  return { name, dim: parseDimensionSpec(dim) };\n}\n\nexport interface ProblemFile {\n  readonly gap?: {\n    readonly id?: string;\n    readonly kind?: string;\n    readonly summary?: string;\n  };\n  readonly target: { readonly name: string; readonly dim: string };\n  readonly governing: readonly { readonly name: string; readonly dim: string }[];\n  readonly exploratory?: unknown;\n  readonly holdout?: unknown;\n  readonly observationsPath?: string;\n  readonly baseline?: ExprNode;\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly assumptions?: readonly string[];\n  readonly limits?: SearchProblem['limits'];\n  readonly claimedRegimes?: Readonly<Record<string, string>>;\n  readonly observationalBoundIds?: readonly string[];\n}\n\n/** Load a SearchProblem from a JSON file (optionally with inline datasets). @internal */\nexport function loadSearchProblemFromJson(path: string): SearchProblem {\n  const raw = readJsonFile(path) as ProblemFile;\n  return searchProblemFromFile(raw, path);\n}\n\n/**\n * The observations file a problem file names, resolved against the problem file's directory\n * (the working directory for an inline problem), or null when it names none. @internal\n */\nexport function resolveObservationsPath(raw: Pick<ProblemFile, 'observationsPath'>, source = 'inline'): string | null {\n  if (!raw.observationsPath) return null;\n  return isAbsolute(raw.observationsPath)\n    ? raw.observationsPath\n    : resolve(source === 'inline' ? process.cwd() : dirname(source), raw.observationsPath);\n}\n\n/** Build a SearchProblem from an already-parsed problem file. @internal */\nexport function searchProblemFromFile(raw: ProblemFile, source = 'inline'): SearchProblem {\n  // `ProblemFile` is what a well-formed file holds; a file read from disk is any JSON value, so\n  // each field is checked here before it is read, and a refusal names the field.\n  const file: unknown = raw;\n  if (!isPlainObject(file)) {\n    throw new ProblemFileError(`the top level must be a JSON object with \"target\" and \"governing\" (found ${kindOf(file)})`);\n  }\n  if (file.target === undefined) throw new ProblemFileError('it has no \"target\" ({\"name\": text, \"dim\": text})');\n  if (file.governing === undefined) throw new ProblemFileError('it has no \"governing\" list ([{\"name\": text, \"dim\": text}, ...])');\n  if (!Array.isArray(file.governing)) {\n    throw new ProblemFileError(`\"governing\" must be a list of {\"name\": text, \"dim\": text} (found ${kindOf(file.governing)})`);\n  }\n  if (file.gap !== undefined && !isPlainObject(file.gap)) {\n    throw new ProblemFileError(`\"gap\" must be an object (found ${kindOf(file.gap)})`);\n  }\n  for (const field of ['id', 'kind', 'summary'] as const) {\n    const v: unknown = raw.gap?.[field];\n    if (v !== undefined && typeof v !== 'string') {\n      throw new ProblemFileError(`gap.${field} must be text (found ${kindOf(v)})`);\n    }\n  }\n  const kindRaw = raw.gap?.kind ?? 'unexplained-observation';\n  if (!isGapKind(kindRaw)) {\n    throw new ProblemFileError(`unknown gap kind '${kindRaw}' in gap.kind (see \\`upt help probe\\`, PROBLEM FILE)`);\n  }\n  if (kindRaw === 'relation-link' || kindRaw === 'regime-transition') {\n    throw new ProblemFileError(`gap.kind '${kindRaw}' is a Product A gap: use \\`upt discover\\`, not probe`);\n  }\n  const gapId = raw.gap?.id ?? 'fg-inline';\n  if (!gapId.startsWith('fg-')) {\n    throw new ProblemFileError(`gap.id '${gapId}' must start with \"fg-\"`);\n  }\n  const gap = makeResidualGap(gapId, raw.gap?.summary ?? `search problem from ${source}`, kindRaw);\n  const target = varFromJson(raw.target, '\"target\"');\n  const governing = raw.governing.map((g, i) => varFromJson(g, `governing[${i}]`));\n  let exploratory: ProbeDataset | undefined;\n  let holdout: ProbeDataset | undefined;\n  if (file.observationsPath !== undefined && typeof file.observationsPath !== 'string') {\n    throw new ProblemFileError(`\"observationsPath\" must be text (found ${kindOf(file.observationsPath)})`);\n  }\n  const observationsPath = resolveObservationsPath(raw, source);\n  if (observationsPath !== null) {\n    const split = loadSplitDatasetsFromJson(observationsPath);\n    exploratory = split.exploratory;\n    holdout = split.holdout;\n  }\n  if (raw.exploratory) {\n    exploratory = asDatasetSafe(raw.exploratory, `${source}#exploratory`, 'exploratory-fit');\n  }\n  if (raw.holdout) {\n    holdout = asDatasetSafe(raw.holdout, `${source}#holdout`, 'validation-holdout');\n  }\n  const problem = problemFromResidualGap(gap, target, governing, exploratory, holdout);\n  // The secondary fields. Each was once passed through unread, so `limits: 5` or\n  // `assumptions: \"x\"` reached `runProbeSearch` and threw a raw TypeError there.\n  return {\n    ...problem,\n    baseline: file.baseline === undefined ? undefined : assertExprNode(file.baseline, '\"baseline\"'),\n    discrepancy: file.discrepancy === undefined ? problem.discrepancy : discrepancyFromJson(file.discrepancy),\n    assumptions: file.assumptions === undefined ? gap.assumptions : textList(file.assumptions, 'assumptions'),\n    limits: file.limits === undefined ? undefined : limitsFromJson(file.limits),\n    claimedRegimes: file.claimedRegimes === undefined ? undefined : textRecord(file.claimedRegimes, 'claimedRegimes'),\n    observationalBoundIds:\n      file.observationalBoundIds === undefined ? undefined : textList(file.observationalBoundIds, 'observationalBoundIds'),\n  };\n}\n\n/** A list of text, located by its field name. */\nfunction textList(raw: unknown, field: string): readonly string[] {\n  const label = field.includes('.') ? field : `\"${field}\"`;\n  if (!Array.isArray(raw)) throw new ProblemFileError(`${label} must be a list of text (found ${kindOf(raw)})`);\n  return raw.map((v, i) => {\n    if (typeof v !== 'string') throw new ProblemFileError(`${field}[${i}] must be text (found ${kindOf(v)})`);\n    return v;\n  });\n}\n\n/** A `{name: text}` object, located by its field name. */\nfunction textRecord(raw: unknown, field: string): Readonly<Record<string, string>> {\n  if (!isPlainObject(raw)) throw new ProblemFileError(`\"${field}\" must be {name: text} (found ${kindOf(raw)})`);\n  const out: Record<string, string> = {};\n  for (const [k, v] of Object.entries(raw)) {\n    if (typeof v !== 'string') throw new ProblemFileError(`${field}.${k} must be text (found ${kindOf(v)})`);\n    out[k] = v;\n  }\n  return out;\n}\n\nfunction discrepancyFromJson(raw: unknown): DiscrepancyDefinition {\n  if (!isPlainObject(raw)) throw new ProblemFileError(`\"discrepancy\" must be {\"kind\": text, \"observableIds\": [text]} (found ${kindOf(raw)})`);\n  if (typeof raw.kind !== 'string' || !DISCREPANCY_KINDS.has(raw.kind)) {\n    throw new ProblemFileError(\n      `discrepancy.kind '${String(raw.kind)}' is not a discrepancy kind (${[...DISCREPANCY_KINDS].join(', ')})`,\n    );\n  }\n  const observableIds = textList(raw.observableIds, 'discrepancy.observableIds');\n  for (const key of ['covarianceRef', 'implementationRef'] as const) {\n    if (raw[key] !== undefined && typeof raw[key] !== 'string') {\n      throw new ProblemFileError(`discrepancy.${key} must be text (found ${kindOf(raw[key])})`);\n    }\n  }\n  return {\n    kind: raw.kind as DiscrepancyDefinition['kind'],\n    observableIds,\n    ...(typeof raw.covarianceRef === 'string' ? { covarianceRef: raw.covarianceRef } : {}),\n    ...(typeof raw.implementationRef === 'string' ? { implementationRef: raw.implementationRef } : {}),\n  };\n}\n\nfunction limitsFromJson(raw: unknown): NonNullable<SearchProblem['limits']> {\n  const shape = '{\"id\": text, \"regime\": {name: text}}';\n  if (!Array.isArray(raw)) throw new ProblemFileError(`\"limits\" must be a list of ${shape} (found ${kindOf(raw)})`);\n  return raw.map((l, i) => {\n    if (!isPlainObject(l)) throw new ProblemFileError(`limits[${i}] must be ${shape} (found ${kindOf(l)})`);\n    if (typeof l.id !== 'string' || l.id === '') throw new ProblemFileError(`limits[${i}].id must be text`);\n    if (!isPlainObject(l.regime)) throw new ProblemFileError(`limits[${i}].regime must be {name: text} (found ${kindOf(l.regime)})`);\n    const regime = textRecord(l.regime, `limits[${i}].regime`);\n    if (l.description !== undefined && typeof l.description !== 'string') {\n      throw new ProblemFileError(`limits[${i}].description must be text (found ${kindOf(l.description)})`);\n    }\n    return { id: l.id, regime, ...(typeof l.description === 'string' ? { description: l.description } : {}) };\n  });\n}\n\n/** The scalar operators an `op` node may carry. */\nconst SCALAR_OPS: ReadonlySet<string> = new Set(['+', '-', '*', '/', '^']);\n/** The `TranscendentalFn` union as a runtime set. */\nconst TRANSCENDENTAL_FNS: ReadonlySet<string> = new Set(['exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh']);\n/** A decimal literal, as the validator reads a numeric-literal symbol. */\nconst DECIMAL_LITERAL = /^[+-]?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?$/;\nconst DIM_KEYS = ['L', 'M', 'T', 'I', 'Theta', 'N', 'J'] as const;\nconst SCALAR_KINDS = 'symbol, op, integral, derivative, dirac-delta, variational-derivative, transcendental, abs';\n\n/** `raw[field]` as a child node, or a refusal that names the field. */\nfunction child(raw: Record<string, unknown>, field: string, path: string, what: string): ExprNode {\n  if (raw[field] === undefined) throw new ProblemFileError(`${path} ${what} node needs ${field === 'args' ? '' : 'an '}\"${field}\" node`);\n  return assertExprNode(raw[field], `${path}#${field}`);\n}\n\n/**\n * Check that a JSON value has the shape of a scalar `ExprNode`, recursively:\n * a kind per node, the children each kind owns, a finite literal where a\n * symbol's name is a decimal literal, and the seven dimension exponents on a\n * symbol. A tensor kind is refused here: the probe evaluates scalars.\n * Refusals are {@link ProblemFileError}, located by `path`.\n */\nfunction assertExprNode(raw: unknown, path: string): ExprNode {\n  if (!isPlainObject(raw) || !('kind' in raw)) {\n    throw new ProblemFileError(`${path} is not an ExprNode JSON object (found ${kindOf(raw)})`);\n  }\n  const kind = raw.kind;\n  if (typeof kind !== 'string' || kind.length === 0) {\n    throw new ProblemFileError(`${path} has invalid kind (found ${kindOf(kind)})`);\n  }\n  switch (kind) {\n    case 'symbol': {\n      if (typeof raw.name !== 'string' || raw.name.length === 0) {\n        throw new ProblemFileError(`${path} symbol node missing name (needs \"name\": text)`);\n      }\n      if (!isPlainObject(raw.dim)) throw new ProblemFileError(`${path} symbol node missing dim`);\n      for (const k of DIM_KEYS) {\n        if (!(k in raw.dim)) throw new ProblemFileError(`${path} symbol node dim needs the exponents ${DIM_KEYS.join(', ')}`);\n        if (typeof raw.dim[k] !== 'number' || !Number.isFinite(raw.dim[k])) {\n          throw new ProblemFileError(`${path} symbol node dim.${k} must be a finite number (found ${kindOf(raw.dim[k])})`);\n        }\n      }\n      if (DECIMAL_LITERAL.test(raw.name) && !Number.isFinite(Number(raw.name))) {\n        throw new ProblemFileError(`${path} literal '${raw.name}' is not a finite number`);\n      }\n      return raw as unknown as ExprNode;\n    }\n    case 'op': {\n      if (typeof raw.op !== 'string' || !Array.isArray(raw.args)) {\n        throw new ProblemFileError(`${path} op node needs \"op\" and an \"args\" list (op node missing op/args)`);\n      }\n      if (!SCALAR_OPS.has(raw.op)) throw new ProblemFileError(`${path} op node has op '${raw.op}', not one of + - * / ^`);\n      raw.args.forEach((a, i) => assertExprNode(a, `${path}#args[${i}]`));\n      return raw as unknown as ExprNode;\n    }\n    case 'integral': {\n      child(raw, 'over', path, 'integral');\n      child(raw, 'integrand', path, 'integral');\n      for (const bound of ['lower', 'upper']) if (raw[bound] !== undefined) assertExprNode(raw[bound], `${path}#${bound}`);\n      return raw as unknown as ExprNode;\n    }\n    case 'derivative':\n      child(raw, 'of', path, 'derivative');\n      child(raw, 'wrt', path, 'derivative');\n      return raw as unknown as ExprNode;\n    case 'dirac-delta':\n    case 'abs':\n      child(raw, 'arg', path, kind);\n      return raw as unknown as ExprNode;\n    case 'variational-derivative':\n      for (const f of ['functional', 'field', 'over']) child(raw, f, path, kind);\n      return raw as unknown as ExprNode;\n    case 'transcendental': {\n      if (typeof raw.fn !== 'string' || !TRANSCENDENTAL_FNS.has(raw.fn)) {\n        throw new ProblemFileError(`${path} transcendental node has fn '${String(raw.fn)}', not one of ${[...TRANSCENDENTAL_FNS].join(', ')}`);\n      }\n      child(raw, 'arg', path, kind);\n      return raw as unknown as ExprNode;\n    }\n    default:\n      throw new ProblemFileError(`${path} has kind '${kind}', which is not a scalar expression node (${SCALAR_KINDS})`);\n  }\n}\n\n/**\n * Load an ExprNode from a JSON file (`{expression}` wrapper or bare node). The node shape is\n * checked recursively; a file that is not an expression raises {@link ProblemFileError}. @internal\n */\nexport function parseExprJson(path: string): ExprNode {\n  const raw: unknown = readJsonFile(path);\n  if (isPlainObject(raw) && 'kind' in raw) return assertExprNode(raw, path);\n  if (isPlainObject(raw) && 'expression' in raw && raw.expression) {\n    return assertExprNode(raw.expression, path);\n  }\n  throw new ProblemFileError(`${path} is not an ExprNode JSON object`);\n}\n"]}
+{"version":3,"file":"problem.js","sourceRoot":"","sources":["../../../src/composition/probe/problem.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AAUzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,yBAAyB,EAAE,MAAM,cAAc,CAAC;AAExE,gGAAgG;AAChG,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,OAAO,CACL,CAAC,KAAK,qBAAqB;QAC3B,CAAC,KAAK,eAAe;QACrB,CAAC,KAAK,mBAAmB;QACzB,CAAC,KAAK,mBAAmB;QACzB,CAAC,KAAK,qBAAqB;QAC3B,CAAC,KAAK,kBAAkB;QACxB,CAAC,KAAK,yBAAyB;QAC/B,CAAC,KAAK,oBAAoB;QAC1B,CAAC,KAAK,kBAAkB;QACxB,CAAC,KAAK,OAAO,CACd,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,eAAe,CAC7B,EAAU,EACV,OAAe,EACf,IAAI,GAAoB,yBAAyB;IAEjD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,UAAU,CAAC,mDAAmD,EAAE,IAAI,CAAC,CAAC;IAClF,CAAC;IACD,IAAI,IAAI,KAAK,eAAe,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QAC7D,MAAM,IAAI,UAAU,CAAC,oBAAoB,IAAI,6CAA6C,CAAC,CAAC;IAC9F,CAAC;IACD,OAAO;QACL,EAAE;QACF,IAAI;QACJ,YAAY,EAAE,EAAE;QAChB,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,EAAE;QACX,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,EAAE;QACf,QAAQ,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE;QACpC,eAAe,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,kBAAkB,CAAC,EAAE;SACjE;QACD,aAAa,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,cAAc,CAAC,EAAE;QAC9D,MAAM,EAAE,YAAY;KACrB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;IACjC,CAAC;CACF;AAED,qFAAqF;AACrF,MAAM,iBAAiB,GAAwB,IAAI,GAAG,CAAC;IACrD,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY;IACjE,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ;CAC3D,CAAC,CAAC;AAEH,kEAAkE;AAClE,SAAS,MAAM,CAAC,CAAU;IACxB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC;IACtC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC;IACzC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,UAAU,CAAC;IAC7C,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IACnD,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,2FAA2F;AAC3F,SAAS,WAAW,CAAC,GAAY,EAAE,KAAa;IAC9C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,+CAA+C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAC1B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,yBAAyB,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACrH,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,wBAAwB,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAClH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;AAChD,CAAC;AAsBD,yFAAyF;AACzF,MAAM,UAAU,yBAAyB,CAAC,IAAY;IACpD,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAgB,CAAC;IAC9C,OAAO,qBAAqB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,GAA0C,EAAE,MAAM,GAAG,QAAQ;IACnG,IAAI,CAAC,GAAG,CAAC,gBAAgB;QAAE,OAAO,IAAI,CAAC;IACvC,OAAO,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,gBAAgB;QACtB,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;AAC3F,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,qBAAqB,CAAC,GAAgB,EAAE,MAAM,GAAG,QAAQ;IACvE,8FAA8F;IAC9F,+EAA+E;IAC/E,MAAM,IAAI,GAAY,GAAG,CAAC;IAC1B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,gBAAgB,CAAC,4EAA4E,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1H,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,kDAAkD,CAAC,CAAC;IAC9G,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,iEAAiE,CAAC,CAAC;IAChI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,gBAAgB,CAAC,oEAAoE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC5H,CAAC;IACD,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,gBAAgB,CAAC,kCAAkC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpF,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAU,EAAE,CAAC;QACvD,MAAM,CAAC,GAAY,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC7C,MAAM,IAAI,gBAAgB,CAAC,OAAO,KAAK,wBAAwB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,IAAI,yBAAyB,CAAC;IAC3D,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,gBAAgB,CAAC,qBAAqB,OAAO,sDAAsD,CAAC,CAAC;IACjH,CAAC;IACD,IAAI,OAAO,KAAK,eAAe,IAAI,OAAO,KAAK,mBAAmB,EAAE,CAAC;QACnE,MAAM,IAAI,gBAAgB,CAAC,aAAa,OAAO,uDAAuD,CAAC,CAAC;IAC1G,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,WAAW,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,gBAAgB,CAAC,WAAW,KAAK,yBAAyB,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,IAAI,uBAAuB,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC;IACjG,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;IACjF,IAAI,WAAqC,CAAC;IAC1C,IAAI,OAAiC,CAAC;IACtC,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,gBAAgB,KAAK,QAAQ,EAAE,CAAC;QACrF,MAAM,IAAI,gBAAgB,CAAC,0CAA0C,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;QAC1D,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;QAChC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;IAC1B,CAAC;IACD,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACpB,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,MAAM,cAAc,EAAE,iBAAiB,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAChB,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,MAAM,UAAU,EAAE,oBAAoB,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IACrF,+EAA+E;IAC/E,+EAA+E;IAC/E,OAAO;QACL,GAAG,OAAO;QACV,QAAQ,EAAE,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC;QAC/F,WAAW,EAAE,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC;QACzG,WAAW,EAAE,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,CAAC;QACzG,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3E,cAAc,EAAE,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,EAAE,gBAAgB,CAAC;QACjH,qBAAqB,EACnB,IAAI,CAAC,qBAAqB,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,EAAE,uBAAuB,CAAC;KACvH,CAAC;AACJ,CAAC;AAED,iDAAiD;AACjD,SAAS,QAAQ,CAAC,GAAY,EAAE,KAAa;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;IACzD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,kCAAkC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9G,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,IAAI,CAAC,yBAAyB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1G,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,0DAA0D;AAC1D,SAAS,UAAU,CAAC,GAAY,EAAE,KAAa;IAC7C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,IAAI,KAAK,iCAAiC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9G,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,KAAK,IAAI,CAAC,wBAAwB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAY;IACvC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,wEAAwE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5I,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACrE,MAAM,IAAI,gBAAgB,CACxB,qBAAqB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,gCAAgC,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC1G,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,aAAa,EAAE,2BAA2B,CAAC,CAAC;IAC/E,KAAK,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,mBAAmB,CAAU,EAAE,CAAC;QAClE,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC3D,MAAM,IAAI,gBAAgB,CAAC,eAAe,GAAG,wBAAwB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,IAAqC;QAC/C,aAAa;QACb,GAAG,CAAC,OAAO,GAAG,CAAC,aAAa,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,GAAG,CAAC,OAAO,GAAG,CAAC,iBAAiB,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACnG,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,GAAY;IAClC,MAAM,KAAK,GAAG,sCAAsC,CAAC;IACrD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,8BAA8B,KAAK,WAAW,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,aAAa,KAAK,WAAW,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxG,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;QACxG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,wCAAwC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjI,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YACrE,MAAM,IAAI,gBAAgB,CAAC,UAAU,CAAC,qCAAqC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACvG,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC5G,CAAC,CAAC,CAAC;AACL,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,GAAwB,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3E,qDAAqD;AACrD,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACrI,0EAA0E;AAC1E,MAAM,eAAe,GAAG,6CAA6C,CAAC;AACtE,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAClE,MAAM,YAAY,GAAG,4FAA4F,CAAC;AAElH,uEAAuE;AACvE,SAAS,KAAK,CAAC,GAA4B,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY;IACpF,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,IAAI,IAAI,eAAe,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,QAAQ,CAAC,CAAC;IACvI,OAAO,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,GAAY,EAAE,IAAY;IAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,0CAA0C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;IACtB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,4BAA4B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjF,CAAC;IACD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ,EAAE,CAAC;YACd,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,gDAAgD,CAAC,CAAC;YACtF,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,0BAA0B,CAAC,CAAC;YAC3F,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC;oBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,wCAAwC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtH,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,oBAAoB,CAAC,mCAAmC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnH,CAAC;YACH,CAAC;YACD,IAAI,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACzE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,aAAa,GAAG,CAAC,IAAI,0BAA0B,CAAC,CAAC;YACrF,CAAC;YACD,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,IAAI,EAAE,CAAC;YACV,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3D,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,kEAAkE,CAAC,CAAC;YACxG,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,oBAAoB,GAAG,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACpH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,UAAU,EAAE,CAAC;YAChB,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC;gBAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS;oBAAE,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC;YACrH,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD,KAAK,YAAY;YACf,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YACtC,OAAO,GAA0B,CAAC;QACpC,KAAK,aAAa,CAAC;QACnB,KAAK,KAAK;YACR,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,OAAO,GAA0B,CAAC;QACpC,KAAK,wBAAwB;YAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3E,OAAO,GAA0B,CAAC;QACpC,KAAK,gBAAgB,EAAE,CAAC;YACtB,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,gCAAgC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,kBAAkB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzI,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,OAAO,GAA0B,CAAC;QACpC,CAAC;QACD;YACE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,cAAc,IAAI,6CAA6C,YAAY,GAAG,CAAC,CAAC;IACtH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,MAAM,GAAG,GAAY,YAAY,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,IAAI,GAAG;QAAE,OAAO,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1E,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,YAAY,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAChE,OAAO,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,iCAAiC,CAAC,CAAC;AACvE,CAAC","sourcesContent":["/**\n * Search-problem construction and JSON loading for Product B.\n *\n * @internal\n */\n\nimport { readJsonFile } from '../../core/data-file.js';\nimport { isPlainObject } from '../../core/json-schema.js';\nimport { dirname, isAbsolute, resolve } from 'node:path';\nimport { parseDimensionSpec } from '../../dimensional/dimension-spec.js';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type {\n  DimensionalVariableRef,\n  DiscrepancyDefinition,\n  FrontierGap,\n  FrontierGapKind,\n  ProbeDataset,\n  SearchProblem,\n} from './types.js';\nimport { problemFromResidualGap } from './frontier.js';\nimport { asDatasetSafe, loadSplitDatasetsFromJson } from './dataset.js';\n\n/** Return whether a string names a supported frontier-gap kind for probe problems. @internal */\nexport function isGapKind(s: string): s is FrontierGapKind {\n  return (\n    s === 'prediction-residual' ||\n    s === 'relation-link' ||\n    s === 'regime-transition' ||\n    s === 'parameter-tension' ||\n    s === 'assumption-conflict' ||\n    s === 'missing-operator' ||\n    s === 'unexplained-observation' ||\n    s === 'model-disagreement' ||\n    s === 'causal-mechanism' ||\n    s === 'other'\n  );\n}\n\n/** Residual / unexplained-observation gap template. @internal */\nexport function makeResidualGap(\n  id: string,\n  summary: string,\n  kind: FrontierGapKind = 'unexplained-observation',\n): FrontierGap {\n  if (!id.startsWith('fg-')) {\n    throw new RangeError(`makeResidualGap: id must start with 'fg-' (got '${id}')`);\n  }\n  if (kind === 'relation-link' || kind === 'regime-transition') {\n    throw new RangeError(`makeResidualGap: ${kind} is Product A — use upt discover, not probe`);\n  }\n  return {\n    id,\n    kind,\n    participants: [],\n    observations: [],\n    regimes: [],\n    assumptions: [],\n    constraints: [],\n    evidence: { summary, sourceIds: [] },\n    identifiability: {\n      kind: 'parametric',\n      parametric: { status: 'unknown', reasons: ['not yet assessed'] },\n    },\n    searchability: { searchable: true, reasons: ['residual gap'] },\n    status: 'identified',\n  };\n}\n\n/**\n * A JSON file that is not a search-problem file, or not an expression file: a field it must carry\n * is missing or holds a value of another kind. The message names the field; it never reports what\n * a JavaScript engine said on reading it. @internal\n */\nexport class ProblemFileError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'ProblemFileError';\n  }\n}\n\n/** The `DiscrepancyKind` union as a runtime set, for a file's `discrepancy.kind`. */\nconst DISCREPANCY_KINDS: ReadonlySet<string> = new Set([\n  'additive', 'relative', 'log-ratio', 'standardized', 'likelihood',\n  'vector', 'tensor', 'distributional', 'operator', 'custom',\n]);\n\n/** What a JSON value is, in the words a file author would use. */\nfunction kindOf(v: unknown): string {\n  if (v === null) return 'null';\n  if (Array.isArray(v)) return 'a list';\n  if (typeof v === 'string') return 'text';\n  if (typeof v === 'number') return 'a number';\n  if (typeof v === 'boolean') return 'true or false';\n  return typeof v === 'object' ? 'an object' : typeof v;\n}\n\n/** A `{\"name\", \"dim\"}` variable, read from `raw` and located by `where` in any refusal. */\nfunction varFromJson(raw: unknown, where: string): DimensionalVariableRef {\n  if (!isPlainObject(raw)) {\n    throw new ProblemFileError(`${where} must be {\"name\": text, \"dim\": text} (found ${kindOf(raw)})`);\n  }\n  const { name, dim } = raw;\n  if (typeof name !== 'string' || name === '') {\n    throw new ProblemFileError(`${where} needs a \"name\" (text)${name === undefined ? '' : `, found ${kindOf(name)}`}`);\n  }\n  if (typeof dim !== 'string' || dim === '') {\n    throw new ProblemFileError(`${where} needs a \"dim\" (text)${dim === undefined ? '' : `, found ${kindOf(dim)}`}`);\n  }\n  return { name, dim: parseDimensionSpec(dim) };\n}\n\n/** The JSON shape of a probe problem file, as read before validation. */\nexport interface ProblemFile {\n  readonly gap?: {\n    readonly id?: string;\n    readonly kind?: string;\n    readonly summary?: string;\n  };\n  readonly target: { readonly name: string; readonly dim: string };\n  readonly governing: readonly { readonly name: string; readonly dim: string }[];\n  readonly exploratory?: unknown;\n  readonly holdout?: unknown;\n  readonly observationsPath?: string;\n  readonly baseline?: ExprNode;\n  readonly discrepancy?: DiscrepancyDefinition;\n  readonly assumptions?: readonly string[];\n  readonly limits?: SearchProblem['limits'];\n  readonly claimedRegimes?: Readonly<Record<string, string>>;\n  readonly observationalBoundIds?: readonly string[];\n}\n\n/** Load a SearchProblem from a JSON file (optionally with inline datasets). @internal */\nexport function loadSearchProblemFromJson(path: string): SearchProblem {\n  const raw = readJsonFile(path) as ProblemFile;\n  return searchProblemFromFile(raw, path);\n}\n\n/**\n * The observations file a problem file names, resolved against the problem file's directory\n * (the working directory for an inline problem), or null when it names none. @internal\n */\nexport function resolveObservationsPath(raw: Pick<ProblemFile, 'observationsPath'>, source = 'inline'): string | null {\n  if (!raw.observationsPath) return null;\n  return isAbsolute(raw.observationsPath)\n    ? raw.observationsPath\n    : resolve(source === 'inline' ? process.cwd() : dirname(source), raw.observationsPath);\n}\n\n/** Build a SearchProblem from an already-parsed problem file. @internal */\nexport function searchProblemFromFile(raw: ProblemFile, source = 'inline'): SearchProblem {\n  // `ProblemFile` is what a well-formed file holds; a file read from disk is any JSON value, so\n  // each field is checked here before it is read, and a refusal names the field.\n  const file: unknown = raw;\n  if (!isPlainObject(file)) {\n    throw new ProblemFileError(`the top level must be a JSON object with \"target\" and \"governing\" (found ${kindOf(file)})`);\n  }\n  if (file.target === undefined) throw new ProblemFileError('it has no \"target\" ({\"name\": text, \"dim\": text})');\n  if (file.governing === undefined) throw new ProblemFileError('it has no \"governing\" list ([{\"name\": text, \"dim\": text}, ...])');\n  if (!Array.isArray(file.governing)) {\n    throw new ProblemFileError(`\"governing\" must be a list of {\"name\": text, \"dim\": text} (found ${kindOf(file.governing)})`);\n  }\n  if (file.gap !== undefined && !isPlainObject(file.gap)) {\n    throw new ProblemFileError(`\"gap\" must be an object (found ${kindOf(file.gap)})`);\n  }\n  for (const field of ['id', 'kind', 'summary'] as const) {\n    const v: unknown = raw.gap?.[field];\n    if (v !== undefined && typeof v !== 'string') {\n      throw new ProblemFileError(`gap.${field} must be text (found ${kindOf(v)})`);\n    }\n  }\n  const kindRaw = raw.gap?.kind ?? 'unexplained-observation';\n  if (!isGapKind(kindRaw)) {\n    throw new ProblemFileError(`unknown gap kind '${kindRaw}' in gap.kind (see \\`upt help probe\\`, PROBLEM FILE)`);\n  }\n  if (kindRaw === 'relation-link' || kindRaw === 'regime-transition') {\n    throw new ProblemFileError(`gap.kind '${kindRaw}' is a Product A gap: use \\`upt discover\\`, not probe`);\n  }\n  const gapId = raw.gap?.id ?? 'fg-inline';\n  if (!gapId.startsWith('fg-')) {\n    throw new ProblemFileError(`gap.id '${gapId}' must start with \"fg-\"`);\n  }\n  const gap = makeResidualGap(gapId, raw.gap?.summary ?? `search problem from ${source}`, kindRaw);\n  const target = varFromJson(raw.target, '\"target\"');\n  const governing = raw.governing.map((g, i) => varFromJson(g, `governing[${i}]`));\n  let exploratory: ProbeDataset | undefined;\n  let holdout: ProbeDataset | undefined;\n  if (file.observationsPath !== undefined && typeof file.observationsPath !== 'string') {\n    throw new ProblemFileError(`\"observationsPath\" must be text (found ${kindOf(file.observationsPath)})`);\n  }\n  const observationsPath = resolveObservationsPath(raw, source);\n  if (observationsPath !== null) {\n    const split = loadSplitDatasetsFromJson(observationsPath);\n    exploratory = split.exploratory;\n    holdout = split.holdout;\n  }\n  if (raw.exploratory) {\n    exploratory = asDatasetSafe(raw.exploratory, `${source}#exploratory`, 'exploratory-fit');\n  }\n  if (raw.holdout) {\n    holdout = asDatasetSafe(raw.holdout, `${source}#holdout`, 'validation-holdout');\n  }\n  const problem = problemFromResidualGap(gap, target, governing, exploratory, holdout);\n  // The secondary fields. Each was once passed through unread, so `limits: 5` or\n  // `assumptions: \"x\"` reached `runProbeSearch` and threw a raw TypeError there.\n  return {\n    ...problem,\n    baseline: file.baseline === undefined ? undefined : assertExprNode(file.baseline, '\"baseline\"'),\n    discrepancy: file.discrepancy === undefined ? problem.discrepancy : discrepancyFromJson(file.discrepancy),\n    assumptions: file.assumptions === undefined ? gap.assumptions : textList(file.assumptions, 'assumptions'),\n    limits: file.limits === undefined ? undefined : limitsFromJson(file.limits),\n    claimedRegimes: file.claimedRegimes === undefined ? undefined : textRecord(file.claimedRegimes, 'claimedRegimes'),\n    observationalBoundIds:\n      file.observationalBoundIds === undefined ? undefined : textList(file.observationalBoundIds, 'observationalBoundIds'),\n  };\n}\n\n/** A list of text, located by its field name. */\nfunction textList(raw: unknown, field: string): readonly string[] {\n  const label = field.includes('.') ? field : `\"${field}\"`;\n  if (!Array.isArray(raw)) throw new ProblemFileError(`${label} must be a list of text (found ${kindOf(raw)})`);\n  return raw.map((v, i) => {\n    if (typeof v !== 'string') throw new ProblemFileError(`${field}[${i}] must be text (found ${kindOf(v)})`);\n    return v;\n  });\n}\n\n/** A `{name: text}` object, located by its field name. */\nfunction textRecord(raw: unknown, field: string): Readonly<Record<string, string>> {\n  if (!isPlainObject(raw)) throw new ProblemFileError(`\"${field}\" must be {name: text} (found ${kindOf(raw)})`);\n  const out: Record<string, string> = {};\n  for (const [k, v] of Object.entries(raw)) {\n    if (typeof v !== 'string') throw new ProblemFileError(`${field}.${k} must be text (found ${kindOf(v)})`);\n    out[k] = v;\n  }\n  return out;\n}\n\nfunction discrepancyFromJson(raw: unknown): DiscrepancyDefinition {\n  if (!isPlainObject(raw)) throw new ProblemFileError(`\"discrepancy\" must be {\"kind\": text, \"observableIds\": [text]} (found ${kindOf(raw)})`);\n  if (typeof raw.kind !== 'string' || !DISCREPANCY_KINDS.has(raw.kind)) {\n    throw new ProblemFileError(\n      `discrepancy.kind '${String(raw.kind)}' is not a discrepancy kind (${[...DISCREPANCY_KINDS].join(', ')})`,\n    );\n  }\n  const observableIds = textList(raw.observableIds, 'discrepancy.observableIds');\n  for (const key of ['covarianceRef', 'implementationRef'] as const) {\n    if (raw[key] !== undefined && typeof raw[key] !== 'string') {\n      throw new ProblemFileError(`discrepancy.${key} must be text (found ${kindOf(raw[key])})`);\n    }\n  }\n  return {\n    kind: raw.kind as DiscrepancyDefinition['kind'],\n    observableIds,\n    ...(typeof raw.covarianceRef === 'string' ? { covarianceRef: raw.covarianceRef } : {}),\n    ...(typeof raw.implementationRef === 'string' ? { implementationRef: raw.implementationRef } : {}),\n  };\n}\n\nfunction limitsFromJson(raw: unknown): NonNullable<SearchProblem['limits']> {\n  const shape = '{\"id\": text, \"regime\": {name: text}}';\n  if (!Array.isArray(raw)) throw new ProblemFileError(`\"limits\" must be a list of ${shape} (found ${kindOf(raw)})`);\n  return raw.map((l, i) => {\n    if (!isPlainObject(l)) throw new ProblemFileError(`limits[${i}] must be ${shape} (found ${kindOf(l)})`);\n    if (typeof l.id !== 'string' || l.id === '') throw new ProblemFileError(`limits[${i}].id must be text`);\n    if (!isPlainObject(l.regime)) throw new ProblemFileError(`limits[${i}].regime must be {name: text} (found ${kindOf(l.regime)})`);\n    const regime = textRecord(l.regime, `limits[${i}].regime`);\n    if (l.description !== undefined && typeof l.description !== 'string') {\n      throw new ProblemFileError(`limits[${i}].description must be text (found ${kindOf(l.description)})`);\n    }\n    return { id: l.id, regime, ...(typeof l.description === 'string' ? { description: l.description } : {}) };\n  });\n}\n\n/** The scalar operators an `op` node may carry. */\nconst SCALAR_OPS: ReadonlySet<string> = new Set(['+', '-', '*', '/', '^']);\n/** The `TranscendentalFn` union as a runtime set. */\nconst TRANSCENDENTAL_FNS: ReadonlySet<string> = new Set(['exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh']);\n/** A decimal literal, as the validator reads a numeric-literal symbol. */\nconst DECIMAL_LITERAL = /^[+-]?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?$/;\nconst DIM_KEYS = ['L', 'M', 'T', 'I', 'Theta', 'N', 'J'] as const;\nconst SCALAR_KINDS = 'symbol, op, integral, derivative, dirac-delta, variational-derivative, transcendental, abs';\n\n/** `raw[field]` as a child node, or a refusal that names the field. */\nfunction child(raw: Record<string, unknown>, field: string, path: string, what: string): ExprNode {\n  if (raw[field] === undefined) throw new ProblemFileError(`${path} ${what} node needs ${field === 'args' ? '' : 'an '}\"${field}\" node`);\n  return assertExprNode(raw[field], `${path}#${field}`);\n}\n\n/**\n * Check that a JSON value has the shape of a scalar `ExprNode`, recursively:\n * a kind per node, the children each kind owns, a finite literal where a\n * symbol's name is a decimal literal, and the seven dimension exponents on a\n * symbol. A tensor kind is refused here: the probe evaluates scalars.\n * Refusals are {@link ProblemFileError}, located by `path`.\n */\nfunction assertExprNode(raw: unknown, path: string): ExprNode {\n  if (!isPlainObject(raw) || !('kind' in raw)) {\n    throw new ProblemFileError(`${path} is not an ExprNode JSON object (found ${kindOf(raw)})`);\n  }\n  const kind = raw.kind;\n  if (typeof kind !== 'string' || kind.length === 0) {\n    throw new ProblemFileError(`${path} has invalid kind (found ${kindOf(kind)})`);\n  }\n  switch (kind) {\n    case 'symbol': {\n      if (typeof raw.name !== 'string' || raw.name.length === 0) {\n        throw new ProblemFileError(`${path} symbol node missing name (needs \"name\": text)`);\n      }\n      if (!isPlainObject(raw.dim)) throw new ProblemFileError(`${path} symbol node missing dim`);\n      for (const k of DIM_KEYS) {\n        if (!(k in raw.dim)) throw new ProblemFileError(`${path} symbol node dim needs the exponents ${DIM_KEYS.join(', ')}`);\n        if (typeof raw.dim[k] !== 'number' || !Number.isFinite(raw.dim[k])) {\n          throw new ProblemFileError(`${path} symbol node dim.${k} must be a finite number (found ${kindOf(raw.dim[k])})`);\n        }\n      }\n      if (DECIMAL_LITERAL.test(raw.name) && !Number.isFinite(Number(raw.name))) {\n        throw new ProblemFileError(`${path} literal '${raw.name}' is not a finite number`);\n      }\n      return raw as unknown as ExprNode;\n    }\n    case 'op': {\n      if (typeof raw.op !== 'string' || !Array.isArray(raw.args)) {\n        throw new ProblemFileError(`${path} op node needs \"op\" and an \"args\" list (op node missing op/args)`);\n      }\n      if (!SCALAR_OPS.has(raw.op)) throw new ProblemFileError(`${path} op node has op '${raw.op}', not one of + - * / ^`);\n      raw.args.forEach((a, i) => assertExprNode(a, `${path}#args[${i}]`));\n      return raw as unknown as ExprNode;\n    }\n    case 'integral': {\n      child(raw, 'over', path, 'integral');\n      child(raw, 'integrand', path, 'integral');\n      for (const bound of ['lower', 'upper']) if (raw[bound] !== undefined) assertExprNode(raw[bound], `${path}#${bound}`);\n      return raw as unknown as ExprNode;\n    }\n    case 'derivative':\n      child(raw, 'of', path, 'derivative');\n      child(raw, 'wrt', path, 'derivative');\n      return raw as unknown as ExprNode;\n    case 'dirac-delta':\n    case 'abs':\n      child(raw, 'arg', path, kind);\n      return raw as unknown as ExprNode;\n    case 'variational-derivative':\n      for (const f of ['functional', 'field', 'over']) child(raw, f, path, kind);\n      return raw as unknown as ExprNode;\n    case 'transcendental': {\n      if (typeof raw.fn !== 'string' || !TRANSCENDENTAL_FNS.has(raw.fn)) {\n        throw new ProblemFileError(`${path} transcendental node has fn '${String(raw.fn)}', not one of ${[...TRANSCENDENTAL_FNS].join(', ')}`);\n      }\n      child(raw, 'arg', path, kind);\n      return raw as unknown as ExprNode;\n    }\n    default:\n      throw new ProblemFileError(`${path} has kind '${kind}', which is not a scalar expression node (${SCALAR_KINDS})`);\n  }\n}\n\n/**\n * Load an ExprNode from a JSON file (`{expression}` wrapper or bare node). The node shape is\n * checked recursively; a file that is not an expression raises {@link ProblemFileError}. @internal\n */\nexport function parseExprJson(path: string): ExprNode {\n  const raw: unknown = readJsonFile(path);\n  if (isPlainObject(raw) && 'kind' in raw) return assertExprNode(raw, path);\n  if (isPlainObject(raw) && 'expression' in raw && raw.expression) {\n    return assertExprNode(raw.expression, path);\n  }\n  throw new ProblemFileError(`${path} is not an ExprNode JSON object`);\n}\n"]}

package/dist/composition/probe/residual.d.ts

@@ -5,6 +5,7 @@
  * @module composition/probe/residual
  */
 import type { DiscrepancyDefinition, DiscrepancyKind } from './types.js';
+/** The error that residual evaluation throws, for example on a non-finite value. */
 export declare class ResidualError extends Error {
     constructor(message: string);
 }

package/dist/composition/probe/residual.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"residual.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/residual.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,qBAAqB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAEzE,qBAAa,aAAc,SAAQ,KAAK;IACtC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,eAAe,EACrB,KAAK,SAAI,GACR,MAAM,CAyCR;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAClB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,GAAG,EAAE,qBAAqB,EAC1B,KAAK,SAAI,GACR,MAAM,CAMR"}
+{"version":3,"file":"residual.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/residual.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,qBAAqB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAEzE,oFAAoF;AACpF,qBAAa,aAAc,SAAQ,KAAK;IACtC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,eAAe,EACrB,KAAK,SAAI,GACR,MAAM,CAyCR;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAClB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,GAAG,EAAE,qBAAqB,EAC1B,KAAK,SAAI,GACR,MAAM,CAMR"}

package/dist/composition/probe/residual.js

@@ -5,6 +5,7 @@
  * @module composition/probe/residual
  */
 import { norm2 } from '@danielsimonjr/mathts-core';
+/** The error that residual evaluation throws, for example on a non-finite value. */
 export class ResidualError extends Error {
     constructor(message) {
         super(message);

package/dist/composition/probe/residual.js.map

@@ -1 +1 @@
-{"version":3,"file":"residual.js","sourceRoot":"","sources":["../../../src/composition/probe/residual.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAC;AAGnD,MAAM,OAAO,aAAc,SAAQ,KAAK;IACtC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC;IAC9B,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAgB,EAChB,SAAiB,EACjB,IAAqB,EACrB,KAAK,GAAG,CAAC;IAET,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,aAAa,CAAC,0DAA0D,CAAC,CAAC;IACtF,CAAC;IACD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,UAAU;YACb,OAAO,QAAQ,GAAG,SAAS,CAAC;QAC9B,KAAK,UAAU,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACnF,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACpC,CAAC;QACD,KAAK,WAAW,EAAE,CAAC;YACjB,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;gBACrC,MAAM,IAAI,aAAa,CAAC,6DAA6D,CAAC,CAAC;YACzF,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,cAAc,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC3C,MAAM,IAAI,aAAa,CAAC,sDAAsD,CAAC,CAAC;YAClF,CAAC;YACD,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;QACxC,CAAC;QACD,KAAK,YAAY,EAAE,CAAC;YAClB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBAAE,MAAM,IAAI,aAAa,CAAC,6CAA6C,CAAC,CAAC;YACzF,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;YACzC,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,gBAAgB,CAAC;QACtB,KAAK,UAAU,CAAC;QAChB,KAAK,QAAQ;YACX,MAAM,IAAI,aAAa,CACrB,GAAG,IAAI,8DAA8D,CACtE,CAAC;QACJ,SAAS,CAAC;YACR,MAAM,MAAM,GAAU,IAAI,CAAC;YAC3B,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAClB,QAA2B,EAC3B,SAA4B,EAC5B,GAA0B,EAC1B,KAAK,GAAG,CAAC;IAET,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,IAAI,aAAa,CAAC,8CAA8C,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/F,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AACxD,CAAC","sourcesContent":["/**\n * Explicit residual / discrepancy evaluation. Does not replace\n * `residualInSigma` on the confrontation spine.\n *\n * @module composition/probe/residual\n */\n\nimport { norm2 } from '@danielsimonjr/mathts-core';\nimport type { DiscrepancyDefinition, DiscrepancyKind } from './types.js';\n\nexport class ResidualError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'ResidualError';\n  }\n}\n\n/**\n * Scalar discrepancy. Covariance-standardized with a non-diagonal Σ is\n * unsupported and throws rather than silently using diagonal σ.\n *\n * @internal\n */\nexport function scalarDiscrepancy(\n  observed: number,\n  predicted: number,\n  kind: DiscrepancyKind,\n  scale = 1,\n): number {\n  if (!Number.isFinite(observed) || !Number.isFinite(predicted)) {\n    throw new ResidualError('scalarDiscrepancy: observed and predicted must be finite');\n  }\n  switch (kind) {\n    case 'additive':\n      return observed - predicted;\n    case 'relative': {\n      const s = scale !== 0 && Number.isFinite(scale) ? scale : Math.abs(predicted) || 1;\n      return (observed - predicted) / s;\n    }\n    case 'log-ratio': {\n      if (!(observed > 0 && predicted > 0)) {\n        throw new ResidualError('log-ratio residual requires positive observed and predicted');\n      }\n      return Math.log(observed / predicted);\n    }\n    case 'standardized': {\n      if (!(scale > 0 && Number.isFinite(scale))) {\n        throw new ResidualError('standardized residual requires positive finite sigma');\n      }\n      return (observed - predicted) / scale;\n    }\n    case 'likelihood': {\n      if (!(scale > 0)) throw new ResidualError('likelihood residual requires positive sigma');\n      const z = (observed - predicted) / scale;\n      return 0.5 * z * z + Math.log(scale * Math.sqrt(2 * Math.PI));\n    }\n    case 'vector':\n    case 'tensor':\n    case 'distributional':\n    case 'operator':\n    case 'custom':\n      throw new ResidualError(\n        `${kind} discrepancy is not implemented on the scalar path — abstain`,\n      );\n    default: {\n      const _never: never = kind;\n      return _never;\n    }\n  }\n}\n\n/**\n * RMSE of a discrepancy over paired samples: core `norm2` of the discrepancies\n * (the scaled, overflow-safe 2-norm) over √n. Empty or unequal-length samples\n * are refused, as before; a non-finite sample still throws from\n * {@link scalarDiscrepancy}. @internal\n */\nexport function rmse(\n  observed: readonly number[],\n  predicted: readonly number[],\n  def: DiscrepancyDefinition,\n  scale = 1,\n): number {\n  if (observed.length !== predicted.length || observed.length === 0) {\n    throw new ResidualError('rmse: nonempty equal-length samples required');\n  }\n  const residuals = observed.map((o, i) => scalarDiscrepancy(o, predicted[i]!, def.kind, scale));\n  return norm2(residuals) / Math.sqrt(residuals.length);\n}\n"]}
+{"version":3,"file":"residual.js","sourceRoot":"","sources":["../../../src/composition/probe/residual.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAC;AAGnD,oFAAoF;AACpF,MAAM,OAAO,aAAc,SAAQ,KAAK;IACtC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC;IAC9B,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAgB,EAChB,SAAiB,EACjB,IAAqB,EACrB,KAAK,GAAG,CAAC;IAET,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,aAAa,CAAC,0DAA0D,CAAC,CAAC;IACtF,CAAC;IACD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,UAAU;YACb,OAAO,QAAQ,GAAG,SAAS,CAAC;QAC9B,KAAK,UAAU,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACnF,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACpC,CAAC;QACD,KAAK,WAAW,EAAE,CAAC;YACjB,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;gBACrC,MAAM,IAAI,aAAa,CAAC,6DAA6D,CAAC,CAAC;YACzF,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,cAAc,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC3C,MAAM,IAAI,aAAa,CAAC,sDAAsD,CAAC,CAAC;YAClF,CAAC;YACD,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;QACxC,CAAC;QACD,KAAK,YAAY,EAAE,CAAC;YAClB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBAAE,MAAM,IAAI,aAAa,CAAC,6CAA6C,CAAC,CAAC;YACzF,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;YACzC,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,gBAAgB,CAAC;QACtB,KAAK,UAAU,CAAC;QAChB,KAAK,QAAQ;YACX,MAAM,IAAI,aAAa,CACrB,GAAG,IAAI,8DAA8D,CACtE,CAAC;QACJ,SAAS,CAAC;YACR,MAAM,MAAM,GAAU,IAAI,CAAC;YAC3B,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAClB,QAA2B,EAC3B,SAA4B,EAC5B,GAA0B,EAC1B,KAAK,GAAG,CAAC;IAET,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,IAAI,aAAa,CAAC,8CAA8C,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/F,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AACxD,CAAC","sourcesContent":["/**\n * Explicit residual / discrepancy evaluation. Does not replace\n * `residualInSigma` on the confrontation spine.\n *\n * @module composition/probe/residual\n */\n\nimport { norm2 } from '@danielsimonjr/mathts-core';\nimport type { DiscrepancyDefinition, DiscrepancyKind } from './types.js';\n\n/** The error that residual evaluation throws, for example on a non-finite value. */\nexport class ResidualError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'ResidualError';\n  }\n}\n\n/**\n * Scalar discrepancy. Covariance-standardized with a non-diagonal Σ is\n * unsupported and throws rather than silently using diagonal σ.\n *\n * @internal\n */\nexport function scalarDiscrepancy(\n  observed: number,\n  predicted: number,\n  kind: DiscrepancyKind,\n  scale = 1,\n): number {\n  if (!Number.isFinite(observed) || !Number.isFinite(predicted)) {\n    throw new ResidualError('scalarDiscrepancy: observed and predicted must be finite');\n  }\n  switch (kind) {\n    case 'additive':\n      return observed - predicted;\n    case 'relative': {\n      const s = scale !== 0 && Number.isFinite(scale) ? scale : Math.abs(predicted) || 1;\n      return (observed - predicted) / s;\n    }\n    case 'log-ratio': {\n      if (!(observed > 0 && predicted > 0)) {\n        throw new ResidualError('log-ratio residual requires positive observed and predicted');\n      }\n      return Math.log(observed / predicted);\n    }\n    case 'standardized': {\n      if (!(scale > 0 && Number.isFinite(scale))) {\n        throw new ResidualError('standardized residual requires positive finite sigma');\n      }\n      return (observed - predicted) / scale;\n    }\n    case 'likelihood': {\n      if (!(scale > 0)) throw new ResidualError('likelihood residual requires positive sigma');\n      const z = (observed - predicted) / scale;\n      return 0.5 * z * z + Math.log(scale * Math.sqrt(2 * Math.PI));\n    }\n    case 'vector':\n    case 'tensor':\n    case 'distributional':\n    case 'operator':\n    case 'custom':\n      throw new ResidualError(\n        `${kind} discrepancy is not implemented on the scalar path — abstain`,\n      );\n    default: {\n      const _never: never = kind;\n      return _never;\n    }\n  }\n}\n\n/**\n * RMSE of a discrepancy over paired samples: core `norm2` of the discrepancies\n * (the scaled, overflow-safe 2-norm) over √n. Empty or unequal-length samples\n * are refused, as before; a non-finite sample still throws from\n * {@link scalarDiscrepancy}. @internal\n */\nexport function rmse(\n  observed: readonly number[],\n  predicted: readonly number[],\n  def: DiscrepancyDefinition,\n  scale = 1,\n): number {\n  if (observed.length !== predicted.length || observed.length === 0) {\n    throw new ResidualError('rmse: nonempty equal-length samples required');\n  }\n  const residuals = observed.map((o, i) => scalarDiscrepancy(o, predicted[i]!, def.kind, scale));\n  return norm2(residuals) / Math.sqrt(residuals.length);\n}\n"]}

package/dist/composition/probe/run-manifest.d.ts

@@ -10,6 +10,7 @@ import type { DiscoveryBackendDescriptor, DiscoveryRunManifest, SearchBudget, Se
  * @internal
  */
 export { captureEnvironment } from '../canonical-json.js';
+/** The inputs from which openManifest builds one discovery run manifest. */
 export interface ManifestDraft {
     readonly runId: string;
     readonly repositoryCommit: string;

package/dist/composition/probe/run-manifest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"run-manifest.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,0BAA0B,EAC1B,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAIpB;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACpE,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,gFAAgF;AAChF,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,oBAAoB,CA0BvE;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,EAC1B,UAAU,EAAE,gBAAgB,EAC5B,WAAW,SAA2B,GACrC,oBAAoB,CAEtB"}
+{"version":3,"file":"run-manifest.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,0BAA0B,EAC1B,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAIpB;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,4EAA4E;AAC5E,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACpE,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,gFAAgF;AAChF,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,oBAAoB,CA0BvE;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,EAC1B,UAAU,EAAE,gBAAgB,EAC5B,WAAW,SAA2B,GACrC,oBAAoB,CAEtB"}

package/dist/composition/probe/run-manifest.js.map

@@ -1 +1 @@
-{"version":3,"file":"run-manifest.js","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEzE;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAc1D,gFAAgF;AAChF,MAAM,UAAU,YAAY,CAAC,KAAoB;IAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,UAAU,CAAC,mDAAmD,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO;QACL,aAAa,EAAE,cAAc;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,WAAW,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;QACzC,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE;QACxC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,IAAI;YAC9C;gBACE,eAAe,EAAE,GAAG;gBACpB,SAAS,EAAE,QAAQ;gBACnB,cAAc,EAAE,cAAc;gBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;gBACpC,aAAa,EAAE,KAAK;aACrB;SACF;QACD,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;QACpC,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE;QACpE,WAAW,EAAE,kBAAkB,EAAE;QACjC,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,qBAAqB;QACzD,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtD,cAAc,EAAE,EAAE;KACnB,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,IAA0B,EAC1B,UAA4B,EAC5B,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAEtC,OAAO,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC","sourcesContent":["/**\n * Discovery-run manifest construction (schema v0).\n *\n * @module composition/probe/run-manifest\n */\n\nimport type {\n  DiscoveryBackendDescriptor,\n  DiscoveryRunManifest,\n  SearchBudget,\n  SearchStopReason,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { captureEnvironment, hashCanonical } from '../canonical-json.js';\n\n/**\n * Capture host environment.\n *\n * @internal\n */\nexport { captureEnvironment } from '../canonical-json.js';\n\nexport interface ManifestDraft {\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problem: unknown;\n  readonly datasetHashes?: readonly string[];\n  readonly backendDescriptors?: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds?: Readonly<Record<string, string | number>>;\n  readonly tolerances?: Readonly<Record<string, number>>;\n  readonly searchBudget?: SearchBudget;\n  readonly startedAt?: string;\n}\n\n/** Open a run manifest (completedAt / stopReason filled at close). @internal */\nexport function openManifest(draft: ManifestDraft): DiscoveryRunManifest {\n  if (!draft.runId.startsWith('dr-')) {\n    throw new RangeError(`openManifest: runId must start with 'dr-' (got '${draft.runId}')`);\n  }\n  return {\n    schemaVersion: SCHEMA_VERSION,\n    runId: draft.runId,\n    repositoryCommit: draft.repositoryCommit,\n    problemHash: hashCanonical(draft.problem),\n    datasetHashes: draft.datasetHashes ?? [],\n    backendDescriptors: draft.backendDescriptors ?? [\n      {\n        protocolVersion: '0',\n        backendId: 'native',\n        backendVersion: SCHEMA_VERSION,\n        capabilities: ['grammar-enumerator'],\n        deterministic: 'yes',\n      },\n    ],\n    randomSeeds: draft.randomSeeds ?? {},\n    tolerances: draft.tolerances ?? { holdoutRmse: DEFAULT_HOLDOUT_TOL },\n    environment: captureEnvironment(),\n    searchBudget: draft.searchBudget ?? DEFAULT_SEARCH_BUDGET,\n    startedAt: draft.startedAt ?? new Date().toISOString(),\n    nondeterminism: [],\n  };\n}\n\n/** Close a manifest with stop reason and completion time. @internal */\nexport function closeManifest(\n  open: DiscoveryRunManifest,\n  stopReason: SearchStopReason,\n  completedAt = new Date().toISOString(),\n): DiscoveryRunManifest {\n  return { ...open, stopReason, completedAt };\n}\n"]}
+{"version":3,"file":"run-manifest.js","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEzE;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAe1D,gFAAgF;AAChF,MAAM,UAAU,YAAY,CAAC,KAAoB;IAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,UAAU,CAAC,mDAAmD,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO;QACL,aAAa,EAAE,cAAc;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,WAAW,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;QACzC,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE;QACxC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,IAAI;YAC9C;gBACE,eAAe,EAAE,GAAG;gBACpB,SAAS,EAAE,QAAQ;gBACnB,cAAc,EAAE,cAAc;gBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;gBACpC,aAAa,EAAE,KAAK;aACrB;SACF;QACD,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;QACpC,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE;QACpE,WAAW,EAAE,kBAAkB,EAAE;QACjC,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,qBAAqB;QACzD,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtD,cAAc,EAAE,EAAE;KACnB,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,IAA0B,EAC1B,UAA4B,EAC5B,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAEtC,OAAO,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC","sourcesContent":["/**\n * Discovery-run manifest construction (schema v0).\n *\n * @module composition/probe/run-manifest\n */\n\nimport type {\n  DiscoveryBackendDescriptor,\n  DiscoveryRunManifest,\n  SearchBudget,\n  SearchStopReason,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { captureEnvironment, hashCanonical } from '../canonical-json.js';\n\n/**\n * Capture host environment.\n *\n * @internal\n */\nexport { captureEnvironment } from '../canonical-json.js';\n\n/** The inputs from which openManifest builds one discovery run manifest. */\nexport interface ManifestDraft {\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problem: unknown;\n  readonly datasetHashes?: readonly string[];\n  readonly backendDescriptors?: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds?: Readonly<Record<string, string | number>>;\n  readonly tolerances?: Readonly<Record<string, number>>;\n  readonly searchBudget?: SearchBudget;\n  readonly startedAt?: string;\n}\n\n/** Open a run manifest (completedAt / stopReason filled at close). @internal */\nexport function openManifest(draft: ManifestDraft): DiscoveryRunManifest {\n  if (!draft.runId.startsWith('dr-')) {\n    throw new RangeError(`openManifest: runId must start with 'dr-' (got '${draft.runId}')`);\n  }\n  return {\n    schemaVersion: SCHEMA_VERSION,\n    runId: draft.runId,\n    repositoryCommit: draft.repositoryCommit,\n    problemHash: hashCanonical(draft.problem),\n    datasetHashes: draft.datasetHashes ?? [],\n    backendDescriptors: draft.backendDescriptors ?? [\n      {\n        protocolVersion: '0',\n        backendId: 'native',\n        backendVersion: SCHEMA_VERSION,\n        capabilities: ['grammar-enumerator'],\n        deterministic: 'yes',\n      },\n    ],\n    randomSeeds: draft.randomSeeds ?? {},\n    tolerances: draft.tolerances ?? { holdoutRmse: DEFAULT_HOLDOUT_TOL },\n    environment: captureEnvironment(),\n    searchBudget: draft.searchBudget ?? DEFAULT_SEARCH_BUDGET,\n    startedAt: draft.startedAt ?? new Date().toISOString(),\n    nondeterminism: [],\n  };\n}\n\n/** Close a manifest with stop reason and completion time. @internal */\nexport function closeManifest(\n  open: DiscoveryRunManifest,\n  stopReason: SearchStopReason,\n  completedAt = new Date().toISOString(),\n): DiscoveryRunManifest {\n  return { ...open, stopReason, completedAt };\n}\n"]}

package/dist/composition/probe/scalar-search.d.ts

@@ -0,0 +1,50 @@
+/**
+ * MathTS scalar-search trees as UPT probe candidates (plan task P5).
+ *
+ * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.
+ * `dimensionToRational` converts a UPT `Dimension` to the MathTS
+ * `SiDimensionVector` that the search's `dimensions` filter reads.
+ *
+ * @module composition/probe/scalar-search
+ */
+import { type ScalarNode, type ScalarOperator } from '@danielsimonjr/mathts-expression';
+import type { SiDimensionVector } from '@danielsimonjr/mathts-core';
+import type { ExprNode } from '../../dimensional/validator.js';
+import type { Dimension } from '../../dimensional/types.js';
+import type { RawCandidate } from './generator.js';
+import type { SearchProblem } from './types.js';
+/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */
+export declare function scalarNodeToExpr(node: ScalarNode, variables: ReadonlyMap<string, Dimension>): ExprNode;
+/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */
+export declare function dimensionToRational(dim: Dimension): SiDimensionVector;
+/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */
+export declare class UnsupportedScalarFunctionError extends Error {
+    constructor(name: string);
+}
+/** Options of the opt-in MathTS scalar search (plan task P5). @internal */
+export interface ProbeScalarSearchOptions {
+    /** Seed of the MathTS random stream. */
+    readonly seed: number;
+    /** Cap on tree evaluations. */
+    readonly maxEvaluations: number;
+    /** Binary operators of the grammar. */
+    readonly binary: readonly ScalarOperator[];
+    /** Unary functions of the grammar, by MathTS input name. Default none. */
+    readonly unary?: readonly string[];
+    /** Largest tree size. Default 7. */
+    readonly maxSize?: number;
+}
+/** The `originNote` and the backend id of a scalar-search candidate. @internal */
+export declare const SCALAR_SEARCH_ORIGIN = "mathts-scalar-search";
+/**
+ * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted
+ * parameters), and converts each front tree to a raw probe candidate. A front tree with no
+ * UPT form is skipped and counted in the note.
+ * @throws Error when the grammar lists a function with no UPT form.
+ * @internal
+ */
+export declare function scalarSearchCandidates(problem: SearchProblem, opts: ProbeScalarSearchOptions, budgetMs: number): Promise<{
+    readonly raws: readonly RawCandidate[];
+    readonly note?: string;
+}>;
+//# sourceMappingURL=scalar-search.d.ts.map

package/dist/composition/probe/scalar-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalar-search.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scalar-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAGL,KAAK,UAAU,EACf,KAAK,cAAc,EACpB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAY,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAG9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAE5D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAgChD,iLAAiL;AACjL,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,GACxC,QAAQ,CAoBV;AAQD,8KAA8K;AAC9K,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,SAAS,GAAG,iBAAiB,CAUrE;AAED,gHAAgH;AAChH,qBAAa,8BAA+B,SAAQ,KAAK;IACvD,YAAY,IAAI,EAAE,MAAM,EAGvB;CACF;AAED,2EAA2E;AAC3E,MAAM,WAAW,wBAAwB;IACvC,wCAAwC;IACxC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,+BAA+B;IAC/B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,CAAC;IAC3C,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,oCAAoC;IACpC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,kFAAkF;AAClF,eAAO,MAAM,oBAAoB,yBAAyB,CAAC;AA4B3D;;;;;;GAMG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,EAAE,aAAa,EACtB,IAAI,EAAE,wBAAwB,EAC9B,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAC;IAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAmD7E"}

package/dist/composition/probe/scalar-search.js

@@ -0,0 +1,169 @@
+/**
+ * MathTS scalar-search trees as UPT probe candidates (plan task P5).
+ *
+ * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.
+ * `dimensionToRational` converts a UPT `Dimension` to the MathTS
+ * `SiDimensionVector` that the search's `dimensions` filter reads.
+ *
+ * @module composition/probe/scalar-search
+ */
+import { SCALAR_FUNCTION_LOWERING, } from '@danielsimonjr/mathts-expression';
+import { runScalarSearch } from '@danielsimonjr/mathts-functions';
+import { rationalize } from '../rational-exponent.js';
+const ZERO_DIMENSION = { L: 0, M: 0, T: 0, I: 0, Theta: 0, N: 0, J: 0 };
+const UPT_TRANSCENDENTAL_NAMES = new Set([
+    'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',
+]);
+function isTranscendentalFn(name) {
+    return UPT_TRANSCENDENTAL_NAMES.has(name);
+}
+/**
+ * The inverse of MathTS `SCALAR_FUNCTION_LOWERING`, restricted to the UPT
+ * transcendental names. The table is not one-to-one (`log` and `log10` both
+ * lower to `log10`), so an input name equal to its lowered name wins.
+ */
+const TRANSCENDENTAL_BY_LOWERED = (() => {
+    const inverse = new Map();
+    for (const [inputName, loweredName] of Object.entries(SCALAR_FUNCTION_LOWERING)) {
+        if (!isTranscendentalFn(inputName))
+            continue;
+        if (!inverse.has(loweredName) || inputName === loweredName)
+            inverse.set(loweredName, inputName);
+    }
+    return inverse;
+})();
+function literal(name) {
+    return { kind: 'symbol', name, dim: ZERO_DIMENSION };
+}
+/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */
+export function scalarNodeToExpr(node, variables) {
+    switch (node.kind) {
+        case 'number':
+            return literal(String(node.value));
+        case 'symbol': {
+            const dim = variables.get(node.name);
+            if (dim === undefined)
+                throw new Error(`scalar search: unknown symbol '${node.name}'`);
+            return { kind: 'symbol', name: node.name, dim };
+        }
+        case 'op':
+            return { kind: 'op', op: node.op, args: node.args.map((a) => scalarNodeToExpr(a, variables)) };
+        case 'call': {
+            const arg = scalarNodeToExpr(node.arg, variables);
+            if (node.fn === 'abs')
+                return { kind: 'abs', arg };
+            if (node.fn === 'sqrt')
+                return { kind: 'op', op: '^', args: [arg, literal('0.5')] };
+            const fn = TRANSCENDENTAL_BY_LOWERED.get(node.fn);
+            if (fn === undefined)
+                throw new Error(`scalar search: function '${node.fn}' has no UPT form`);
+            return { kind: 'transcendental', fn, arg };
+        }
+    }
+}
+function rationalAxis(axis, value) {
+    const f = rationalize(value);
+    if (f === undefined)
+        throw new RangeError(`scalar search: dimension ${axis} = ${value} is not rational`);
+    return f;
+}
+/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */
+export function dimensionToRational(dim) {
+    return [
+        rationalAxis('L', dim.L),
+        rationalAxis('M', dim.M),
+        rationalAxis('T', dim.T),
+        rationalAxis('I', dim.I),
+        rationalAxis('Theta', dim.Theta),
+        rationalAxis('N', dim.N),
+        rationalAxis('J', dim.J),
+    ];
+}
+/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */
+export class UnsupportedScalarFunctionError extends Error {
+    constructor(name) {
+        super(`scalar search: function '${name}' has no UPT form`);
+        this.name = 'UnsupportedScalarFunctionError';
+    }
+}
+/** The `originNote` and the backend id of a scalar-search candidate. @internal */
+export const SCALAR_SEARCH_ORIGIN = 'mathts-scalar-search';
+/** MathTS input names whose lowered form has a UPT form, read from the same table the converter reads. */
+const UNARY_WITH_UPT_FORM = new Set(Object.entries(SCALAR_FUNCTION_LOWERING)
+    .filter(([, lowered]) => TRANSCENDENTAL_BY_LOWERED.has(lowered) || lowered === 'abs' || lowered === 'sqrt')
+    .map(([input]) => input));
+function isLoweringKey(name) {
+    return Object.prototype.hasOwnProperty.call(SCALAR_FUNCTION_LOWERING, name);
+}
+function loweredName(name) {
+    if (!isLoweringKey(name))
+        throw new Error(`scalar search: unknown function '${name}'`);
+    return SCALAR_FUNCTION_LOWERING[name];
+}
+function column(rows, name) {
+    return Float64Array.from(rows, (row) => {
+        const v = row[name];
+        if (v === undefined)
+            throw new RangeError(`scalar search: a row has no '${name}'`);
+        return v;
+    });
+}
+/**
+ * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted
+ * parameters), and converts each front tree to a raw probe candidate. A front tree with no
+ * UPT form is skipped and counted in the note.
+ * @throws Error when the grammar lists a function with no UPT form.
+ * @internal
+ */
+export async function scalarSearchCandidates(problem, opts, budgetMs) {
+    const unary = opts.unary ?? [];
+    for (const name of unary) {
+        if (!UNARY_WITH_UPT_FORM.has(name))
+            throw new UnsupportedScalarFunctionError(name);
+    }
+    const data = problem.exploratory;
+    if (data === undefined || data.rows.length === 0) {
+        return { raws: [], note: 'scalar search did not run: no exploratory data' };
+    }
+    const rows = data.rows;
+    const names = problem.governing.map((g) => g.name);
+    const columns = {};
+    for (const name of names)
+        columns[name] = column(rows, name);
+    const symbols = {};
+    for (const g of problem.governing)
+        symbols[g.name] = dimensionToRational(g.dim);
+    const grammar = {
+        variables: names,
+        parameters: [],
+        binary: opts.binary,
+        unary: unary.map(loweredName),
+        maxSize: opts.maxSize ?? 7,
+    };
+    const result = await runScalarSearch({ variables: names, columns, observed: column(rows, data.observable), parameters: [] }, {
+        seed: opts.seed,
+        grammar,
+        maxEvaluations: opts.maxEvaluations,
+        signal: AbortSignal.timeout(Math.max(1, Math.floor(budgetMs))),
+        dimensions: { symbols, target: dimensionToRational(problem.target.dim) },
+    });
+    const variables = new Map(problem.governing.map((g) => [g.name, g.dim]));
+    const raws = [];
+    let skipped = 0;
+    for (const entry of result.front) {
+        try {
+            raws.push({ expression: scalarNodeToExpr(entry.item, variables), monomial: null, originNote: SCALAR_SEARCH_ORIGIN });
+        }
+        catch {
+            skipped += 1;
+        }
+    }
+    const notes = [];
+    if (result.stopReason !== 'max-evaluations') {
+        notes.push(`scalar search stopped: ${result.stopReason} after ${result.evaluations} evaluation(s)`);
+    }
+    if (skipped > 0)
+        notes.push(`scalar search: ${skipped} front tree(s) had no UPT form`);
+    return notes.length > 0 ? { raws, note: notes.join('; ') } : { raws };
+}
+//# sourceMappingURL=scalar-search.js.map

package/dist/composition/probe/scalar-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalar-search.js","sourceRoot":"","sources":["../../../src/composition/probe/scalar-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,wBAAwB,GAIzB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAIlE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAMtD,MAAM,cAAc,GAAc,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAEnF,MAAM,wBAAwB,GAAwB,IAAI,GAAG,CAAC;IAC5D,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAC1E,CAAC,CAAC;AAEH,SAAS,kBAAkB,CAAC,IAAY;IACtC,OAAO,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,yBAAyB,GAA0C,CAAC,GAAG,EAAE;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4B,CAAC;IACpD,KAAK,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC,EAAE,CAAC;QAChF,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC;YAAE,SAAS;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,SAAS,KAAK,WAAW;YAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC,EAAE,CAAC;AAEL,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;AACvD,CAAC;AAED,iLAAiL;AACjL,MAAM,UAAU,gBAAgB,CAC9B,IAAgB,EAChB,SAAyC;IAEzC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACrC,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACvF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC;QAClD,CAAC;QACD,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;QACjG,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAClD,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,EAAE,GAAG,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,EAAE,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC9F,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,KAAa;IAC/C,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC7B,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,IAAI,MAAM,KAAK,kBAAkB,CAAC,CAAC;IACzG,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8KAA8K;AAC9K,MAAM,UAAU,mBAAmB,CAAC,GAAc;IAChD,OAAO;QACL,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC;QAChC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;KACzB,CAAC;AACJ,CAAC;AAED,gHAAgH;AAChH,MAAM,OAAO,8BAA+B,SAAQ,KAAK;IACvD,YAAY,IAAY;QACtB,KAAK,CAAC,4BAA4B,IAAI,mBAAmB,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI,GAAG,gCAAgC,CAAC;IAC/C,CAAC;CACF;AAgBD,kFAAkF;AAClF,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAC;AAE3D,0GAA0G;AAC1G,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CACtD,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC;KACrC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC;KAC1G,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAC3B,CAAC;AAIF,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,GAAG,CAAC,CAAC;IACvF,OAAO,wBAAwB,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,MAAM,CAAC,IAAiD,EAAE,IAAY;IAC7E,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,IAAI,UAAU,CAAC,gCAAgC,IAAI,GAAG,CAAC,CAAC;QACnF,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAsB,EACtB,IAA8B,EAC9B,QAAgB;IAEhB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,8BAA8B,CAAC,IAAI,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC;IACjC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,gDAAgD,EAAE,CAAC;IAC9E,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,OAAO,GAAiC,EAAE,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,SAAS;QAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChF,MAAM,OAAO,GAAkB;QAC7B,SAAS,EAAE,KAAK;QAChB,UAAU,EAAE,EAAE;QACd,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC;QAC7B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC;KAC3B,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,eAAe,CAClC,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,EACtF;QACE,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO;QACP,cAAc,EAAE,IAAI,CAAC,cAAc;QACnC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC9D,UAAU,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;KACzE,CACF,CAAC;IAEF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC,CAAC;QACvH,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,MAAM,CAAC,UAAU,KAAK,iBAAiB,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,0BAA0B,MAAM,CAAC,UAAU,UAAU,MAAM,CAAC,WAAW,gBAAgB,CAAC,CAAC;IACtG,CAAC;IACD,IAAI,OAAO,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,OAAO,gCAAgC,CAAC,CAAC;IACvF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;AACxE,CAAC","sourcesContent":["/**\n * MathTS scalar-search trees as UPT probe candidates (plan task P5).\n *\n * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.\n * `dimensionToRational` converts a UPT `Dimension` to the MathTS\n * `SiDimensionVector` that the search's `dimensions` filter reads.\n *\n * @module composition/probe/scalar-search\n */\n\nimport {\n  SCALAR_FUNCTION_LOWERING,\n  type ScalarGrammar,\n  type ScalarNode,\n  type ScalarOperator,\n} from '@danielsimonjr/mathts-expression';\nimport type { Fraction, SiDimensionVector } from '@danielsimonjr/mathts-core';\nimport { runScalarSearch } from '@danielsimonjr/mathts-functions';\n\nimport type { ExprNode } from '../../dimensional/validator.js';\nimport type { Dimension } from '../../dimensional/types.js';\nimport { rationalize } from '../rational-exponent.js';\nimport type { RawCandidate } from './generator.js';\nimport type { SearchProblem } from './types.js';\n\ntype TranscendentalFn = Extract<ExprNode, { kind: 'transcendental' }>['fn'];\n\nconst ZERO_DIMENSION: Dimension = { L: 0, M: 0, T: 0, I: 0, Theta: 0, N: 0, J: 0 };\n\nconst UPT_TRANSCENDENTAL_NAMES: ReadonlySet<string> = new Set([\n  'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',\n]);\n\nfunction isTranscendentalFn(name: string): name is TranscendentalFn {\n  return UPT_TRANSCENDENTAL_NAMES.has(name);\n}\n\n/**\n * The inverse of MathTS `SCALAR_FUNCTION_LOWERING`, restricted to the UPT\n * transcendental names. The table is not one-to-one (`log` and `log10` both\n * lower to `log10`), so an input name equal to its lowered name wins.\n */\nconst TRANSCENDENTAL_BY_LOWERED: ReadonlyMap<string, TranscendentalFn> = (() => {\n  const inverse = new Map<string, TranscendentalFn>();\n  for (const [inputName, loweredName] of Object.entries(SCALAR_FUNCTION_LOWERING)) {\n    if (!isTranscendentalFn(inputName)) continue;\n    if (!inverse.has(loweredName) || inputName === loweredName) inverse.set(loweredName, inputName);\n  }\n  return inverse;\n})();\n\nfunction literal(name: string): ExprNode {\n  return { kind: 'symbol', name, dim: ZERO_DIMENSION };\n}\n\n/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */\nexport function scalarNodeToExpr(\n  node: ScalarNode,\n  variables: ReadonlyMap<string, Dimension>,\n): ExprNode {\n  switch (node.kind) {\n    case 'number':\n      return literal(String(node.value));\n    case 'symbol': {\n      const dim = variables.get(node.name);\n      if (dim === undefined) throw new Error(`scalar search: unknown symbol '${node.name}'`);\n      return { kind: 'symbol', name: node.name, dim };\n    }\n    case 'op':\n      return { kind: 'op', op: node.op, args: node.args.map((a) => scalarNodeToExpr(a, variables)) };\n    case 'call': {\n      const arg = scalarNodeToExpr(node.arg, variables);\n      if (node.fn === 'abs') return { kind: 'abs', arg };\n      if (node.fn === 'sqrt') return { kind: 'op', op: '^', args: [arg, literal('0.5')] };\n      const fn = TRANSCENDENTAL_BY_LOWERED.get(node.fn);\n      if (fn === undefined) throw new Error(`scalar search: function '${node.fn}' has no UPT form`);\n      return { kind: 'transcendental', fn, arg };\n    }\n  }\n}\n\nfunction rationalAxis(axis: string, value: number): Fraction {\n  const f = rationalize(value);\n  if (f === undefined) throw new RangeError(`scalar search: dimension ${axis} = ${value} is not rational`);\n  return f;\n}\n\n/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */\nexport function dimensionToRational(dim: Dimension): SiDimensionVector {\n  return [\n    rationalAxis('L', dim.L),\n    rationalAxis('M', dim.M),\n    rationalAxis('T', dim.T),\n    rationalAxis('I', dim.I),\n    rationalAxis('Theta', dim.Theta),\n    rationalAxis('N', dim.N),\n    rationalAxis('J', dim.J),\n  ];\n}\n\n/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */\nexport class UnsupportedScalarFunctionError extends Error {\n  constructor(name: string) {\n    super(`scalar search: function '${name}' has no UPT form`);\n    this.name = 'UnsupportedScalarFunctionError';\n  }\n}\n\n/** Options of the opt-in MathTS scalar search (plan task P5). @internal */\nexport interface ProbeScalarSearchOptions {\n  /** Seed of the MathTS random stream. */\n  readonly seed: number;\n  /** Cap on tree evaluations. */\n  readonly maxEvaluations: number;\n  /** Binary operators of the grammar. */\n  readonly binary: readonly ScalarOperator[];\n  /** Unary functions of the grammar, by MathTS input name. Default none. */\n  readonly unary?: readonly string[];\n  /** Largest tree size. Default 7. */\n  readonly maxSize?: number;\n}\n\n/** The `originNote` and the backend id of a scalar-search candidate. @internal */\nexport const SCALAR_SEARCH_ORIGIN = 'mathts-scalar-search';\n\n/** MathTS input names whose lowered form has a UPT form, read from the same table the converter reads. */\nconst UNARY_WITH_UPT_FORM: ReadonlySet<string> = new Set(\n  Object.entries(SCALAR_FUNCTION_LOWERING)\n    .filter(([, lowered]) => TRANSCENDENTAL_BY_LOWERED.has(lowered) || lowered === 'abs' || lowered === 'sqrt')\n    .map(([input]) => input),\n);\n\ntype LoweredFn = (typeof SCALAR_FUNCTION_LOWERING)[keyof typeof SCALAR_FUNCTION_LOWERING];\n\nfunction isLoweringKey(name: string): name is keyof typeof SCALAR_FUNCTION_LOWERING {\n  return Object.prototype.hasOwnProperty.call(SCALAR_FUNCTION_LOWERING, name);\n}\n\nfunction loweredName(name: string): LoweredFn {\n  if (!isLoweringKey(name)) throw new Error(`scalar search: unknown function '${name}'`);\n  return SCALAR_FUNCTION_LOWERING[name];\n}\n\nfunction column(rows: readonly Readonly<Record<string, number>>[], name: string): Float64Array {\n  return Float64Array.from(rows, (row) => {\n    const v = row[name];\n    if (v === undefined) throw new RangeError(`scalar search: a row has no '${name}'`);\n    return v;\n  });\n}\n\n/**\n * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted\n * parameters), and converts each front tree to a raw probe candidate. A front tree with no\n * UPT form is skipped and counted in the note.\n * @throws Error when the grammar lists a function with no UPT form.\n * @internal\n */\nexport async function scalarSearchCandidates(\n  problem: SearchProblem,\n  opts: ProbeScalarSearchOptions,\n  budgetMs: number,\n): Promise<{ readonly raws: readonly RawCandidate[]; readonly note?: string }> {\n  const unary = opts.unary ?? [];\n  for (const name of unary) {\n    if (!UNARY_WITH_UPT_FORM.has(name)) throw new UnsupportedScalarFunctionError(name);\n  }\n  const data = problem.exploratory;\n  if (data === undefined || data.rows.length === 0) {\n    return { raws: [], note: 'scalar search did not run: no exploratory data' };\n  }\n  const rows = data.rows;\n\n  const names = problem.governing.map((g) => g.name);\n  const columns: Record<string, Float64Array> = {};\n  for (const name of names) columns[name] = column(rows, name);\n  const symbols: Record<string, SiDimensionVector> = {};\n  for (const g of problem.governing) symbols[g.name] = dimensionToRational(g.dim);\n  const grammar: ScalarGrammar = {\n    variables: names,\n    parameters: [],\n    binary: opts.binary,\n    unary: unary.map(loweredName),\n    maxSize: opts.maxSize ?? 7,\n  };\n\n  const result = await runScalarSearch(\n    { variables: names, columns, observed: column(rows, data.observable), parameters: [] },\n    {\n      seed: opts.seed,\n      grammar,\n      maxEvaluations: opts.maxEvaluations,\n      signal: AbortSignal.timeout(Math.max(1, Math.floor(budgetMs))),\n      dimensions: { symbols, target: dimensionToRational(problem.target.dim) },\n    },\n  );\n\n  const variables = new Map(problem.governing.map((g) => [g.name, g.dim]));\n  const raws: RawCandidate[] = [];\n  let skipped = 0;\n  for (const entry of result.front) {\n    try {\n      raws.push({ expression: scalarNodeToExpr(entry.item, variables), monomial: null, originNote: SCALAR_SEARCH_ORIGIN });\n    } catch {\n      skipped += 1;\n    }\n  }\n  const notes: string[] = [];\n  if (result.stopReason !== 'max-evaluations') {\n    notes.push(`scalar search stopped: ${result.stopReason} after ${result.evaluations} evaluation(s)`);\n  }\n  if (skipped > 0) notes.push(`scalar search: ${skipped} front tree(s) had no UPT form`);\n  return notes.length > 0 ? { raws, note: notes.join('; ') } : { raws };\n}\n"]}

package/dist/composition/probe/scoring.d.ts

@@ -7,6 +7,7 @@ import type { ProbeCandidateRecord, ScoreVector } from './types.js';
 import type { FalsifyResult } from './falsify.js';
 /** Build a score vector. @internal */
 export declare function scoreCandidate(record: ProbeCandidateRecord, empirical?: number, corpusDistance?: number, falsification?: FalsifyResult): ScoreVector;
+/** One probe candidate with its scores and whether it is on the Pareto front. */
 export interface RankedCandidate {
     readonly record: ProbeCandidateRecord;
     readonly scores: ScoreVector;

package/dist/composition/probe/scoring.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AA2BlD,sCAAsC;AACtC,wBAAgB,cAAc,CAC5B,MAAM,EAAE,oBAAoB,EAC5B,SAAS,SAAI,EACb,cAAc,SAAI,EAClB,aAAa,CAAC,EAAE,aAAa,GAC5B,WAAW,CAWb;AAkBD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,0EAA0E;AAC1E,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS;IAAE,MAAM,EAAE,oBAAoB,CAAC;IAAC,MAAM,EAAE,WAAW,CAAA;CAAE,EAAE,GACtE,eAAe,EAAE,CASnB"}
+{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AA2BlD,sCAAsC;AACtC,wBAAgB,cAAc,CAC5B,MAAM,EAAE,oBAAoB,EAC5B,SAAS,SAAI,EACb,cAAc,SAAI,EAClB,aAAa,CAAC,EAAE,aAAa,GAC5B,WAAW,CAWb;AAkBD,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,0EAA0E;AAC1E,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS;IAAE,MAAM,EAAE,oBAAoB,CAAC;IAAC,MAAM,EAAE,WAAW,CAAA;CAAE,EAAE,GACtE,eAAe,EAAE,CASnB"}

package/dist/composition/probe/scoring.js.map

@@ -1 +1 @@
-{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAA4B,EAAE,aAAwC;IAC1F,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAChF,OAAO,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,KAAK,mBAAmB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,GAAG,CAAC;AACV,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,SAAS,GAAG,CAAC,EACb,cAAc,GAAG,CAAC,EAClB,aAA6B;IAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC;QAC7B,SAAS;QACT,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC;QACvC,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAc,EAAE,CAAc;IAC/C,MAAM,IAAI,GAA0B;QAClC,UAAU;QACV,WAAW;QACX,WAAW;QACX,gBAAgB;QAChB,YAAY;KACb,CAAC;IACF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,MAAM,GAAG,IAAI,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAQD,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CACxB,KAAuE;IAEvE,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACZ,GAAG,EAAE;QACL,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CACjB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAClF;KACF,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACnG,CAAC","sourcesContent":["/**\n * Pareto scoring for probe candidates. Does not touch `VettedCandidate.score`.\n *\n * @module composition/probe/scoring\n */\n\nimport type { ProbeCandidateRecord, ScoreVector } from './types.js';\nimport type { FalsifyResult } from './falsify.js';\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0;\n  return Math.min(1, Math.max(0, x));\n}\n\n/**\n * Robustness is what the falsification batteries recorded: the fraction of\n * the batteries that ran and passed (an `inconclusive` battery did not pass).\n * It is not read from the status label: a survivor awaiting expert review\n * was once scored 1 by its label alone, while two of the five listed\n * batteries could never fail (9.0.0 audit §4 Low). Without a falsification\n * record only the holdout stage is known: 0.7 past the holdout, 0.2 before.\n */\nfunction robustnessOf(record: ProbeCandidateRecord, falsification: FalsifyResult | undefined): number {\n  if (falsification !== undefined && falsification.records.length > 0) {\n    const passed = falsification.records.filter((r) => r.outcome === 'pass').length;\n    return passed / falsification.records.length;\n  }\n  return record.status === 'heldout-supported' ||\n    record.status === 'falsification-survivor' ||\n    record.status === 'expert-review-required'\n    ? 0.7\n    : 0.2;\n}\n\n/** Build a score vector. @internal */\nexport function scoreCandidate(\n  record: ProbeCandidateRecord,\n  empirical = 0,\n  corpusDistance = 1,\n  falsification?: FalsifyResult,\n): ScoreVector {\n  const parsimony = clamp01(1 / (1 + record.complexity.astNodes / 8));\n  const validity = record.fingerprint.dimensionalSignature === 'invalid' ? 0 : 1;\n  const robustness = robustnessOf(record, falsification);\n  return {\n    validity,\n    empirical: clamp01(empirical),\n    parsimony,\n    corpusDistance: clamp01(corpusDistance),\n    robustness,\n  };\n}\n\nfunction dominates(a: ScoreVector, b: ScoreVector): boolean {\n  const keys: (keyof ScoreVector)[] = [\n    'validity',\n    'empirical',\n    'parsimony',\n    'corpusDistance',\n    'robustness',\n  ];\n  let better = false;\n  for (const k of keys) {\n    if (a[k] < b[k] - 1e-12) return false;\n    if (a[k] > b[k] + 1e-12) better = true;\n  }\n  return better;\n}\n\nexport interface RankedCandidate {\n  readonly record: ProbeCandidateRecord;\n  readonly scores: ScoreVector;\n  readonly pareto: boolean;\n}\n\n/** Pareto front (non-dominated) plus the rest, stable by id. @internal */\nexport function rankPareto(\n  items: readonly { record: ProbeCandidateRecord; scores: ScoreVector }[],\n): RankedCandidate[] {\n  return items\n    .map((it) => ({\n      ...it,\n      pareto: !items.some(\n        (other) => other.record.id !== it.record.id && dominates(other.scores, it.scores),\n      ),\n    }))\n    .sort((a, b) => Number(b.pareto) - Number(a.pareto) || a.record.id.localeCompare(b.record.id));\n}\n"]}
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAA4B,EAAE,aAAwC;IAC1F,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAChF,OAAO,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,KAAK,mBAAmB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,GAAG,CAAC;AACV,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,SAAS,GAAG,CAAC,EACb,cAAc,GAAG,CAAC,EAClB,aAA6B;IAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC;QAC7B,SAAS;QACT,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC;QACvC,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAc,EAAE,CAAc;IAC/C,MAAM,IAAI,GAA0B;QAClC,UAAU;QACV,WAAW;QACX,WAAW;QACX,gBAAgB;QAChB,YAAY;KACb,CAAC;IACF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,MAAM,GAAG,IAAI,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AASD,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CACxB,KAAuE;IAEvE,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACZ,GAAG,EAAE;QACL,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CACjB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAClF;KACF,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACnG,CAAC","sourcesContent":["/**\n * Pareto scoring for probe candidates. Does not touch `VettedCandidate.score`.\n *\n * @module composition/probe/scoring\n */\n\nimport type { ProbeCandidateRecord, ScoreVector } from './types.js';\nimport type { FalsifyResult } from './falsify.js';\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0;\n  return Math.min(1, Math.max(0, x));\n}\n\n/**\n * Robustness is what the falsification batteries recorded: the fraction of\n * the batteries that ran and passed (an `inconclusive` battery did not pass).\n * It is not read from the status label: a survivor awaiting expert review\n * was once scored 1 by its label alone, while two of the five listed\n * batteries could never fail (9.0.0 audit §4 Low). Without a falsification\n * record only the holdout stage is known: 0.7 past the holdout, 0.2 before.\n */\nfunction robustnessOf(record: ProbeCandidateRecord, falsification: FalsifyResult | undefined): number {\n  if (falsification !== undefined && falsification.records.length > 0) {\n    const passed = falsification.records.filter((r) => r.outcome === 'pass').length;\n    return passed / falsification.records.length;\n  }\n  return record.status === 'heldout-supported' ||\n    record.status === 'falsification-survivor' ||\n    record.status === 'expert-review-required'\n    ? 0.7\n    : 0.2;\n}\n\n/** Build a score vector. @internal */\nexport function scoreCandidate(\n  record: ProbeCandidateRecord,\n  empirical = 0,\n  corpusDistance = 1,\n  falsification?: FalsifyResult,\n): ScoreVector {\n  const parsimony = clamp01(1 / (1 + record.complexity.astNodes / 8));\n  const validity = record.fingerprint.dimensionalSignature === 'invalid' ? 0 : 1;\n  const robustness = robustnessOf(record, falsification);\n  return {\n    validity,\n    empirical: clamp01(empirical),\n    parsimony,\n    corpusDistance: clamp01(corpusDistance),\n    robustness,\n  };\n}\n\nfunction dominates(a: ScoreVector, b: ScoreVector): boolean {\n  const keys: (keyof ScoreVector)[] = [\n    'validity',\n    'empirical',\n    'parsimony',\n    'corpusDistance',\n    'robustness',\n  ];\n  let better = false;\n  for (const k of keys) {\n    if (a[k] < b[k] - 1e-12) return false;\n    if (a[k] > b[k] + 1e-12) better = true;\n  }\n  return better;\n}\n\n/** One probe candidate with its scores and whether it is on the Pareto front. */\nexport interface RankedCandidate {\n  readonly record: ProbeCandidateRecord;\n  readonly scores: ScoreVector;\n  readonly pareto: boolean;\n}\n\n/** Pareto front (non-dominated) plus the rest, stable by id. @internal */\nexport function rankPareto(\n  items: readonly { record: ProbeCandidateRecord; scores: ScoreVector }[],\n): RankedCandidate[] {\n  return items\n    .map((it) => ({\n      ...it,\n      pareto: !items.some(\n        (other) => other.record.id !== it.record.id && dominates(other.scores, it.scores),\n      ),\n    }))\n    .sort((a, b) => Number(b.pareto) - Number(a.pareto) || a.record.id.localeCompare(b.record.id));\n}\n"]}

package/dist/composition/probe/study.d.ts

@@ -187,8 +187,8 @@ export declare function studyCsvToRaw(text: string, source?: string): Record<str
 /** P(χ²_ν ≥ chi2): the probability of a χ² at least this large if the model and σ are right. @internal */
 export declare function chiSquareSurvival(chi2: number, dof: number): number;
 /**
- * P(χ²_ν ≤ chi2), computed directly in the lower tail (MathTS `gammainc` is
- * the series there), where 1 − Q would round a small probability away. @internal
+ * P(χ²_ν ≤ chi2), MathTS `chiSquaredCDF`. It is direct in the lower tail, where
+ * 1 − Q would round a small probability away. @internal
  */
 export declare function chiSquareCdf(chi2: number, dof: number): number;
 /** P(F_{d1,d2} ≥ f): the probability of an F ratio at least this large if the extra terms explain nothing. @internal */