universal-physics-tensor 9.0.0 → 10.0.0

package/dist/bridges/caller-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"caller-table.js","sourceRoot":"","sources":["../../src/bridges/caller-table.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAiD1D,SAAS,KAAK,CAAC,KAAyB;IACtC,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,aAAa,CAAC,OAA2B;IAChD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,OAAO,CAAC,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IACpC,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAClC,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,OAAO,SAAS,KAAK,UAAU,EAAE,CAAC;QACpC,OAAO,CAAC,IAAI,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;QAChD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACvE,IAAI,OAAO,SAAS,CAAC,EAAE,KAAK,UAAU;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAC1E,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,KAAqC;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5E,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YAC1F,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,CAAC,QAAQ,KAAK,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACtG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,+BAA+B,CAAC,OAAO,GAAuB,EAAE;IAC9E,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;IAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IAE7E,MAAM,SAAS,GAAG,OAAO,CAAC,SAA6B,CAAC;IACxD,IAAI,QAAgH,CAAC;IACrH,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;QACpF,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;QACxE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAC3D,QAAQ,GAAG;gBACT,SAAS;gBACT,QAAQ,EAAE,GAAG,CAAC,KAAK;gBACnB,KAAK,EAAE,GAAG,CAAC,WAAW;gBACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,QAAQ;aACT,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IAE7E,OAAO;QACL,MAAM,EAAE,YAAY;QACpB,OAAO,EAAE;YACP,IAAI,EAAE,OAAO;YACb,SAAS,EAAE,QAAQ,CAAC,SAAS;YAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,eAAe,EAAE,QAAQ,CAAC,QAAQ;YAClC,cAAc,EAAE,QAAQ,CAAC,QAAQ,IAAI,CAAC;YACtC,KAAK,EAAE,iBAAiB;YACxB,UAAU,EAAE;gBACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ;gBAC3B,IAAI,EAAE,CAAC;gBACP,SAAS,EAAE,cAAc;gBACzB,IAAI,EAAE,mIAAmI;aAC1I;YACD,aAAa,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE;YACxC,YAAY,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE;SACxC;KACF,CAAC;AACJ,CAAC"}
+{"version":3,"file":"caller-table.js","sourceRoot":"","sources":["../../src/bridges/caller-table.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,eAAe,EAA6B,MAAM,yBAAyB,CAAC;AAiDrF,SAAS,KAAK,CAAC,KAAyB;IACtC,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,aAAa,CAAC,OAA2B;IAChD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,OAAO,CAAC,KAAK,IAAI,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IACpC,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAClC,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,OAAO,SAAS,KAAK,UAAU,EAAE,CAAC;QACpC,OAAO,CAAC,IAAI,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;QAChD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACvE,IAAI,OAAO,SAAS,CAAC,EAAE,KAAK,UAAU;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAC1E,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,KAAqC;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5E,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5E,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YAC1F,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,CAAC,QAAQ,KAAK,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACtG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,+BAA+B,CAAC,OAAO,GAAuB,EAAE;IAC9E,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;IAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IAE7E,MAAM,SAAS,GAAG,OAAO,CAAC,SAA6B,CAAC;IACxD,IAAI,QAAgH,CAAC;IACrH,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;QACpF,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;QACxE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAC3D,QAAQ,GAAG;gBACT,SAAS;gBACT,QAAQ,EAAE,GAAG,CAAC,KAAK;gBACnB,KAAK,EAAE,GAAG,CAAC,WAAW;gBACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,QAAQ;aACT,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IAE7E,OAAO;QACL,MAAM,EAAE,YAAY;QACpB,OAAO,EAAE;YACP,IAAI,EAAE,OAAO;YACb,SAAS,EAAE,QAAQ,CAAC,SAAS;YAC7B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,eAAe,EAAE,QAAQ,CAAC,QAAQ;YAClC,cAAc,EAAE,QAAQ,CAAC,QAAQ,IAAI,CAAC;YACtC,KAAK,EAAE,iBAAiB;YACxB,UAAU,EAAE;gBACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ;gBAC3B,IAAI,EAAE,CAAC;gBACP,SAAS,EAAE,cAAc;gBACzB,IAAI,EAAE,mIAAmI;aAC1I;YACD,aAAa,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE;YACxC,YAAY,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE;SACxC;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * A confrontation that exists only when the caller supplies a measured table\n * and a running procedure. A refusal names the missing inputs and carries no\n * residual. It does not change a catalog status.\n *\n * @module bridges/caller-table\n */\n\nimport { residualInSigma, type ConfrontationOutcome } from './observations/types.js';\n\n/** One row of a caller-supplied measured table. @public */\nexport interface MeasuredCouplingRow {\n  readonly scale: number;\n  readonly value: number;\n  readonly uncertainty: number;\n  readonly citation: string;\n}\n\n/** What a running procedure must state before it can be compared. @public */\nexport interface RunningProcedureRecord {\n  readonly loopOrder: string;\n  readonly flavorThresholds: string;\n}\n\n/** A caller-supplied running procedure. @public */\nexport interface RunningProcedure {\n  readonly record: RunningProcedureRecord;\n  at(scale: number): number;\n}\n\n/** What a caller may pass. Absent fields are missing inputs, not defaults. @public */\nexport interface CallerTableRequest {\n  readonly table?: readonly MeasuredCouplingRow[] | null;\n  readonly procedure?:\n    | {\n        readonly record?: Partial<RunningProcedureRecord> | null;\n        readonly at?: (scale: number) => number;\n      }\n    | ((scale: number) => number)\n    | null;\n}\n\n/** Refusal: the named inputs are missing, and no residual was computed. @public */\nexport interface CallerTableRefusal {\n  readonly status: 'refused';\n  readonly missing: readonly string[];\n}\n\n/** A comparison that uses a value outcome. @public */\nexport interface CallerTableHit {\n  readonly status: 'confronted';\n  readonly outcome: Extract<ConfrontationOutcome, { kind: 'value' }>;\n}\n\n/** A caller-table confrontation either refuses or reports a value outcome. @public */\nexport type CallerTableResult = CallerTableRefusal | CallerTableHit;\n\nfunction blank(value: string | undefined): boolean {\n  return value === undefined || value.trim() === '';\n}\n\nfunction finite(value: unknown): value is number {\n  return typeof value === 'number' && Number.isFinite(value);\n}\n\nfunction missingInputs(request: CallerTableRequest): string[] {\n  const missing: string[] = [];\n  if (request.table == null || request.table.length === 0) missing.push('table');\n  const procedure = request.procedure;\n  if (procedure == null) {\n    missing.push('running procedure');\n    return missing;\n  }\n  if (typeof procedure === 'function') {\n    missing.push('loop order', 'flavor thresholds');\n    return missing;\n  }\n  const record = procedure.record;\n  if (blank(record?.loopOrder)) missing.push('loop order');\n  if (blank(record?.flavorThresholds)) missing.push('flavor thresholds');\n  if (typeof procedure.at !== 'function') missing.push('running procedure');\n  return missing;\n}\n\nfunction rowProblems(table: readonly MeasuredCouplingRow[]): string[] {\n  const missing: string[] = [];\n  for (const row of table) {\n    if (!finite(row.scale) && !missing.includes('scale')) missing.push('scale');\n    if (!finite(row.value) && !missing.includes('value')) missing.push('value');\n    if (!(finite(row.uncertainty) && row.uncertainty > 0) && !missing.includes('uncertainty')) {\n      missing.push('uncertainty');\n    }\n    if ((typeof row.citation !== 'string' || row.citation.trim() === '') && !missing.includes('citation')) {\n      missing.push('citation');\n    }\n  }\n  return missing;\n}\n\n/**\n * Confront a caller-supplied table. Otherwise refuse. The refusal does not\n * read or write the catalog. Several rows collapse to the row with the\n * largest absolute residual in units of its uncertainty.\n *\n * @public\n */\nexport function requestCallerTableConfrontation(request: CallerTableRequest = {}): CallerTableResult {\n  const missing = missingInputs(request);\n  if (missing.length > 0) return { status: 'refused', missing };\n  const table = request.table ?? [];\n  const rowMissing = rowProblems(table);\n  if (rowMissing.length > 0) return { status: 'refused', missing: rowMissing };\n\n  const procedure = request.procedure as RunningProcedure;\n  let reported: { predicted: number; observed: number; sigma: number; citation: string; residual: number } | undefined;\n  for (const row of table) {\n    const predicted = procedure.at(row.scale);\n    if (!finite(predicted)) return { status: 'refused', missing: ['procedure output'] };\n    const residual = residualInSigma(predicted, row.value, row.uncertainty);\n    if (reported === undefined || residual > reported.residual) {\n      reported = {\n        predicted,\n        observed: row.value,\n        sigma: row.uncertainty,\n        citation: row.citation,\n        residual,\n      };\n    }\n  }\n  if (reported === undefined) return { status: 'refused', missing: ['table'] };\n\n  return {\n    status: 'confronted',\n    outcome: {\n      kind: 'value',\n      predicted: reported.predicted,\n      observed: reported.observed,\n      sigma: reported.sigma,\n      residualInSigma: reported.residual,\n      withinObserved: reported.residual <= 1,\n      units: 'caller-supplied',\n      provenance: {\n        citation: reported.citation,\n        year: 0,\n        retrieved: 'not supplied',\n        note: 'The caller table states a citation and does not state a publication year or a retrieval date. The year 0 is not a year of record.',\n      },\n      preprocessing: { state: 'not-recorded' },\n      independence: { state: 'not-recorded' },\n    },\n  };\n}\n"]}

