universal-physics-tensor 9.0.0 → 11.0.0

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;AAKH,OAAO,KAAK,EACV,oBAAoB,EAEpB,YAAY,EACZ,gBAAgB,EAEhB,WAAW,EACX,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EAChB,MAAM,oBAAoB,CAAC;AAiN5B;;;;;;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,174 @@
  *
  * @module bridges/catalog-load
  */
+import { residualInSigma } from './observations/types.js';
+import { withinMixed } from '../core/compare.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 withinMixed(stored, computed, 1e-3);
+}
+/** 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;
     }
-    return file;
+}
+/**
+ * Checks `row.outcome` arm by arm on the record's `kind` and narrows the row to
+ * a loaded {@link CatalogConfrontation}: an assertion guard, so the loaded
+ * record is a `ConfrontationOutcome` by inspection, not by a cast. A field
+ * that is missing or of the wrong type throws naming the record.
+ */
+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;
+    }
+}
+function narrowConfrontations(file) {
+    return file.confrontations.map((row) => {
+        readOutcome(row);
+        return 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,21 +205,29 @@ 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)
             return relation;
         const stated = relation.holds.trim() === 'true' ? '' : `${relation.holds} and `;
-        return {
-            ...relation,
-            holds: `${stated}${clauses.join(' and ')}`,
-            domain: relation.domain === '' ? clauses.join(', ') : `${relation.domain}; ${clauses.join(', ')}`,
-        };
+        return { ...relation, holds: `${stated}${clauses.join(' and ')}` };
     });
     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 +244,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,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,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,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;AAC7C,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;;;;;GAKG;AACH,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;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAuB;IACnD,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACrC,WAAW,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC,CAAC,CAAC;AACL,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,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;IACrE,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 { withinMixed } from '../core/compare.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 withinMixed(stored, computed, 1e-3);\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\n/**\n * Checks `row.outcome` arm by arm on the record's `kind` and narrows the row to\n * a loaded {@link CatalogConfrontation}: an assertion guard, so the loaded\n * record is a `ConfrontationOutcome` by inspection, not by a cast. A field\n * that is missing or of the wrong type throws naming the record.\n */\nfunction readOutcome(row: CatalogConfrontationRecord): asserts row is CatalogConfrontationRecord & CatalogConfrontation {\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}\n\nfunction narrowConfrontations(file: CatalogFileRecord): readonly CatalogConfrontation[] {\n  return file.confrontations.map((row) => {\n    readOutcome(row);\n    return row;\n  });\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 { ...relation, holds: `${stated}${clauses.join(' and ')}` };\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"]}

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

@@ -5,7 +5,7 @@
  * @module bridges/catalog-types
  */
 import type { Dimension } from '../dimensional/types.js';
-import type { Conventions, Counterexample, Regime, RelationContract } from '../relations/types.js';
+import type { ConfrontationOutcome } from './observations/types.js';
 import type { BridgeEquationEntry, BridgeEquationStatus } from './types.js';
 /**
  * Filing label. `cross-domain` means the equation links quantities or
@@ -14,20 +14,42 @@ import type { BridgeEquationEntry, BridgeEquationStatus } from './types.js';
  */
 export type CatalogFiling = 'standard' | 'cross-domain';
 /**
- * One catalog row. `derivedFrom` and `basis` are optional until a nested
- * derivation is pinned. `basis: false` is not a state this record carries.
+ * How far `lean/` proves a catalog record, best first. `full`: the record's
+ * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states
+ * the catalogued equation and the catalog path passes it to `deriveEvidence`.
+ * `weak`: the theorem proves part of the equation (a derivation-step, limit,
+ * reduction, property or cross-check) or its row is unreviewed. `pending`: the
+ * record has no Lean theorem. The order of this array is the rank.
+ *
+ * @internal
+ */
+export declare const PROOF_STATUSES: readonly ['full', 'weak', 'pending'];
+/** One of {@link PROOF_STATUSES}. @internal */
+export type ProofStatus = (typeof PROOF_STATUSES)[number];
+/**
+ * One catalog row. The row owns the relation contract, the regime, the
+ * conventions and the counterexamples; its relations carry no copy.
  */
 export interface CatalogEntry extends BridgeEquationEntry {
     readonly type: CatalogFiling;
-    readonly derivedFrom?: readonly string[];
-    readonly basis?: true;
-    /** The PhysJS manifest key. The reference and its kind are that entry's. */
+    /** The key of this record's entry in `formal/lean/manifest.json`. The reference and its kind are that entry's. */
     readonly formalKey?: string;
-    readonly assumptions?: readonly string[];
-    readonly scopeLimits?: readonly string[];
+    /**
+     * The Lean theorem that manifest entry names, present exactly when
+     * `formalKey` is. A projection of the manifest; `catalogFormalRef` refuses
+     * a record whose theorem is not the manifest's.
+     */
+    readonly theorem?: string;
+    /**
+     * The record's {@link ProofStatus}, a projection of `formalKey` and the
+     * manifest that `catalogProofProblems` checks against its derivation.
+     */
+    readonly proofStatus: ProofStatus;
     readonly dimension?: Dimension;
     /** The confrontation is a caller-supplied table, not a stored outcome. */
     readonly callerTable?: true;
+    /** The adjudication is contested; the row stays out of the null-result list until adjudicated. */
+    readonly contested?: true;
     /** A named statement this row's expression supports. */
     readonly statement?: string;
     /**
@@ -52,22 +74,15 @@ export interface CatalogRelation {
     readonly sources: readonly string[];
     readonly aliases: Readonly<Record<string, readonly string[]>>;
     readonly holds: string;
-    readonly domain: string;
     readonly confidence: 'established' | 'speculative' | 'highly-speculative';
     readonly citation: string;
     readonly coefficientUnset?: boolean;
     readonly formulaFactors?: Readonly<Record<string, number>>;
-    readonly relation?: RelationContract;
-    readonly regime?: Regime;
-    readonly conventions?: Conventions;
-    readonly counterexamples?: readonly Counterexample[];
     readonly reference?: CatalogReference;
     /** A caveat the record states beside its value. The text is the record's; nothing switches on it. */
     readonly notice?: {
         readonly text: string;
     };
-    /** A generic numerical method this record calls. Never a bridge number. */
-    readonly method?: string;
 }
 /** One named input of a catalog evaluator. */
 export interface CatalogEvaluatorParameter {
@@ -91,11 +106,12 @@ export interface CatalogEvaluatorParameter {
         readonly meaning: string;
         readonly toKey: number;
     }[];
-    readonly optional?: true;
 }
 /**
  * A second number the same record returns beside its `value`. The expression
- * reads evaluator parameter keys, the constants, and `value`.
+ * reads evaluator parameter keys, the constants, and `value`. It is computed
+ * when every parameter key it reads was given; a parameter only an output
+ * reads is optional.
  *
  * @public
  */
@@ -104,9 +120,8 @@ export interface CatalogEvaluatorOutput {
     readonly name: string;
     readonly unit: string;
     readonly meaning: string;
+    /** Read over the evaluator's inputs and `value`. The output is computed when every input it reads is given. */
     readonly expression: string;
-    /** Optional parameter keys this output needs. It is left out when one is not given. */
-    readonly requires?: readonly string[];
 }
 /** The input contract of one catalog evaluator. */
 export interface CatalogEvaluator {
@@ -115,19 +130,45 @@ export interface CatalogEvaluator {
     readonly parameters: readonly CatalogEvaluatorParameter[];
     readonly outputs?: readonly CatalogEvaluatorOutput[];
 }
-/** One committed data confrontation of a catalog record. */
+/**
+ * The prediction point of a value-kind confrontation, in the evaluator's input
+ * spellings. The evaluator at these inputs returns the outcome's `predicted`:
+ * its value, or the extra output `output` names.
+ */
+export interface CatalogPrediction {
+    readonly inputs: Readonly<Record<string, number>>;
+    readonly output?: string;
+}
+/** One committed data confrontation of a catalog record, its outcome narrowed on `kind` when the catalog loads. */
 export interface CatalogConfrontation {
     readonly catalogId: number;
     readonly title: string;
     readonly kind: 'value' | 'upper-bound' | 'consistency' | 'table';
     readonly rigor: 'stringent' | 'moderate' | 'loose';
-    readonly outcome: Record<string, unknown>;
-    /** Inputs of the prediction, in catalog quantity names, when elasticity is defined. */
-    readonly prediction?: {
-        readonly inputs: Readonly<Record<string, number>>;
-    };
+    readonly outcome: ConfrontationOutcome;
+    readonly prediction?: CatalogPrediction;
 }
-/** The on-disk catalog: schema 3, entries, relations, evaluators, and confrontations. */
+/** A confrontation as the file stores it: the outcome is checked arm by arm when the catalog loads. */
+export type CatalogConfrontationRecord = Omit<CatalogConfrontation, 'outcome'> & {
+    readonly outcome: Readonly<Record<string, unknown>>;
+};
+/** One row of the negative catalog: adjudicated not-a-bridge under the membership criterion. */
+export interface CatalogRejection {
+    readonly catalogId: number;
+    readonly name: string;
+    /** Why the endpoints do NOT differ in regime attributes. */
+    readonly reason: string;
+    readonly citation: string;
+}
+/**
+ * A relation as the file stores it. `confidence` is stored only on a relation
+ * that has no catalog row; a relation with a row takes its row's `status`
+ * when the catalog loads, so the two cannot drift.
+ */
+export type CatalogRelationRecord = Omit<CatalogRelation, 'confidence'> & {
+    readonly confidence?: CatalogRelation['confidence'];
+};
+/** The loaded catalog: schema 3, entries, relations, evaluators, confrontations, the two ledgers and the spine. */
 export interface CatalogFile {
     readonly schemaVersion: 3;
     readonly packageVersion: string;
@@ -137,8 +178,15 @@ export interface CatalogFile {
     readonly confrontations: readonly CatalogConfrontation[];
     /** The adjudication ledger: recorded verdicts on identification hypotheses. `composition/adjudication.ts` projects it. */
     readonly adjudications: readonly CatalogAdjudication[];
+    /** The negative catalog. `bridges/rejected.ts` projects it. */
+    readonly rejections: readonly CatalogRejection[];
     readonly spine: Readonly<Record<string, Readonly<Record<string, number>>>>;
 }
+/** The catalog as `data/bridge-catalog.json` stores it, before the loader derives the per-relation fields and narrows each outcome. */
+export type CatalogFileRecord = Omit<CatalogFile, 'relations' | 'confrontations'> & {
+    readonly relations: readonly CatalogRelationRecord[];
+    readonly confrontations: readonly CatalogConfrontationRecord[];
+};
 /**
  * A recorded human verdict on an identification hypothesis `a ≟ b`.
  * - `genuine`  — real physics AND a new link (nothing recorded qualifies yet).

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

@@ -1 +1 @@
-{"version":3,"file":"catalog-types.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACnG,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAEpB;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,cAAc,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,YAAa,SAAQ,mBAAmB;IACvD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC;IACtB,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC;IAC5B,wDAAwD;IACxD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,gEAAgE;AAChE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,aAAa,GAAG,aAAa,GAAG,oBAAoB,CAAC;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IACrC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IACrD,QAAQ,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC;IACtC,qGAAqG;IACrG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,8CAA8C;AAC9C,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;IAClG,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,KAAK,CAAC;IACnD,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5G,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC;CAC1B;AAED;;;;;GAKG;AACH,MAAM,WAAW,sBAAsB;IACrC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,uFAAuF;IACvF,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,SAAS,yBAAyB,EAAE,CAAC;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACtD;AAED,4DAA4D;AAC5D,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,OAAO,CAAC;IACjE,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1C,uFAAuF;IACvF,QAAQ,CAAC,UAAU,CAAC,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;KAAE,CAAC;CAC7E;AAED,yFAAyF;AACzF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,SAAS,eAAe,EAAE,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzD,0HAA0H;IAC1H,QAAQ,CAAC,aAAa,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACvD,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E;AAED;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhF,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,+FAA+F;IAC/F,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yCAAyC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yCAAyC;AACzC,YAAY,EAAE,oBAAoB,EAAE,CAAC"}
+{"version":3,"file":"catalog-types.d.ts","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAEpB;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,cAAc,CAAC;AAExD;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,YAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAU,CAAC;AAEnE,+CAA+C;AAC/C,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1D;;;GAGG;AACH,MAAM,WAAW,YAAa,SAAQ,mBAAmB;IACvD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,kHAAkH;IAClH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAClC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC;IAC5B,kGAAkG;IAClG,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC;IAC1B,wDAAwD;IACxD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,gEAAgE;AAChE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,aAAa,GAAG,aAAa,GAAG,oBAAoB,CAAC;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC;IACtC,qGAAqG;IACrG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAED,8CAA8C;AAC9C,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;IAClG,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,KAAK,CAAC;IACnD,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC7G;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,sBAAsB;IACrC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,+GAA+G;IAC/G,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,mDAAmD;AACnD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,SAAS,yBAAyB,EAAE,CAAC;IAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACtD;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,mHAAmH;AACnH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,OAAO,CAAC;IACjE,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,oBAAoB,CAAC;IACvC,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;CACzC;AAED,uGAAuG;AACvG,MAAM,MAAM,0BAA0B,GAAG,IAAI,CAAC,oBAAoB,EAAE,SAAS,CAAC,GAAG;IAC/E,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACrD,CAAC;AAEF,gGAAgG;AAChG,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,MAAM,qBAAqB,GAAG,IAAI,CAAC,eAAe,EAAE,YAAY,CAAC,GAAG;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,eAAe,CAAC,YAAY,CAAC,CAAC;CACrD,CAAC;AAEF,mHAAmH;AACnH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,SAAS,eAAe,EAAE,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,cAAc,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzD,0HAA0H;IAC1H,QAAQ,CAAC,aAAa,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E;AAED,uIAAuI;AACvI,MAAM,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,EAAE,WAAW,GAAG,gBAAgB,CAAC,GAAG;IAClF,QAAQ,CAAC,SAAS,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACrD,QAAQ,CAAC,cAAc,EAAE,SAAS,0BAA0B,EAAE,CAAC;CAChE,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhF,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,+FAA+F;IAC/F,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yCAAyC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yCAAyC;AACzC,YAAY,EAAE,oBAAoB,EAAE,CAAC"}

package/dist/bridges/catalog-types.js

@@ -4,5 +4,15 @@
  *
  * @module bridges/catalog-types
  */
-export {};
+/**
+ * How far `lean/` proves a catalog record, best first. `full`: the record's
+ * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states
+ * the catalogued equation and the catalog path passes it to `deriveEvidence`.
+ * `weak`: the theorem proves part of the equation (a derivation-step, limit,
+ * reduction, property or cross-check) or its row is unreviewed. `pending`: the
+ * record has no Lean theorem. The order of this array is the rank.
+ *
+ * @internal
+ */
+export const PROOF_STATUSES = ['full', 'weak', 'pending'];
 //# sourceMappingURL=catalog-types.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"catalog-types.js","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}
+{"version":3,"file":"catalog-types.js","sourceRoot":"","sources":["../../src/bridges/catalog-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgBH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAU,CAAC","sourcesContent":["/**\n * Catalog record shapes. The file `data/bridge-catalog.json` is the source.\n * A bridge number is the `id` field. It is not a code identifier.\n *\n * @module bridges/catalog-types\n */\n\nimport type { Dimension } from '../dimensional/types.js';\nimport type { ConfrontationOutcome } from './observations/types.js';\nimport type {\n  BridgeEquationEntry,\n  BridgeEquationStatus,\n} from './types.js';\n\n/**\n * Filing label. `cross-domain` means the equation links quantities or\n * constants from two distinct fields. `standard` means it stays inside one.\n * Absence is not a state this record carries.\n */\nexport type CatalogFiling = 'standard' | 'cross-domain';\n\n/**\n * How far `lean/` proves a catalog record, best first. `full`: the record's\n * Lean theorem is kind `bridge` and its manifest row is reviewed, so it states\n * the catalogued equation and the catalog path passes it to `deriveEvidence`.\n * `weak`: the theorem proves part of the equation (a derivation-step, limit,\n * reduction, property or cross-check) or its row is unreviewed. `pending`: the\n * record has no Lean theorem. The order of this array is the rank.\n *\n * @internal\n */\nexport const PROOF_STATUSES = ['full', 'weak', 'pending'] as const;\n\n/** One of {@link PROOF_STATUSES}. @internal */\nexport type ProofStatus = (typeof PROOF_STATUSES)[number];\n\n/**\n * One catalog row. The row owns the relation contract, the regime, the\n * conventions and the counterexamples; its relations carry no copy.\n */\nexport interface CatalogEntry extends BridgeEquationEntry {\n  readonly type: CatalogFiling;\n  /** The key of this record's entry in `formal/lean/manifest.json`. The reference and its kind are that entry's. */\n  readonly formalKey?: string;\n  /**\n   * The Lean theorem that manifest entry names, present exactly when\n   * `formalKey` is. A projection of the manifest; `catalogFormalRef` refuses\n   * a record whose theorem is not the manifest's.\n   */\n  readonly theorem?: string;\n  /**\n   * The record's {@link ProofStatus}, a projection of `formalKey` and the\n   * manifest that `catalogProofProblems` checks against its derivation.\n   */\n  readonly proofStatus: ProofStatus;\n  readonly dimension?: Dimension;\n  /** The confrontation is a caller-supplied table, not a stored outcome. */\n  readonly callerTable?: true;\n  /** The adjudication is contested; the row stays out of the null-result list until adjudicated. */\n  readonly contested?: true;\n  /** A named statement this row's expression supports. */\n  readonly statement?: string;\n  /**\n   * Scalar expression for a row that has no relation. The structural\n   * registry parses it. It is not a graph edge and it is not evaluated.\n   */\n  readonly scalarExpression?: string;\n}\n\n/** Inputs and the number the engine returns at those inputs. */\nexport interface CatalogReference {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly value: number;\n}\n\n/** One closed form. Several relations may share one catalog id. */\nexport interface CatalogRelation {\n  readonly id: string;\n  readonly catalogId: number | null;\n  readonly kind: 'bridge' | 'law';\n  readonly label: string;\n  readonly expression: string;\n  readonly target: string;\n  readonly sources: readonly string[];\n  readonly aliases: Readonly<Record<string, readonly string[]>>;\n  readonly holds: string;\n  readonly confidence: 'established' | 'speculative' | 'highly-speculative';\n  readonly citation: string;\n  readonly coefficientUnset?: boolean;\n  readonly formulaFactors?: Readonly<Record<string, number>>;\n  readonly reference?: CatalogReference;\n  /** A caveat the record states beside its value. The text is the record's; nothing switches on it. */\n  readonly notice?: { readonly text: string };\n}\n\n/** One named input of a catalog evaluator. */\nexport interface CatalogEvaluatorParameter {\n  readonly key: string;\n  readonly quantity: string;\n  readonly symbol: string;\n  readonly unit: string;\n  readonly meaning: string;\n  readonly geometry?: 'radius' | 'diameter' | 'separation' | 'impact-parameter' | 'semi-major-axis';\n  readonly temperature?: 'absolute';\n  /**\n   * The sign this input must have. `positive` is `> 0`, `nonnegative` is `>= 0`,\n   * and `any` states that the quantity is signed and overrides the temperature\n   * rule. An absolute temperature is `nonnegative` when no sign is stated.\n   */\n  readonly sign?: 'positive' | 'nonnegative' | 'any';\n  /** An angular frequency in rad/s. A cycle unit (Hz, rpm) given to it is multiplied by 2π. */\n  readonly angular?: true;\n  readonly alternates?: readonly { readonly key: string; readonly meaning: string; readonly toKey: number }[];\n}\n\n/**\n * A second number the same record returns beside its `value`. The expression\n * reads evaluator parameter keys, the constants, and `value`. It is computed\n * when every parameter key it reads was given; a parameter only an output\n * reads is optional.\n *\n * @public\n */\nexport interface CatalogEvaluatorOutput {\n  /** The result key, with its unit as a suffix (`E_F_J`). */\n  readonly name: string;\n  readonly unit: string;\n  readonly meaning: string;\n  /** Read over the evaluator's inputs and `value`. The output is computed when every input it reads is given. */\n  readonly expression: string;\n}\n\n/** The input contract of one catalog evaluator. */\nexport interface CatalogEvaluator {\n  readonly catalogId: number;\n  readonly name: string;\n  readonly parameters: readonly CatalogEvaluatorParameter[];\n  readonly outputs?: readonly CatalogEvaluatorOutput[];\n}\n\n/**\n * The prediction point of a value-kind confrontation, in the evaluator's input\n * spellings. The evaluator at these inputs returns the outcome's `predicted`:\n * its value, or the extra output `output` names.\n */\nexport interface CatalogPrediction {\n  readonly inputs: Readonly<Record<string, number>>;\n  readonly output?: string;\n}\n\n/** One committed data confrontation of a catalog record, its outcome narrowed on `kind` when the catalog loads. */\nexport interface CatalogConfrontation {\n  readonly catalogId: number;\n  readonly title: string;\n  readonly kind: 'value' | 'upper-bound' | 'consistency' | 'table';\n  readonly rigor: 'stringent' | 'moderate' | 'loose';\n  readonly outcome: ConfrontationOutcome;\n  readonly prediction?: CatalogPrediction;\n}\n\n/** A confrontation as the file stores it: the outcome is checked arm by arm when the catalog loads. */\nexport type CatalogConfrontationRecord = Omit<CatalogConfrontation, 'outcome'> & {\n  readonly outcome: Readonly<Record<string, unknown>>;\n};\n\n/** One row of the negative catalog: adjudicated not-a-bridge under the membership criterion. */\nexport interface CatalogRejection {\n  readonly catalogId: number;\n  readonly name: string;\n  /** Why the endpoints do NOT differ in regime attributes. */\n  readonly reason: string;\n  readonly citation: string;\n}\n\n/**\n * A relation as the file stores it. `confidence` is stored only on a relation\n * that has no catalog row; a relation with a row takes its row's `status`\n * when the catalog loads, so the two cannot drift.\n */\nexport type CatalogRelationRecord = Omit<CatalogRelation, 'confidence'> & {\n  readonly confidence?: CatalogRelation['confidence'];\n};\n\n/** The loaded catalog: schema 3, entries, relations, evaluators, confrontations, the two ledgers and the spine. */\nexport interface CatalogFile {\n  readonly schemaVersion: 3;\n  readonly packageVersion: string;\n  readonly entries: readonly CatalogEntry[];\n  readonly relations: readonly CatalogRelation[];\n  readonly evaluators: readonly CatalogEvaluator[];\n  readonly confrontations: readonly CatalogConfrontation[];\n  /** The adjudication ledger: recorded verdicts on identification hypotheses. `composition/adjudication.ts` projects it. */\n  readonly adjudications: readonly CatalogAdjudication[];\n  /** The negative catalog. `bridges/rejected.ts` projects it. */\n  readonly rejections: readonly CatalogRejection[];\n  readonly spine: Readonly<Record<string, Readonly<Record<string, number>>>>;\n}\n\n/** The catalog as `data/bridge-catalog.json` stores it, before the loader derives the per-relation fields and narrows each outcome. */\nexport type CatalogFileRecord = Omit<CatalogFile, 'relations' | 'confrontations'> & {\n  readonly relations: readonly CatalogRelationRecord[];\n  readonly confrontations: readonly CatalogConfrontationRecord[];\n};\n\n/**\n * A recorded human verdict on an identification hypothesis `a ≟ b`.\n * - `genuine`  — real physics AND a new link (nothing recorded qualifies yet).\n * - `entailed` — real physics already carried by the L-layer; not a new link.\n * - `decoy`    — dimensional coincidence / no mechanism, including trivial and definitional identifications.\n * - `deferred` — reviewed and consciously parked (not the same as absent, which means never reviewed).\n */\nexport type AdjudicationVerdict = 'genuine' | 'decoy' | 'entailed' | 'deferred';\n\n/** One record of the adjudication ledger in `data/bridge-catalog.json`. */\nexport interface CatalogAdjudication {\n  /** `candidateId(a, b)` of the identification: the two slugs in sorted order, joined by `~`. */\n  readonly id: string;\n  readonly verdict: AdjudicationVerdict;\n  /** Why, condensed from the adjudication document; never machine-generated. */\n  readonly grounds: string;\n  /** Repo-relative path of the adjudication document. */\n  readonly source: string;\n  /** ISO date the verdict was recorded. */\n  readonly date: string;\n}\n\n/** Lifecycle status of a catalog row. */\nexport type { BridgeEquationStatus };\n"]}

package/dist/bridges/coefficient-statement.js

@@ -21,11 +21,7 @@ export function oneLoopCoefficientStatement(colorNumber, flavorNumber) {
     if (relation === undefined) {
         throw new Error('oneLoopCoefficientStatement: the statement has no expression');
     }
-    const beta = evaluateFormula(relation.expression, {
-        'gauge-coupling': 1,
-        'color-number': colorNumber,
-        'flavor-number': flavorNumber,
-    });
+    const beta = evaluateFormula(relation.expression, { 'gauge-coupling': 1, 'color-number': colorNumber, 'flavor-number': flavorNumber }, relation.sources);
     const b0 = -beta * 16 * Math.PI * Math.PI;
     const sign = b0 > 0 ? 'positive' : b0 < 0 ? 'negative' : 'zero';
     return { label: 'one-loop coefficient', sign, b0 };

package/dist/bridges/coefficient-statement.js.map

@@ -1 +1 @@
-{"version":3,"file":"coefficient-statement.js","sourceRoot":"","sources":["../../src/bridges/coefficient-statement.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAiBlD;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CACzC,WAAmB,EACnB,YAAoB;IAEpB,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,sBAAsB,CAAC,CAAC;IACvF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,gFAAgF,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,CAAC,UAAU,EAAE;QAChD,gBAAgB,EAAE,CAAC;QACnB,cAAc,EAAE,WAAW;QAC3B,eAAe,EAAE,YAAY;KAC9B,CAAC,CAAC;IACH,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC1C,MAAM,IAAI,GAA2B,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IACxF,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC"}
+{"version":3,"file":"coefficient-statement.js","sourceRoot":"","sources":["../../src/bridges/coefficient-statement.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAiBlD;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CACzC,WAAmB,EACnB,YAAoB;IAEpB,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,KAAK,sBAAsB,CAAC,CAAC;IACvF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,gFAAgF,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,IAAI,GAAG,eAAe,CAC1B,QAAQ,CAAC,UAAU,EACnB,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,WAAW,EAAE,eAAe,EAAE,YAAY,EAAE,EACnF,QAAQ,CAAC,OAAO,CACjB,CAAC;IACF,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC1C,MAAM,IAAI,GAA2B,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IACxF,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC","sourcesContent":["/**\n * Sign of the one-loop coefficient, read from the catalog expression.\n * The statement is the coefficient, not a residual against a measurement.\n *\n * @module bridges/coefficient-statement\n */\n\nimport { catalogEntries, primaryRelation } from './catalog-load.js';\nimport { evaluateFormula } from './expr-parse.js';\n\n/** Sign of the one-loop coefficient. @public */\nexport type OneLoopCoefficientSign = 'positive' | 'zero' | 'negative';\n\n/**\n * Whether b₀ is positive, zero, or negative for a stated color number and\n * flavor number. Positive is asymptotic freedom in this one-loop truncation.\n *\n * @public\n */\nexport interface OneLoopCoefficientStatement {\n  readonly label: 'one-loop coefficient';\n  readonly sign: OneLoopCoefficientSign;\n  readonly b0: number;\n}\n\n/**\n * State the sign of b₀ for the catalog row whose statement is the one-loop\n * coefficient. At unit coupling, β = −b₀ / (16π²).\n *\n * @public\n */\nexport function oneLoopCoefficientStatement(\n  colorNumber: number,\n  flavorNumber: number,\n): OneLoopCoefficientStatement {\n  const entry = catalogEntries().find((row) => row.statement === 'one-loop-coefficient');\n  if (entry === undefined) {\n    throw new Error('oneLoopCoefficientStatement: the catalog has no one-loop coefficient statement');\n  }\n  const relation = primaryRelation(entry.id);\n  if (relation === undefined) {\n    throw new Error('oneLoopCoefficientStatement: the statement has no expression');\n  }\n  const beta = evaluateFormula(\n    relation.expression,\n    { 'gauge-coupling': 1, 'color-number': colorNumber, 'flavor-number': flavorNumber },\n    relation.sources,\n  );\n  const b0 = -beta * 16 * Math.PI * Math.PI;\n  const sign: OneLoopCoefficientSign = b0 > 0 ? 'positive' : b0 < 0 ? 'negative' : 'zero';\n  return { label: 'one-loop coefficient', sign, b0 };\n}\n"]}

package/dist/bridges/confrontation-coverage.js.map

@@ -1 +1 @@
-{"version":3,"file":"confrontation-coverage.js","sourceRoot":"","sources":["../../src/bridges/confrontation-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CAC7D,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CACjD,CAAC"}
+{"version":3,"file":"confrontation-coverage.js","sourceRoot":"","sources":["../../src/bridges/confrontation-coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CAC7D,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CACjD,CAAC","sourcesContent":["/**\n * Catalog ids with a committed real-data confrontation.\n *\n * `DATA_CONFRONTED_IDS` is a sorted projection of `CONFRONTATIONS`.\n * `composition/bridge-analysis.ts` imports it in the allowed direction.\n * The coverage audit that scans `CATALOG_GRAPH` lives in\n * `composition/audit-coverage.ts`. This file does not import `composition/`.\n *\n * @module bridges/confrontation-coverage\n */\n\nimport { CONFRONTATIONS } from './confrontations.js';\n\n/**\n * Catalog ids with a committed real-data confrontation — a SORTED\n * projection of the confrontation registry's keyset (single source of\n * truth; adding a `ConfrontationEntry` grows this set automatically).\n * Consumed by `composition/bridge-analysis.ts` for the scorecard's\n * data-confrontation flag.\n *\n * @internal\n */\nexport const DATA_CONFRONTED_IDS: ReadonlySet<number> = new Set(\n  [...CONFRONTATIONS.keys()].sort((a, b) => a - b),\n);\n"]}