package/dist/bridges/carrier-sign.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"carrier-sign.d.ts","sourceRoot":"","sources":["../../src/bridges/carrier-sign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;GAIG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAmBD;;;GAGG;AACH,wBAAgB,2BAA2B,IAAI,IAAI,CAElD;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,IAAI,MAAM,CAEnD;AAOD,4EAA4E;AAC5E,UAAU,eAAe;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,EACjD,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,EACzB,IAAI,CAAC,EAAE,eAAe,GACrB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAsCxB"}
+{"version":3,"file":"carrier-sign.d.ts","sourceRoot":"","sources":["../../src/bridges/carrier-sign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;GAIG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAsBD;;;GAGG;AACH,wBAAgB,2BAA2B,IAAI,IAAI,CAElD;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,IAAI,MAAM,CAEnD;AAOD,4EAA4E;AAC5E,UAAU,eAAe;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,EACjD,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,EACzB,IAAI,CAAC,EAAE,eAAe,GACrB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAsCxB"}

package/dist/bridges/carrier-sign.js

@@ -26,11 +26,16 @@ function sameCarrierSign(a, b) {
 }
 /**
  * Reject opposite signs. `left` and `right` are the names in the message.
- * Only {@link applyCarrierSignPolicy} calls this.
+ * A value that is not a finite number has no sign to compare, so it is
+ * refused as such rather than passed. Only {@link applyCarrierSignPolicy}
+ * calls this.
  */
 function assertSameCarrierSign(a, b, left, right) {
-    const opposite = Number.isFinite(a) && Number.isFinite(b) ? !sameCarrierSign(a, b) : a * b < 0;
-    if (opposite)
+    if (!Number.isFinite(a))
+        throw new RangeError(`${left} must be a finite number to carry a sign, got ${a}`);
+    if (!Number.isFinite(b))
+        throw new RangeError(`${right} must be a finite number to carry a sign, got ${b}`);
+    if (!sameCarrierSign(a, b))
         throw new CarrierSignError(`${left} and ${right} must have the same sign`);
 }
 /** How many times the sign policy has run since the last reset. The once-check reads this. */

package/dist/bridges/carrier-sign.js.map

@@ -1 +1 @@
-{"version":3,"file":"carrier-sign.js","sourceRoot":"","sources":["../../src/bridges/carrier-sign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;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,0EAA0E;AAC1E,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS,EAAE,IAAY,EAAE,KAAa;IAC9E,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/F,IAAI,QAAQ;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,QAAQ,KAAK,0BAA0B,CAAC,CAAC;AAC3F,CAAC;AAED,8FAA8F;AAC9F,IAAI,sBAAsB,GAAG,CAAC,CAAC;AAE/B;;;GAGG;AACH,MAAM,UAAU,2BAA2B;IACzC,sBAAsB,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B;IACxC,OAAO,sBAAsB,CAAC;AAChC,CAAC;AAED,gFAAgF;AAChF,SAAS,kBAAkB,CAAC,GAAW;IACrC,OAAO,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAUD;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAAiD,EACjD,MAAwC,EACxC,IAAyB,EACzB,IAAsB;IAEtB,sBAAsB,IAAI,CAAC,CAAC;IAC5B,IAAI,IAAwB,CAAC;IAC7B,IAAI,KAAyB,CAAC;IAC9B,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,SAAS,GAAG,EAAE,CAAC;IACnB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACd,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;QACf,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,CAAC;SAAM,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IACE,IAAI,KAAK,SAAS;YAClB,KAAK,KAAK,SAAS;YACnB,kBAAkB,CAAC,IAAI,CAAC;YACxB,kBAAkB,CAAC,KAAK,CAAC,EACzB,CAAC;YACD,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;YACrB,KAAK,GAAG,MAAM,CAAC,kBAAkB,CAAC,CAAC;YACnC,QAAQ,GAAG,QAAQ,CAAC;YACpB,SAAS,GAAG,kBAAkB,CAAC;QACjC,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAK,EAAE,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;QACrF,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACnC,IAAI,GAAuC,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QACvE,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,GAAG,IAAI,MAAM,CAAC;AACvB,CAAC"}
+{"version":3,"file":"carrier-sign.js","sourceRoot":"","sources":["../../src/bridges/carrier-sign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;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,0EAA0E;AAC1E,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS,EAAE,IAAY,EAAE,KAAa;IAC9E,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,iDAAiD,CAAC,EAAE,CAAC,CAAC;IAC3G,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,iDAAiD,CAAC,EAAE,CAAC,CAAC;IAC5G,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,MAAM,IAAI,gBAAgB,CAAC,GAAG,IAAI,QAAQ,KAAK,0BAA0B,CAAC,CAAC;AACzG,CAAC;AAED,8FAA8F;AAC9F,IAAI,sBAAsB,GAAG,CAAC,CAAC;AAE/B;;;GAGG;AACH,MAAM,UAAU,2BAA2B;IACzC,sBAAsB,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B;IACxC,OAAO,sBAAsB,CAAC;AAChC,CAAC;AAED,gFAAgF;AAChF,SAAS,kBAAkB,CAAC,GAAW;IACrC,OAAO,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAUD;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAAiD,EACjD,MAAwC,EACxC,IAAyB,EACzB,IAAsB;IAEtB,sBAAsB,IAAI,CAAC,CAAC;IAC5B,IAAI,IAAwB,CAAC;IAC7B,IAAI,KAAyB,CAAC;IAC9B,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,SAAS,GAAG,EAAE,CAAC;IACnB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACd,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;QACf,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,CAAC;SAAM,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IACE,IAAI,KAAK,SAAS;YAClB,KAAK,KAAK,SAAS;YACnB,kBAAkB,CAAC,IAAI,CAAC;YACxB,kBAAkB,CAAC,KAAK,CAAC,EACzB,CAAC;YACD,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;YACrB,KAAK,GAAG,MAAM,CAAC,kBAAkB,CAAC,CAAC;YACnC,QAAQ,GAAG,QAAQ,CAAC;YACpB,SAAS,GAAG,kBAAkB,CAAC;QACjC,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAK,EAAE,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;QACrF,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACnC,IAAI,GAAuC,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAAE,SAAS;QACvE,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,GAAG,IAAI,MAAM,CAAC;AACvB,CAAC","sourcesContent":["/**\n * One sign rule for a positive transport coefficient built from a carrier\n * charge and a mobility.\n *\n * `D = μ k_B T / q` and `σ = n q μ` are positive when μ and q have the same\n * sign, and zero when either is zero. Opposite signs are not a negative\n * diffusivity or a negative conductivity. A Hall coefficient and a cyclotron\n * frequency are odd in charge alone; this rule does not apply to them.\n *\n * @module bridges/carrier-sign\n */\n\n/**\n * Thrown when a positive transport coefficient would come out negative\n * because the carrier charge and the mobility have opposite signs.\n * @public\n */\nexport class CarrierSignError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'CarrierSignError';\n  }\n}\n\n/** True when the product is positive or zero, including a zero factor. */\nfunction sameCarrierSign(a: number, b: number): boolean {\n  return a * b >= 0;\n}\n\n/**\n * Reject opposite signs. `left` and `right` are the names in the message.\n * A value that is not a finite number has no sign to compare, so it is\n * refused as such rather than passed. Only {@link applyCarrierSignPolicy}\n * calls this.\n */\nfunction assertSameCarrierSign(a: number, b: number, left: string, right: string): void {\n  if (!Number.isFinite(a)) throw new RangeError(`${left} must be a finite number to carry a sign, got ${a}`);\n  if (!Number.isFinite(b)) throw new RangeError(`${right} must be a finite number to carry a sign, got ${b}`);\n  if (!sameCarrierSign(a, b)) throw new CarrierSignError(`${left} and ${right} must have the same sign`);\n}\n\n/** How many times the sign policy has run since the last reset. The once-check reads this. */\nlet carrierSignPolicyCalls = 0;\n\n/**\n * Reset the sign-policy call count. The once-check reads the count after this.\n * @internal\n */\nexport function resetCarrierSignPolicyCalls(): void {\n  carrierSignPolicyCalls = 0;\n}\n\n/**\n * How many times the sign policy has run since the last reset.\n * @internal\n */\nexport function readCarrierSignPolicyCalls(): number {\n  return carrierSignPolicyCalls;\n}\n\n/** An integer exponent whose absolute value is odd. A half power is not odd. */\nfunction oddIntegerExponent(exp: number): boolean {\n  return Number.isInteger(exp) && Math.abs(exp) % 2 === 1;\n}\n\n/** A same-sign pair whose names are not `charge` and `carrier-mobility`. */\ninterface CarrierSignPair {\n  readonly a: number;\n  readonly b: number;\n  readonly left: string;\n  readonly right: string;\n}\n\n/**\n * One sign policy. A monomial odd in both `charge` and `carrier-mobility`\n * rejects opposite signs. `pair` is that same check for a formula whose\n * names are not those two (the Einstein relation). Inputs the scalar AST\n * is even in are replaced by their absolute values. The math underneath\n * does not apply this again.\n * @internal\n */\nexport function applyCarrierSignPolicy(\n  monomial: Readonly<Record<string, number>> | null,\n  inputs: Readonly<Record<string, number>>,\n  even: ReadonlySet<string>,\n  pair?: CarrierSignPair,\n): Record<string, number> {\n  carrierSignPolicyCalls += 1;\n  let left: number | undefined;\n  let right: number | undefined;\n  let leftName = '';\n  let rightName = '';\n  if (pair !== undefined) {\n    left = pair.a;\n    right = pair.b;\n    leftName = pair.left;\n    rightName = pair.right;\n  } else if (monomial !== null) {\n    const qExp = monomial.charge;\n    const muExp = monomial['carrier-mobility'];\n    if (\n      qExp !== undefined &&\n      muExp !== undefined &&\n      oddIntegerExponent(qExp) &&\n      oddIntegerExponent(muExp)\n    ) {\n      left = inputs.charge;\n      right = inputs['carrier-mobility'];\n      leftName = 'charge';\n      rightName = 'carrier-mobility';\n    }\n  }\n  if (left !== undefined && right !== undefined && leftName !== '' && rightName !== '') {\n    assertSameCarrierSign(left, right, leftName, rightName);\n  }\n  if (even.size === 0) return inputs;\n  let out: Record<string, number> | undefined;\n  for (const name of even) {\n    const value = inputs[name];\n    if (value === undefined || Object.is(value, Math.abs(value))) continue;\n    out ??= { ...inputs };\n    out[name] = Math.abs(value);\n  }\n  return out ?? inputs;\n}\n"]}

package/dist/bridges/catalog-adapter.d.ts

@@ -1,8 +1,12 @@
 /**
- * Catalog adapter: ingests the 44-entry `BRIDGE_EQUATIONS` array into
- * the v0.7-p2 sparse semantic catalog as `BridgeCell` values.
+ * Catalog adapter: ingests `BRIDGE_EQUATIONS` into the v0.7-p2 sparse
+ * semantic catalog as `BridgeCell` values.
  *
- * Phase 3 of v0.7 Proposal 2 (Sparse Semantic Catalog).
+ * A cell needs a `PhysicalScale` on at least one end, and the catalog's
+ * `bridges` tuple names a scale on only part of the rows (the rest name a
+ * field such as `chemistry` or `plasma`). The adapter submits the rows it
+ * can place and lists every other row in `unsubmitted`, with the reason in
+ * `skipped`; it never guesses a scale. Phase 3 of v0.7 Proposal 2.
  *
  * Two entry points:
  *
@@ -64,6 +68,11 @@ export interface CatalogIngestionReport {
     readonly info: ReadonlyArray<FluxDiagnostic>;
     /** Bridge IDs the adapter filtered out before submission. */
     readonly unsubmitted: ReadonlyArray<number>;
+    /** Why each unsubmitted id was not placed: the tuple labels that name no `PhysicalScale`. */
+    readonly skipped: ReadonlyArray<{
+        readonly bridgeId: number;
+        readonly reason: string;
+    }>;
     /** Cells that PASSED Rule 1 and would be submitted (or were). */
     readonly submitted: ReadonlyArray<BridgeCell>;
 }

package/dist/bridges/catalog-adapter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-adapter.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EACV,mBAAmB,EACpB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,iBAAiB,CAAC;AAClE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,KAAK,EACV,cAAc,EACd,UAAU,EACX,MAAM,uBAAuB,CAAC;AAU/B;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mEAAmE;IACnE,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,cAAc,CAAC;CACtC;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,kBAAkB,CAAC,CAAC;IACpD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IAC/C,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IACjD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IAC7C,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAC5C,iEAAiE;IACjE,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;CAC/C;AAED;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,SAAgB,MAAM,EAAE,sBAAsB,CAAC;IAE/C,YAAY,MAAM,EAAE,sBAAsB,EAQzC;CACF;AAuDD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,aAAa,CAAC,UAAU,CAAC,CAO3B;AA+GD;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,sBAAsB,CAuCxB;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,eAAe,EACvB,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,sBAAsB,CASxB;AAED;;;;;;GAMG;AACH,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,sBAAsB,GAC7B,UAAU,CAYZ"}
+{"version":3,"file":"catalog-adapter.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EACV,mBAAmB,EAEpB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,iBAAiB,CAAC;AAClE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,KAAK,EACV,cAAc,EACd,UAAU,EACX,MAAM,uBAAuB,CAAC;AAU/B;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mEAAmE;IACnE,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,cAAc,CAAC;CACtC;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,kBAAkB,CAAC,CAAC;IACpD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IAC/C,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IACjD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;IAC7C,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAC5C,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACxF,iEAAiE;IACjE,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;CAC/C;AAED;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,SAAgB,MAAM,EAAE,sBAAsB,CAAC;IAE/C,YAAY,MAAM,EAAE,sBAAsB,EAQzC;CACF;AAoDD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,aAAa,CAAC,UAAU,CAAC,CAO3B;AA+GD;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,sBAAsB,CA8CxB;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,eAAe,EACvB,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,GAC1C,sBAAsB,CASxB;AAED;;;;;;GAMG;AACH,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,sBAAsB,GAC7B,UAAU,CAYZ"}

package/dist/bridges/catalog-adapter.js

@@ -1,8 +1,12 @@
 /**
- * Catalog adapter: ingests the 44-entry `BRIDGE_EQUATIONS` array into
- * the v0.7-p2 sparse semantic catalog as `BridgeCell` values.
+ * Catalog adapter: ingests `BRIDGE_EQUATIONS` into the v0.7-p2 sparse
+ * semantic catalog as `BridgeCell` values.
  *
- * Phase 3 of v0.7 Proposal 2 (Sparse Semantic Catalog).
+ * A cell needs a `PhysicalScale` on at least one end, and the catalog's
+ * `bridges` tuple names a scale on only part of the rows (the rest name a
+ * field such as `chemistry` or `plasma`). The adapter submits the rows it
+ * can place and lists every other row in `unsubmitted`, with the reason in
+ * `skipped`; it never guesses a scale. Phase 3 of v0.7 Proposal 2.
  *
  * Two entry points:
  *
@@ -64,11 +68,8 @@ function statusToCellConfidence(status) {
         case 'speculative': return 'speculative';
         case 'highly-speculative': return 'highly-speculative';
         case 'invalid':
-            // 'invalid' catalog entries should not become cells; the
-            // adapter callers filter on isActiveStatus first. If we ever
-            // reach here, downgrade to 'highly-speculative' (safest).
-            return 'highly-speculative';
-        default:
+            // An invalid row is not a claim; the catalog carries none (the status
+            // distribution test pins 0). A cell built from one is the weakest grade.
             return 'highly-speculative';
     }
 }
@@ -223,13 +224,19 @@ export function scanCatalog(entries) {
     const warnings = [];
     const info = [];
     const unsubmitted = [];
+    const skipped = [];
     const submitted = [];
     for (const entry of entries) {
         const diagnostic = checkDimensionalConsistency(entry);
         const cell = entryToBridgeCell(entry);
         const submittable = cell !== null;
-        if (!submittable)
+        if (!submittable) {
             unsubmitted.push(entry.id);
+            skipped.push({
+                bridgeId: entry.id,
+                reason: `bridges tuple [${entry.bridges.join(', ')}] names no PhysicalScale (quantum, mesoscopic, classical, cosmological) on either end`,
+            });
+        }
         else
             submitted.push(cell);
         if (diagnostic) {
@@ -258,6 +265,7 @@ export function scanCatalog(entries) {
         warnings,
         info,
         unsubmitted,
+        skipped,
         submitted,
     };
 }

package/dist/bridges/catalog-adapter.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-adapter.js","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAWH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AA4CnD;;;;;GAKG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9B,MAAM,CAAyB;IAE/C,YAAY,MAA8B;QACxC,KAAK,CACH,0BAA0B,MAAM,CAAC,MAAM,CAAC,MAAM,2BAA2B;YACzE,eAAe,MAAM,CAAC,OAAO,CAAC,MAAM,oBAAoB;YACxD,gBAAgB,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,QAAQ,EAAE,CACxD,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAAC,MAAc;IAC5C,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,oBAAoB,EAAE,OAAO,oBAAoB,CAAC;QACvD,KAAK,SAAS;YACZ,yDAAyD;YACzD,6DAA6D;YAC7D,0DAA0D;YAC1D,OAAO,oBAAoB,CAAC;QAC9B;YACE,OAAO,oBAAoB,CAAC;IAChC,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,YAAY,CAAC;QAClB,KAAK,WAAW,CAAC;QACjB,KAAK,cAAc;YACjB,OAAO,KAAK,CAAC;QACf;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,4CAA4C;AAC5C,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,OAA2C;IAE3C,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,KAA0B;IACnD,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,MAAM,GAAkB,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,MAAM,MAAM,GAAkB,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEhE,iEAAiE;IACjE,mEAAmE;IACnE,uDAAuD;IACvD,iBAAiB;IACjB,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QACpE,CAAC,CAAC,KAAK,CAAC,aAAa;QACrB,CAAC,CAAC,6BAA6B,KAAK,CAAC,EAAE,GAAG,CAAC;IAE7C,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,EAAE,EAAE,MAAM,KAAK,CAAC,EAAE,EAAE;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ;QACR,UAAU,EAAE,sBAAsB,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM;QACN,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,MAAM,KAAK,aAAa;QACzC,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI;KAC7E,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAS,2BAA2B,CAClC,KAA0B;IAE1B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC;IAChC,iEAAiE;IACjE,iEAAiE;IACjE,gBAAgB;IAChB,IAAI,KAAK,CAAC,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,gCAAgC;gBAC9D,6DAA6D;gBAC7D,wBAAwB;SAC3B,CAAC;IACJ,CAAC;IACD,gCAAgC;IAChC,MAAM,QAAQ,GAAG,4BAA4B,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,qBAAqB;gBACnD,iCAAiC,4BAA4B,CAAC,IAAI,OAAO,cAAc,EAAE,CAAC,MAAM,0BAA0B;gBAC1H,uDAAuD;SAC1D,CAAC;IACJ,CAAC;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,qBAAqB,KAAK,iBAAiB,EAAE,CAAC;QACtD,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,+BAA+B;gBAC7D,IAAI,KAAK,CAAC,qBAAqB,qCAAqC;gBACpE,SAAS,iBAAiB,sCAAsC;SACnE,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CACzB,OAA2C;IAE3C,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,KAAK,IAAI,CAAC;QAClC,IAAI,CAAC,WAAW;YAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YACxC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5B,KAAK,OAAO;oBAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBAC7C,KAAK,SAAS;oBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;YAC5C,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE,KAAK,CAAC,EAAE;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,WAAW;YACtB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,QAAQ;QACjB,MAAM;QACN,QAAQ;QACR,IAAI;QACJ,WAAW;QACX,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAuB,EACvB,OAA2C;IAE3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAA8B;IAE9B,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM,CAAC,MAAM;QAChB,GAAG,MAAM,CAAC,QAAQ;QAClB,GAAG,MAAM,CAAC,IAAI;KACf,CAAC;IACF,OAAO;QACL,WAAW;QACX,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM;QAChC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;KAC9B,CAAC;AACJ,CAAC"}
+{"version":3,"file":"catalog-adapter.js","sourceRoot":"","sources":["../../src/bridges/catalog-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAYH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AA8CnD;;;;;GAKG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9B,MAAM,CAAyB;IAE/C,YAAY,MAA8B;QACxC,KAAK,CACH,0BAA0B,MAAM,CAAC,MAAM,CAAC,MAAM,2BAA2B;YACzE,eAAe,MAAM,CAAC,OAAO,CAAC,MAAM,oBAAoB;YACxD,gBAAgB,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,QAAQ,EAAE,CACxD,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;CACF;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAAC,MAA4B;IAC1D,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,aAAa,EAAE,OAAO,aAAa,CAAC;QACzC,KAAK,oBAAoB,EAAE,OAAO,oBAAoB,CAAC;QACvD,KAAK,SAAS;YACZ,sEAAsE;YACtE,yEAAyE;YACzE,OAAO,oBAAoB,CAAC;IAChC,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,YAAY,CAAC;QAClB,KAAK,WAAW,CAAC;QACjB,KAAK,cAAc;YACjB,OAAO,KAAK,CAAC;QACf;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,4CAA4C;AAC5C,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,OAA2C;IAE3C,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,KAA0B;IACnD,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,MAAM,GAAkB,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,MAAM,MAAM,GAAkB,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEhE,iEAAiE;IACjE,mEAAmE;IACnE,uDAAuD;IACvD,iBAAiB;IACjB,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QACpE,CAAC,CAAC,KAAK,CAAC,aAAa;QACrB,CAAC,CAAC,6BAA6B,KAAK,CAAC,EAAE,GAAG,CAAC;IAE7C,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,EAAE,EAAE,MAAM,KAAK,CAAC,EAAE,EAAE;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ;QACR,UAAU,EAAE,sBAAsB,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM;QACN,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,MAAM,KAAK,aAAa;QACzC,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI;KAC7E,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAS,2BAA2B,CAClC,KAA0B;IAE1B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC;IAChC,iEAAiE;IACjE,iEAAiE;IACjE,gBAAgB;IAChB,IAAI,KAAK,CAAC,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,gCAAgC;gBAC9D,6DAA6D;gBAC7D,wBAAwB;SAC3B,CAAC;IACJ,CAAC;IACD,gCAAgC;IAChC,MAAM,QAAQ,GAAG,4BAA4B,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,qBAAqB;gBACnD,iCAAiC,4BAA4B,CAAC,IAAI,OAAO,cAAc,EAAE,CAAC,MAAM,0BAA0B;gBAC1H,uDAAuD;SAC1D,CAAC;IACJ,CAAC;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,qBAAqB,KAAK,iBAAiB,EAAE,CAAC;QACtD,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,yBAAyB;YACnC,MAAM;YACN,OAAO,EACL,MAAM,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,+BAA+B;gBAC7D,IAAI,KAAK,CAAC,qBAAqB,qCAAqC;gBACpE,SAAS,iBAAiB,sCAAsC;SACnE,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CACzB,OAA2C;IAE3C,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,OAAO,GAA2C,EAAE,CAAC;IAC3D,MAAM,SAAS,GAAiB,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,KAAK,IAAI,CAAC;QAClC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,KAAK,CAAC,EAAE;gBAClB,MAAM,EAAE,kBAAkB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,uFAAuF;aAC1I,CAAC,CAAC;QACL,CAAC;;YAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5B,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5B,KAAK,OAAO;oBAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBAC7C,KAAK,SAAS;oBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;YAC5C,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE,KAAK,CAAC,EAAE;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,SAAS,EAAE,WAAW;YACtB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,QAAQ;QACjB,MAAM;QACN,QAAQ;QACR,IAAI;QACJ,WAAW;QACX,OAAO;QACP,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAuB,EACvB,OAA2C;IAE3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAA8B;IAE9B,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM,CAAC,MAAM;QAChB,GAAG,MAAM,CAAC,QAAQ;QAClB,GAAG,MAAM,CAAC,IAAI;KACf,CAAC;IACF,OAAO;QACL,WAAW;QACX,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM;QAChC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;KAC9B,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Catalog adapter: ingests `BRIDGE_EQUATIONS` into the v0.7-p2 sparse\n * semantic catalog as `BridgeCell` values.\n *\n * A cell needs a `PhysicalScale` on at least one end, and the catalog's\n * `bridges` tuple names a scale on only part of the rows (the rest name a\n * field such as `chemistry` or `plasma`). The adapter submits the rows it\n * can place and lists every other row in `unsubmitted`, with the reason in\n * `skipped`; it never guesses a scale. Phase 3 of v0.7 Proposal 2.\n *\n * Two entry points:\n *\n *   `catalogToCells(entries)` — pure mapping `BridgeEquationEntry[]\n *     → BridgeCell[]`. Filters out entries that would fail the\n *     legacy `addBridge` validation (e.g. `bridges: ['unknown',\n *     'unknown']` collapses to identical empty `source`/`target`).\n *\n *   `scanCatalog(entries)` — best-effort variant: builds candidates,\n *     runs Rule 1 (dimensional consistency), returns a\n *     `CatalogIngestionReport` without throwing. Caller decides\n *     what to do with the diagnostics.\n *\n *   `ingestCatalog(tensor, entries)` — strict variant: two-pass\n *     collect-then-commit (Decision #11). If Rule 1 reports any\n *     errors, throws `CatalogIngestionError(report)` and the\n *     tensor is untouched. Otherwise calls `tensor.addCell` for\n *     each candidate.\n *\n * Rule 1 (Dimensional Consistency) operates on\n * `BridgeEquationEntry`, NOT on `Cell` (Decision #3, resolves\n * Adam-V3). It reads `entry.dimensional_signature` directly.\n *\n * @module bridges/catalog-adapter\n */\n\nimport type {\n  BridgeEquationEntry,\n  BridgeEquationStatus,\n} from './index.js';\nimport type { BridgeCell, CellConfidence } from '../core/cell.js';\nimport type { UniversalTensor } from '../core/tensor.js';\nimport type {\n  FluxDiagnostic,\n  FluxReport,\n} from '../core/flux-rules.js';\nimport { EXPECTED_DIMENSION_BY_BRIDGE } from '../dimensional/bridge-check.js';\nimport { catalogEntries } from './catalog-load.js';\nimport { format } from '../dimensional/algebra.js';\nimport type { PhysicalScale, TensorIndices } from '../core/types.js';\n\n// ---------------------------------------------------------------------------\n// Public types\n// ---------------------------------------------------------------------------\n\n/**\n * Per-entry summary of the catalog ingestion attempt.\n *\n * @public\n */\nexport interface CatalogEntryStatus {\n  readonly bridgeId: number;\n  readonly name: string;\n  /** True iff the entry would be (or was) submitted to `addCell`. */\n  readonly submitted: boolean;\n  /**\n   * Diagnostics from Rule 1 (dimensional consistency) for this entry.\n   * `undefined` means the entry passed Rule 1 cleanly.\n   */\n  readonly diagnostic?: FluxDiagnostic;\n}\n\n/**\n * Aggregate report returned by `scanCatalog` / `ingestCatalog`. The\n * diagnostics surface Rule 1 results; `unsubmitted` lists entries\n * that the adapter filtered out before submission (typically\n * `'unknown' → 'unknown'` bridges that would fail the legacy\n * `addBridge` source !== target check).\n *\n * @public\n */\nexport interface CatalogIngestionReport {\n  readonly entries: ReadonlyArray<CatalogEntryStatus>;\n  readonly errors: ReadonlyArray<FluxDiagnostic>;\n  readonly warnings: ReadonlyArray<FluxDiagnostic>;\n  readonly info: ReadonlyArray<FluxDiagnostic>;\n  /** Bridge IDs the adapter filtered out before submission. */\n  readonly unsubmitted: ReadonlyArray<number>;\n  /** Why each unsubmitted id was not placed: the tuple labels that name no `PhysicalScale`. */\n  readonly skipped: ReadonlyArray<{ readonly bridgeId: number; readonly reason: string }>;\n  /** Cells that PASSED Rule 1 and would be submitted (or were). */\n  readonly submitted: ReadonlyArray<BridgeCell>;\n}\n\n/**\n * Thrown by `ingestCatalog` when Rule 1 reports any errors. The\n * caller can inspect `report` for per-entry diagnostics.\n *\n * @public\n */\nexport class CatalogIngestionError extends Error {\n  public readonly report: CatalogIngestionReport;\n\n  constructor(report: CatalogIngestionReport) {\n    super(\n      `CatalogIngestionError: ${report.errors.length} dimensional-consistency ` +\n      `error(s) in ${report.entries.length} catalog entries. ` +\n      `First error: ${report.errors[0]?.message ?? '(none)'}`,\n    );\n    this.name = 'CatalogIngestionError';\n    this.report = report;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Internal: confidence + scale mapping\n// ---------------------------------------------------------------------------\n\n/**\n * Map the catalog's `BridgeEquationStatus` string vocabulary onto\n * the `CellConfidence` vocabulary used by `BridgeCell`. The two\n * vocabularies are nearly aligned — only the `'invalid'` arm differs\n * (catalog allows it; CellConfidence excludes it per the design).\n *\n * @internal\n */\nfunction statusToCellConfidence(status: BridgeEquationStatus): CellConfidence {\n  switch (status) {\n    case 'established': return 'established';\n    case 'speculative': return 'speculative';\n    case 'highly-speculative': return 'highly-speculative';\n    case 'invalid':\n      // An invalid row is not a claim; the catalog carries none (the status\n      // distribution test pins 0). A cell built from one is the weakest grade.\n      return 'highly-speculative';\n  }\n}\n\n/**\n * Translate a free-form catalog `bridges` axis label (e.g.\n * `'classical'`, `'quantum'`, `'unknown'`) to a `PhysicalScale`\n * value or `undefined`. The four-element `PhysicalScale` union is\n * exhaustive; anything else (including the `'unknown'` sentinel)\n * maps to `undefined` — making `source`/`target` an empty\n * `TensorIndices` whose serialized key is `''`.\n *\n * @internal\n */\nfunction labelToScale(label: string): PhysicalScale | undefined {\n  switch (label) {\n    case 'quantum':\n    case 'mesoscopic':\n    case 'classical':\n    case 'cosmological':\n      return label;\n    default:\n      return undefined;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Mapping: BridgeEquationEntry → BridgeCell\n// ---------------------------------------------------------------------------\n\n/**\n * Pure mapper from `BridgeEquationEntry` (legacy catalog shape) to\n * `BridgeCell` (v0.7 typed Cell variant). Filters out entries whose\n * `bridges: [from, to]` collapses to an identical source/target\n * (typically `['unknown', 'unknown']`) — those would fail the\n * legacy `addBridge` validation. The filtering decision is surfaced\n * via the `unsubmitted` array in `CatalogIngestionReport`.\n *\n * @public\n */\nexport function catalogToCells(\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): ReadonlyArray<BridgeCell> {\n  const out: BridgeCell[] = [];\n  for (const entry of entries) {\n    const cell = entryToBridgeCell(entry);\n    if (cell !== null) out.push(cell);\n  }\n  return out;\n}\n\n/**\n * Internal: build a `BridgeCell` from a single entry, returning\n * `null` if the entry is filterable (identical source/target after\n * label translation).\n *\n * @internal\n */\nfunction entryToBridgeCell(entry: BridgeEquationEntry): BridgeCell | null {\n  const [fromLabel, toLabel] = entry.bridges;\n  const fromScale = labelToScale(fromLabel);\n  const toScale = labelToScale(toLabel);\n  const source: TensorIndices = fromScale ? { scale: fromScale } : {};\n  const target: TensorIndices = toScale ? { scale: toScale } : {};\n\n  // Filter out entries whose source and target are both empty (the\n  // 'unknown' -> 'unknown' case at HEAD). Legacy `addBridge` rejects\n  // them with a TypeError; the adapter surfaces them via\n  // `unsubmitted`.\n  if (\n    source.scale === undefined &&\n    target.scale === undefined\n  ) {\n    return null;\n  }\n\n  // Equation: use formula_latex if non-empty, else a placeholder.\n  const equation = entry.formula_latex && entry.formula_latex.length > 0\n    ? entry.formula_latex\n    : `(no LaTeX provided for BE-${entry.id})`;\n\n  return {\n    kind: 'bridge',\n    id: `BE-${entry.id}`,\n    name: entry.name,\n    equation,\n    confidence: statusToCellConfidence(entry.status),\n    source,\n    target,\n    validated: entry.status === 'established',\n    description: entry.notes.length > 0 ? entry.notes.slice(0, 200) : entry.name,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Rule 1 — Dimensional Consistency (ERROR tier per Decision #3)\n// ---------------------------------------------------------------------------\n\n/**\n * Fires per-entry. Returns one of:\n *   - undefined (no diagnostic): entry passes Rule 1.\n *   - 'error' diagnostic: dimensional_signature is structurally null,\n *     or non-null but does not match the expected dimension from\n *     `EXPECTED_DIMENSION_BY_BRIDGE`.\n *   - 'info' diagnostic: no expected entry for this bridge ID; the\n *     message states how many catalog rows the table covers, counted\n *     when it is printed. We can't enforce, but we record the gap.\n *\n * @internal\n */\nfunction checkDimensionalConsistency(\n  entry: BridgeEquationEntry,\n): FluxDiagnostic | undefined {\n  const cellId = `BE-${entry.id}`;\n  // Structural null check (Eve-R1 lesson — at HEAD this fires zero\n  // times; future catalog edits that introduce a null will surface\n  // immediately).\n  if (entry.dimensional_signature === null) {\n    return {\n      severity: 'error',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has dimensional_signature: ` +\n        `null. Every active catalog entry must declare a structural ` +\n        `dimensional signature.`,\n    };\n  }\n  // Field-vs-expected comparison.\n  const expected = EXPECTED_DIMENSION_BY_BRIDGE.get(entry.id);\n  if (expected === undefined) {\n    return {\n      severity: 'info',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has no entry in ` +\n        `EXPECTED_DIMENSION_BY_BRIDGE (${EXPECTED_DIMENSION_BY_BRIDGE.size} of ${catalogEntries().length} catalog rows covered); ` +\n        `dimensional-consistency check skipped for this entry.`,\n    };\n  }\n  const expectedFormatted = format(expected);\n  if (entry.dimensional_signature !== expectedFormatted) {\n    return {\n      severity: 'error',\n      ruleName: 'dimensional-consistency',\n      cellId,\n      message:\n        `BE-${entry.id} ('${entry.name}') has dimensional_signature ` +\n        `'${entry.dimensional_signature}' but EXPECTED_DIMENSION_BY_BRIDGE ` +\n        `says '${expectedFormatted}'. Catalog and expectation disagree.`,\n    };\n  }\n  return undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Public entry points\n// ---------------------------------------------------------------------------\n\n/**\n * Best-effort catalog scan: builds candidates, runs Rule 1 per\n * entry, returns a `CatalogIngestionReport`. Does NOT mutate any\n * tensor and does NOT throw.\n *\n * @public\n */\nexport function scanCatalog(\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): CatalogIngestionReport {\n  const statuses: CatalogEntryStatus[] = [];\n  const errors: FluxDiagnostic[] = [];\n  const warnings: FluxDiagnostic[] = [];\n  const info: FluxDiagnostic[] = [];\n  const unsubmitted: number[] = [];\n  const skipped: { bridgeId: number; reason: string }[] = [];\n  const submitted: BridgeCell[] = [];\n\n  for (const entry of entries) {\n    const diagnostic = checkDimensionalConsistency(entry);\n    const cell = entryToBridgeCell(entry);\n    const submittable = cell !== null;\n    if (!submittable) {\n      unsubmitted.push(entry.id);\n      skipped.push({\n        bridgeId: entry.id,\n        reason: `bridges tuple [${entry.bridges.join(', ')}] names no PhysicalScale (quantum, mesoscopic, classical, cosmological) on either end`,\n      });\n    } else submitted.push(cell);\n\n    if (diagnostic) {\n      switch (diagnostic.severity) {\n        case 'error': errors.push(diagnostic); break;\n        case 'warning': warnings.push(diagnostic); break;\n        case 'info': info.push(diagnostic); break;\n      }\n    }\n\n    statuses.push({\n      bridgeId: entry.id,\n      name: entry.name,\n      submitted: submittable,\n      ...(diagnostic ? { diagnostic } : {}),\n    });\n  }\n\n  return {\n    entries: statuses,\n    errors,\n    warnings,\n    info,\n    unsubmitted,\n    skipped,\n    submitted,\n  };\n}\n\n/**\n * Strict catalog ingestion: two-pass collect-then-commit per\n * Decision #11. If Rule 1 reports any errors, throws\n * `CatalogIngestionError(report)` and the tensor is untouched.\n * Otherwise calls `tensor.addCell` for each filterable candidate.\n *\n * @public\n */\nexport function ingestCatalog(\n  tensor: UniversalTensor,\n  entries: ReadonlyArray<BridgeEquationEntry>,\n): CatalogIngestionReport {\n  const report = scanCatalog(entries);\n  if (report.errors.length > 0) {\n    throw new CatalogIngestionError(report);\n  }\n  for (const cell of report.submitted) {\n    tensor.addCell(cell);\n  }\n  return report;\n}\n\n/**\n * Bridge-level FluxReport summary, derived from a\n * `CatalogIngestionReport`. Used by consumers that want the\n * flux-rule report shape rather than the catalog-specific report.\n *\n * @public\n */\nexport function ingestionReportToFluxReport(\n  report: CatalogIngestionReport,\n): FluxReport {\n  const diagnostics = [\n    ...report.errors,\n    ...report.warnings,\n    ...report.info,\n  ];\n  return {\n    diagnostics,\n    errorCount: report.errors.length,\n    warningCount: report.warnings.length,\n    infoCount: report.info.length,\n  };\n}\n"]}

package/dist/bridges/catalog-load.d.ts

@@ -4,7 +4,15 @@
  *
  * @module bridges/catalog-load
  */
-import type { CatalogConfrontation, CatalogEntry, CatalogEvaluator, CatalogFile, CatalogRelation } from './catalog-types.js';
+import type { CatalogConfrontation, CatalogEntry, CatalogEvaluator, CatalogFile, CatalogFileRecord, CatalogRejection, CatalogRelation } from './catalog-types.js';
+/**
+ * The loaded catalog from a file record: the records are in id order, each
+ * outcome is checked on its kind, each relation takes its row's status as its
+ * confidence, then the sign clauses its evaluator parameters state. The
+ * production catalog is this function on `data/bridge-catalog.json`.
+ * @internal
+ */
+export declare function loadCatalog(file: CatalogFileRecord): CatalogFile;
 /** The loaded catalog. */
 export declare function bridgeCatalog(): CatalogFile;
 /** Catalog rows, in file order. */
@@ -13,8 +21,10 @@ export declare function catalogEntries(): readonly CatalogEntry[];
 export declare function catalogRelations(): readonly CatalogRelation[];
 /** Evaluator input contracts, in file order. */
 export declare function catalogEvaluators(): readonly CatalogEvaluator[];
-/** Confrontations, in file order. */
+/** Confrontations, in file order; one per catalog id. */
 export declare function catalogConfrontations(): readonly CatalogConfrontation[];
+/** The negative catalog, in file order. */
+export declare function catalogRejections(): readonly CatalogRejection[];
 /** The row for a catalog id, or undefined. */
 export declare function catalogEntry(id: number): CatalogEntry | undefined;
 /** Relations whose catalog id is `id`, in file order. */

package/dist/bridges/catalog-load.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EACV,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,eAAe,EAChB,MAAM,oBAAoB,CAAC;AA2D5B,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,qCAAqC;AACrC,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}
+{"version":3,"file":"catalog-load.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EACV,oBAAoB,EAEpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AA6M5B;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,WAAW,CAGhE;AAID,0BAA0B;AAC1B,wBAAgB,aAAa,IAAI,WAAW,CAE3C;AAED,mCAAmC;AACnC,wBAAgB,cAAc,IAAI,SAAS,YAAY,EAAE,CAExD;AAED,mCAAmC;AACnC,wBAAgB,gBAAgB,IAAI,SAAS,eAAe,EAAE,CAE7D;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAED,yDAAyD;AACzD,wBAAgB,qBAAqB,IAAI,SAAS,oBAAoB,EAAE,CAEvE;AAED,2CAA2C;AAC3C,wBAAgB,iBAAiB,IAAI,SAAS,gBAAgB,EAAE,CAE/D;AAWD,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEjE;AAED,yDAAyD;AACzD,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,eAAe,EAAE,CAE1E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG/D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY/D;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAEjD"}

package/dist/bridges/catalog-load.js

@@ -4,18 +4,165 @@
  *
  * @module bridges/catalog-load
  */
+import { residualInSigma } from './observations/types.js';
 import { checkedDataFile } from '../core/data-file.js';
 /**
  * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`
  * (every record's `type`, the relation, evaluator, parameter and confrontation
- * shapes) and against what a schema cannot state: `count` is the number of entries.
+ * shapes). What a schema cannot state is checked by {@link loadCatalog}.
  */
 function loadFile() {
-    const file = checkedDataFile('bridge-catalog.json');
-    if (file.count !== file.entries.length) {
-        throw new Error(`data/bridge-catalog.json: count is ${file.count} but the file has ${file.entries.length} entries`);
+    return checkedDataFile('bridge-catalog.json');
+}
+/** Records in ascending id order; a duplicate or a disordered id is refused. */
+function checkOrder(file) {
+    for (let i = 1; i < file.entries.length; i += 1) {
+        const previous = file.entries[i - 1].id;
+        const current = file.entries[i].id;
+        if (current <= previous) {
+            throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);
+        }
+    }
+    const seen = new Set();
+    for (const row of file.confrontations) {
+        if (seen.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);
+        seen.add(row.catalogId);
+    }
+    const rejected = new Set();
+    const ids = new Set(file.entries.map((entry) => entry.id));
+    for (const row of file.rejections) {
+        if (!ids.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);
+        if (rejected.has(row.catalogId))
+            throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);
+        rejected.add(row.catalogId);
+    }
+}
+const number = (o, key, where) => {
+    const v = o[key];
+    if (typeof v !== 'number' || !Number.isFinite(v))
+        throw new Error(`${where}: outcome.${key} must be a finite number`);
+    return v;
+};
+const boolean = (o, key, where) => {
+    const v = o[key];
+    if (typeof v !== 'boolean')
+        throw new Error(`${where}: outcome.${key} must be a boolean`);
+    return v;
+};
+/**
+ * The outcome of one confrontation, checked arm by arm on its `kind`. The
+ * schema states the shared fields (`kind`, `units`, `provenance`, the data
+ * handling); the fields each arm must carry are checked here, so the loaded
+ * record is a {@link ConfrontationOutcome} by inspection, not by assertion.
+ */
+/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */
+function agreesToStoredPrecision(stored, computed) {
+    return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));
+}
+/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */
+function holdsStatesClause(holds, clause) {
+    let from = 0;
+    for (;;) {
+        const at = holds.indexOf(clause, from);
+        if (at < 0)
+            return false;
+        const before = at === 0 ? ' ' : holds[at - 1];
+        if (!/[A-Za-z0-9_-]/.test(before))
+            return true;
+        from = at + 1;
+    }
+}
+function readOutcome(row) {
+    const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;
+    const o = row.outcome;
+    if (o['kind'] !== row.kind)
+        throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);
+    switch (row.kind) {
+        case 'value': {
+            // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored
+            // residual or verdict that disagrees with |predicted − observed|/σ is refused.
+            const predicted = number(o, 'predicted', where);
+            const observed = number(o, 'observed', where);
+            const sigma = number(o, 'sigma', where);
+            const stored = number(o, 'residualInSigma', where);
+            const computed = residualInSigma(predicted, observed, sigma);
+            if (!agreesToStoredPrecision(stored, computed)) {
+                throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);
+            }
+            if (boolean(o, 'withinObserved', where) !== computed <= 1) {
+                throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);
+            }
+            break;
+        }
+        case 'upper-bound': {
+            const predicted = number(o, 'predicted', where);
+            const bound = number(o, 'bound', where);
+            // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or
+            // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.
+            const encodedBound = o['predictedIs'] === 'encoded-bound';
+            const expected = encodedBound ? bound <= predicted : predicted <= bound;
+            if (boolean(o, 'satisfied', where) !== expected) {
+                throw new Error(`${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`);
+            }
+            break;
+        }
+        case 'consistency': {
+            const predicted = number(o, 'predicted', where);
+            const approaches = number(o, 'approaches', where);
+            const gap = number(o, 'fractionalGap', where);
+            if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {
+                throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);
+            }
+            // An agreement bound is the record's stated tolerance; an observed difference is derived.
+            if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {
+                const computed = (approaches - predicted) / predicted;
+                if (!agreesToStoredPrecision(gap, computed)) {
+                    throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);
+                }
+            }
+            break;
+        }
+        case 'table':
+            if (!Array.isArray(o['rows']))
+                throw new Error(`${where}: outcome.rows must be an array`);
+            break;
     }
-    return file;
+    return o;
+}
+function narrowConfrontations(file) {
+    return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));
+}
+/**
+ * A relation's confidence is its catalog row's `status`. The row is the one
+ * owner, so the file may not store a confidence beside a catalog id; a
+ * relation with no row stores its own. A row that is `invalid` has no
+ * relation to evaluate.
+ */
+function deriveConfidence(file) {
+    const entries = new Map(file.entries.map((entry) => [entry.id, entry]));
+    const confrontations = narrowConfrontations(file);
+    const relations = file.relations.map((relation) => {
+        if (relation.catalogId === null) {
+            if (relation.confidence === undefined) {
+                throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);
+            }
+            return { ...relation, confidence: relation.confidence };
+        }
+        if (relation.confidence !== undefined) {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);
+        }
+        const entry = entries.get(relation.catalogId);
+        if (entry === undefined) {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);
+        }
+        if (entry.status === 'invalid') {
+            throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);
+        }
+        return { ...relation, confidence: entry.status };
+    });
+    return { ...file, relations, confrontations };
 }
 /**
  * The validity clause a parameter's sign states, in the relation's own source
@@ -49,7 +196,8 @@ function deriveDomains(file) {
             if (source === undefined)
                 continue;
             const clause = signClause(parameter, source);
-            if (clause !== undefined && !relation.holds.includes(clause))
+            // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.
+            if (clause !== undefined && !holdsStatesClause(relation.holds, clause))
                 clauses.push(clause);
         }
         if (clauses.length === 0)
@@ -63,7 +211,18 @@ function deriveDomains(file) {
     });
     return { ...file, relations };
 }
-const CATALOG = deriveDomains(loadFile());
+/**
+ * The loaded catalog from a file record: the records are in id order, each
+ * outcome is checked on its kind, each relation takes its row's status as its
+ * confidence, then the sign clauses its evaluator parameters state. The
+ * production catalog is this function on `data/bridge-catalog.json`.
+ * @internal
+ */
+export function loadCatalog(file) {
+    checkOrder(file);
+    return deriveDomains(deriveConfidence(file));
+}
+const CATALOG = loadCatalog(loadFile());
 /** The loaded catalog. */
 export function bridgeCatalog() {
     return CATALOG;
@@ -80,10 +239,14 @@ export function catalogRelations() {
 export function catalogEvaluators() {
     return CATALOG.evaluators;
 }
-/** Confrontations, in file order. */
+/** Confrontations, in file order; one per catalog id. */
 export function catalogConfrontations() {
     return CATALOG.confrontations;
 }
+/** The negative catalog, in file order. */
+export function catalogRejections() {
+    return CATALOG.rejections;
+}
 const ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));
 const RELATIONS_BY_CATALOG = new Map();
 for (const relation of CATALOG.relations) {

package/dist/bridges/catalog-load.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAUvD;;;;GAIG;AACH,SAAS,QAAQ;IACf,MAAM,IAAI,GAAG,eAAe,CAAC,qBAAqB,CAA6C,CAAC;IAChG,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,sCAAsC,IAAI,CAAC,KAAK,qBAAqB,IAAI,CAAC,OAAO,CAAC,MAAM,UAAU,CAAC,CAAC;IACtH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,SAAoC,EAAE,MAAc;IACtE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClG,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,GAAG,MAAM,MAAM,CAAC;IAChD,IAAI,IAAI,KAAK,aAAa;QAAE,OAAO,GAAG,MAAM,OAAO,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAChD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;YAAE,OAAO,QAAQ,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjH,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC;QAChF,OAAO;YACL,GAAG,QAAQ;YACX,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YAC1C,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAClG,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC;AAED,MAAM,OAAO,GAAG,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;AAE1C,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,qCAAqC;AACrC,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC"}
+{"version":3,"file":"catalog-load.js","sourceRoot":"","sources":["../../src/bridges/catalog-load.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAcvD;;;;GAIG;AACH,SAAS,QAAQ;IACf,OAAO,eAAe,CAAC,qBAAqB,CAAsB,CAAC;AACrE,CAAC;AAED,gFAAgF;AAChF,SAAS,UAAU,CAAC,IAAuB;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;QACpC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,mCAAmC,OAAO,kBAAkB,QAAQ,qCAAqC,CAAC,CAAC;QAC7H,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,yBAAyB,CAAC,CAAC;QAC7H,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,GAAG,CAAC,SAAS,uBAAuB,CAAC,CAAC;QAC1H,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,SAAS,oBAAoB,CAAC,CAAC;QAC5H,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAU,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,0BAA0B,CAAC,CAAC;IACtH,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,CAAoC,EAAE,GAAW,EAAE,KAAa,EAAW,EAAE;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,aAAa,GAAG,oBAAoB,CAAC,CAAC;IAC1F,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;GAKG;AACH,yJAAyJ;AACzJ,SAAS,uBAAuB,CAAC,MAAc,EAAE,QAAgB;IAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,+FAA+F;AAC/F,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAAc;IACtD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,SAAS,CAAC;QACR,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;QAC/C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,GAA+B;IAClD,MAAM,KAAK,GAAG,2CAA2C,GAAG,CAAC,SAAS,EAAE,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,kBAAkB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,2BAA2B,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9H,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,OAAO,EAAE,CAAC;YACb,yFAAyF;YACzF,+EAA+E;YAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,MAAM,0CAA0C,QAAQ,EAAE,CAAC,CAAC;YACnH,CAAC;YACD,IAAI,OAAO,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0DAA0D,QAAQ,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACxC,2FAA2F;YAC3F,8FAA8F;YAC9F,MAAM,YAAY,GAAG,CAAC,CAAC,aAAa,CAAC,KAAK,eAAe,CAAC;YAC1D,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,KAAK,CAAC;YACxE,IAAI,OAAO,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,+BAA+B,YAAY,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,KAAK,SAAS,OAAO,KAAK,GAAG,CAC/H,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,iBAAiB,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,EAAE,CAAC;gBACjG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,8DAA8D,CAAC,CAAC;YAC1F,CAAC;YACD,0FAA0F;YAC1F,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAK,qBAAqB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACtE,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;gBACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAC5C,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,2BAA2B,GAAG,gDAAgD,QAAQ,EAAE,CAAC,CAAC;gBACpH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;YAC1F,MAAM;IACV,CAAC;IACD,OAAO,CAAoC,CAAC;AAC9C,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAuB;IACnD,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACnF,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAuB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAmB,EAAE;QACjE,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,uCAAuC,CAAC,CAAC;YAC5G,CAAC;YACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,QAAQ,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,qDAAqD,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,gCAAgC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QACzH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,CAAC,EAAE,2CAA2C,CAAC,CAAC;QAChH,CAAC;QACD,OAAO,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,SAAoC,EAAE,MAAc;IACtE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClG,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,GAAG,MAAM,MAAM,CAAC;IAChD,IAAI,IAAI,KAAK,aAAa;QAAE,OAAO,GAAG,MAAM,OAAO,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAChD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;YAAE,OAAO,QAAQ,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,MAAM,GACV,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBACjH,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACnF,IAAI,MAAM,KAAK,SAAS;gBAAE,SAAS;YACnC,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC7C,iFAAiF;YACjF,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,OAAO,CAAC;QAChF,OAAO;YACL,GAAG,QAAQ;YACX,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YAC1C,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAClG,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,UAAU,CAAC,IAAI,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;AAExC,0BAA0B;AAC1B,MAAM,UAAU,aAAa;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,cAAc;IAC5B,OAAO,OAAO,CAAC,OAAO,CAAC;AACzB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,gBAAgB;IAC9B,OAAO,OAAO,CAAC,SAAS,CAAC;AAC3B,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,cAAc,CAAC;AAChC,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA6B,CAAC;AAClE,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI;QAAE,SAAS;IAC1C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;;QAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,mBAAmB,CAAC,EAAU;IAC5C,OAAO,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAyB;IACrD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,kBAAkB,QAAQ,+BAA+B,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,SAAS,CAAC,mBAAmB,QAAQ,uBAAuB,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,OAAO,MAAM,EAAE,EAAE,CAAC;AACpB,CAAC","sourcesContent":["/**\n * The catalog loader. This module is the only place that parses a bridge id\n * out of text. Everywhere else reads the loaded records.\n *\n * @module bridges/catalog-load\n */\n\nimport { residualInSigma } from './observations/types.js';\nimport { checkedDataFile } from '../core/data-file.js';\nimport type {\n  CatalogConfrontation,\n  CatalogConfrontationRecord,\n  CatalogEntry,\n  CatalogEvaluator,\n  CatalogEvaluatorParameter,\n  CatalogFile,\n  CatalogFileRecord,\n  CatalogRejection,\n  CatalogRelation,\n} from './catalog-types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\n\n/**\n * `data/bridge-catalog.json`, checked against `data/bridge-catalog.schema.json`\n * (every record's `type`, the relation, evaluator, parameter and confrontation\n * shapes). What a schema cannot state is checked by {@link loadCatalog}.\n */\nfunction loadFile(): CatalogFileRecord {\n  return checkedDataFile('bridge-catalog.json') as CatalogFileRecord;\n}\n\n/** Records in ascending id order; a duplicate or a disordered id is refused. */\nfunction checkOrder(file: CatalogFileRecord): void {\n  for (let i = 1; i < file.entries.length; i += 1) {\n    const previous = file.entries[i - 1]!.id;\n    const current = file.entries[i]!.id;\n    if (current <= previous) {\n      throw new Error(`data/bridge-catalog.json: entry ${current} follows entry ${previous}; records are in ascending id order`);\n    }\n  }\n  const seen = new Set<number>();\n  for (const row of file.confrontations) {\n    if (seen.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} has two confrontations`);\n    seen.add(row.catalogId);\n  }\n  const rejected = new Set<number>();\n  const ids = new Set(file.entries.map((entry) => entry.id));\n  for (const row of file.rejections) {\n    if (!ids.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: rejection ${row.catalogId} names no catalog row`);\n    if (rejected.has(row.catalogId)) throw new Error(`data/bridge-catalog.json: catalog id ${row.catalogId} is rejected twice`);\n    rejected.add(row.catalogId);\n  }\n}\n\nconst number = (o: Readonly<Record<string, unknown>>, key: string, where: string): number => {\n  const v = o[key];\n  if (typeof v !== 'number' || !Number.isFinite(v)) throw new Error(`${where}: outcome.${key} must be a finite number`);\n  return v;\n};\nconst boolean = (o: Readonly<Record<string, unknown>>, key: string, where: string): boolean => {\n  const v = o[key];\n  if (typeof v !== 'boolean') throw new Error(`${where}: outcome.${key} must be a boolean`);\n  return v;\n};\n\n/**\n * The outcome of one confrontation, checked arm by arm on its `kind`. The\n * schema states the shared fields (`kind`, `units`, `provenance`, the data\n * handling); the fields each arm must carry are checked here, so the loaded\n * record is a {@link ConfrontationOutcome} by inspection, not by assertion.\n */\n/** A stored number is written to a few significant digits; it agrees when it rounds to the computed one within 1e-3 relative (or absolute near zero). */\nfunction agreesToStoredPrecision(stored: number, computed: number): boolean {\n  return Math.abs(stored - computed) <= 1e-3 * Math.max(1, Math.abs(computed));\n}\n\n/** True when `holds` contains `clause` as a whole clause, not as the tail of a longer name. */\nfunction holdsStatesClause(holds: string, clause: string): boolean {\n  let from = 0;\n  for (;;) {\n    const at = holds.indexOf(clause, from);\n    if (at < 0) return false;\n    const before = at === 0 ? ' ' : holds[at - 1]!;\n    if (!/[A-Za-z0-9_-]/.test(before)) return true;\n    from = at + 1;\n  }\n}\n\nfunction readOutcome(row: CatalogConfrontationRecord): ConfrontationOutcome {\n  const where = `data/bridge-catalog.json: confrontation ${row.catalogId}`;\n  const o = row.outcome;\n  if (o['kind'] !== row.kind) throw new Error(`${where}: outcome.kind ${String(o['kind'])} is not the record kind ${row.kind}`);\n  switch (row.kind) {\n    case 'value': {\n      // The verdict is derived from the numbers, never read as stored (AGENTS law 1): a stored\n      // residual or verdict that disagrees with |predicted − observed|/σ is refused.\n      const predicted = number(o, 'predicted', where);\n      const observed = number(o, 'observed', where);\n      const sigma = number(o, 'sigma', where);\n      const stored = number(o, 'residualInSigma', where);\n      const computed = residualInSigma(predicted, observed, sigma);\n      if (!agreesToStoredPrecision(stored, computed)) {\n        throw new Error(`${where}: outcome.residualInSigma ${stored} is not |predicted − observed|/sigma = ${computed}`);\n      }\n      if (boolean(o, 'withinObserved', where) !== computed <= 1) {\n        throw new Error(`${where}: outcome.withinObserved must be residualInSigma <= 1 (${computed})`);\n      }\n      break;\n    }\n    case 'upper-bound': {\n      const predicted = number(o, 'predicted', where);\n      const bound = number(o, 'bound', where);\n      // `predictedIs` picks the comparison (`observations/types.ts`): a point is satisfied at or\n      // below the observed limit; an encoded bound (|x| ≤ predicted) when the limit lies inside it.\n      const encodedBound = o['predictedIs'] === 'encoded-bound';\n      const expected = encodedBound ? bound <= predicted : predicted <= bound;\n      if (boolean(o, 'satisfied', where) !== expected) {\n        throw new Error(\n          `${where}: outcome.satisfied must be ${encodedBound ? 'bound <= predicted' : 'predicted <= bound'} (${predicted} vs ${bound})`,\n        );\n      }\n      break;\n    }\n    case 'consistency': {\n      const predicted = number(o, 'predicted', where);\n      const approaches = number(o, 'approaches', where);\n      const gap = number(o, 'fractionalGap', where);\n      if (o['fractionalGapIs'] !== 'agreement-bound' && o['fractionalGapIs'] !== 'observed-difference') {\n        throw new Error(`${where}: outcome.fractionalGapIs must name what fractionalGap holds`);\n      }\n      // An agreement bound is the record's stated tolerance; an observed difference is derived.\n      if (o['fractionalGapIs'] === 'observed-difference' && predicted !== 0) {\n        const computed = (approaches - predicted) / predicted;\n        if (!agreesToStoredPrecision(gap, computed)) {\n          throw new Error(`${where}: outcome.fractionalGap ${gap} is not (approaches − predicted)/predicted = ${computed}`);\n        }\n      }\n      break;\n    }\n    case 'table':\n      if (!Array.isArray(o['rows'])) throw new Error(`${where}: outcome.rows must be an array`);\n      break;\n  }\n  return o as unknown as ConfrontationOutcome;\n}\n\nfunction narrowConfrontations(file: CatalogFileRecord): readonly CatalogConfrontation[] {\n  return file.confrontations.map((row) => ({ ...row, outcome: readOutcome(row) }));\n}\n\n/**\n * A relation's confidence is its catalog row's `status`. The row is the one\n * owner, so the file may not store a confidence beside a catalog id; a\n * relation with no row stores its own. A row that is `invalid` has no\n * relation to evaluate.\n */\nfunction deriveConfidence(file: CatalogFileRecord): CatalogFile {\n  const entries = new Map(file.entries.map((entry) => [entry.id, entry]));\n  const confrontations = narrowConfrontations(file);\n  const relations = file.relations.map((relation): CatalogRelation => {\n    if (relation.catalogId === null) {\n      if (relation.confidence === undefined) {\n        throw new Error(`data/bridge-catalog.json: relation ${relation.id} has no catalog row and no confidence`);\n      }\n      return { ...relation, confidence: relation.confidence };\n    }\n    if (relation.confidence !== undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} stores a confidence; the row's status is the owner`);\n    }\n    const entry = entries.get(relation.catalogId);\n    if (entry === undefined) {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} names an unknown catalog id ${relation.catalogId}`);\n    }\n    if (entry.status === 'invalid') {\n      throw new Error(`data/bridge-catalog.json: relation ${relation.id} has a closed form but its row is invalid`);\n    }\n    return { ...relation, confidence: entry.status };\n  });\n  return { ...file, relations, confrontations };\n}\n\n/**\n * The validity clause a parameter's sign states, in the relation's own source\n * name. An absolute temperature is nonnegative unless the parameter says `any`.\n */\nfunction signClause(parameter: CatalogEvaluatorParameter, source: string): string | undefined {\n  const sign = parameter.sign ?? (parameter.temperature === 'absolute' ? 'nonnegative' : undefined);\n  if (sign === 'positive') return `${source} > 0`;\n  if (sign === 'nonnegative') return `${source} >= 0`;\n  return undefined;\n}\n\n/**\n * Add the sign clauses the evaluator parameters state to the relation they\n * evaluate. The validity domain is derived from the flags, so a new bridge\n * that flags its inputs cannot leave the domain behind. A clause the record\n * already states is not repeated.\n */\nfunction deriveDomains(file: CatalogFile): CatalogFile {\n  const relations = file.relations.map((relation) => {\n    if (relation.catalogId === null) return relation;\n    const evaluator = file.evaluators.find((row) => row.catalogId === relation.catalogId);\n    if (evaluator === undefined) return relation;\n    const clauses: string[] = [];\n    for (const parameter of evaluator.parameters) {\n      const source =\n        relation.sources.find((name) => name === parameter.key || (relation.aliases[name] ?? []).includes(parameter.key)) ??\n        (relation.sources.includes(parameter.quantity) ? parameter.quantity : undefined);\n      if (source === undefined) continue;\n      const clause = signClause(parameter, source);\n      // A whole-clause match: `radius > 0` is not already stated by `near-radius > 0`.\n      if (clause !== undefined && !holdsStatesClause(relation.holds, clause)) clauses.push(clause);\n    }\n    if (clauses.length === 0) return relation;\n    const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;\n    return {\n      ...relation,\n      holds: `${stated}${clauses.join(' and ')}`,\n      domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,\n    };\n  });\n  return { ...file, relations };\n}\n\n/**\n * The loaded catalog from a file record: the records are in id order, each\n * outcome is checked on its kind, each relation takes its row's status as its\n * confidence, then the sign clauses its evaluator parameters state. The\n * production catalog is this function on `data/bridge-catalog.json`.\n * @internal\n */\nexport function loadCatalog(file: CatalogFileRecord): CatalogFile {\n  checkOrder(file);\n  return deriveDomains(deriveConfidence(file));\n}\n\nconst CATALOG = loadCatalog(loadFile());\n\n/** The loaded catalog. */\nexport function bridgeCatalog(): CatalogFile {\n  return CATALOG;\n}\n\n/** Catalog rows, in file order. */\nexport function catalogEntries(): readonly CatalogEntry[] {\n  return CATALOG.entries;\n}\n\n/** Closed forms, in file order. */\nexport function catalogRelations(): readonly CatalogRelation[] {\n  return CATALOG.relations;\n}\n\n/** Evaluator input contracts, in file order. */\nexport function catalogEvaluators(): readonly CatalogEvaluator[] {\n  return CATALOG.evaluators;\n}\n\n/** Confrontations, in file order; one per catalog id. */\nexport function catalogConfrontations(): readonly CatalogConfrontation[] {\n  return CATALOG.confrontations;\n}\n\n/** The negative catalog, in file order. */\nexport function catalogRejections(): readonly CatalogRejection[] {\n  return CATALOG.rejections;\n}\n\nconst ENTRY_BY_ID = new Map(CATALOG.entries.map((entry) => [entry.id, entry]));\nconst RELATIONS_BY_CATALOG = new Map<number, CatalogRelation[]>();\nfor (const relation of CATALOG.relations) {\n  if (relation.catalogId === null) continue;\n  const list = RELATIONS_BY_CATALOG.get(relation.catalogId);\n  if (list === undefined) RELATIONS_BY_CATALOG.set(relation.catalogId, [relation]);\n  else list.push(relation);\n}\n\n/** The row for a catalog id, or undefined. */\nexport function catalogEntry(id: number): CatalogEntry | undefined {\n  return ENTRY_BY_ID.get(id);\n}\n\n/** Relations whose catalog id is `id`, in file order. */\nexport function relationsForCatalog(id: number): readonly CatalogRelation[] {\n  return RELATIONS_BY_CATALOG.get(id) ?? [];\n}\n\n/**\n * The relation a numeric catalog id evaluates. The graph id `be-<id>` wins\n * when several relations share the id. Otherwise the first relation does.\n */\nexport function primaryRelation(id: number): CatalogRelation | undefined {\n  const rows = relationsForCatalog(id);\n  return rows.find((row) => row.id === `be-${id}`) ?? rows[0];\n}\n\n/**\n * The catalog number a piece of text names (`42`, `be-42`, `BE-42`), or\n * undefined when it names none (an atlas id, a canonical id, a quantity).\n * The one place a bridge id is read from text; {@link parseBridgeId} throws\n * where this returns undefined.\n */\nexport function catalogIdNumber(raw: string): number | undefined {\n  const match = /^(?:be-)?(\\d+)$/i.exec(raw.trim());\n  return match === null ? undefined : Number(match[1]);\n}\n\n/**\n * Parse a catalog id from a number or from text the caller typed.\n * Accepts `42`, `be-42`, and `BE-42`. This is the only such parser.\n */\nexport function parseBridgeId(bridgeId: number | string): number {\n  if (typeof bridgeId === 'number') {\n    if (!Number.isInteger(bridgeId)) {\n      throw new RangeError(`parseBridgeId: ${bridgeId} is not an integer catalog id`);\n    }\n    return bridgeId;\n  }\n  const id = catalogIdNumber(bridgeId);\n  if (id === undefined) {\n    throw new TypeError(`parseBridgeId: '${bridgeId}' is not a catalog id`);\n  }\n  return id;\n}\n\n/** Graph id for a catalog number: the stable key, not a switch. */\nexport function catalogEdgeKey(id: number): string {\n  return `be-${id}`;\n}\n"]}