@memberjunction/integration-pk-classifier 0.0.1 → 5.39.0

package/dist/SoftPKClassifier.d.ts

@@ -0,0 +1,141 @@
+import type { MJIntegrationObjectEntity, MJIntegrationObjectFieldEntity } from '@memberjunction/core-entities';
+/** Strategy that produced the classifier's nominee, when one exists. */
+export type PKClassifierStrategy = 'universal-convention' | 'naming-heuristic' | 'statistical' | 'composite' | 'llm' | 'synthetic' | 'none';
+/**
+ * Canonical name of the synthetic identity-hash column nominated by the
+ * synthetic-fallback tier. The framework materializes this column (an identity
+ * hash of the record) so a table that has no provable natural PK is still
+ * syncable (plan.md §4).
+ */
+export declare const SYNTHETIC_PK_FIELD_NAME: "__mj_integration_IdentityHash";
+/** Result returned by SoftPKClassifier.Classify(). */
+export interface PKClassifierResult {
+    /** Whether the classifier reached a confident nominee. */
+    Confident: boolean;
+    /**
+     * Field name of the PK nominee, when Confident=true.
+     * - Single-column natural PK → the resolving column's name.
+     * - Synthetic fallback → SYNTHETIC_PK_FIELD_NAME.
+     * - Composite key → the first member of NomineeFields (for callers that
+     *   only read a single name); NomineeFields carries the full set.
+     */
+    Nominee?: string;
+    /**
+     * Ordered set of field names that together form the key. Populated for the
+     * composite strategy (the minimal unique+stable column set). For single-column
+     * and synthetic strategies this is the one-element set matching Nominee.
+     */
+    NomineeFields?: string[];
+    /** Confidence score 0..1. */
+    Confidence: number;
+    /** Which strategy in the cascade produced the nominee. */
+    Strategy: PKClassifierStrategy;
+    /** Human-readable reason — used in audit trail + structured progress events. */
+    Reason: string;
+}
+/** Options passed per Classify() call. */
+export interface ClassifyOptions {
+    /** The IntegrationObject being classified. */
+    object: MJIntegrationObjectEntity;
+    /** All IOF rows for that object. */
+    fields: MJIntegrationObjectFieldEntity[];
+    /**
+     * Optional vendor-wide universal PK hint (e.g. "all HubSpot object PKs are `id`").
+     * When set and a matching field exists, returned with strategy='universal-convention'
+     * and high confidence. Agent populates this from research.
+     */
+    universalConvention?: string;
+    /**
+     * Optional pre-fetched sample rows for statistical uniqueness check.
+     * When omitted, the statistical step is skipped (no chicken-and-egg fetching).
+     */
+    sampleRows?: Array<Record<string, unknown>>;
+    /**
+     * Optional LLM callback for the one-shot fallback. When omitted, the LLM step
+     * is skipped and the classifier returns Confident=false rather than guessing.
+     */
+    llmInference?: LLMOneShotCallback;
+    /** Confidence floor for Confident=true. Defaults to 0.7. */
+    confidenceFloor?: number;
+    /**
+     * Largest column-set size the composite-key uniqueness scan will try when
+     * no single column is unique. Defaults to 3 (try 2-col then 3-col sets).
+     * Only consulted when sampleRows are present.
+     */
+    maxCompositeKeySize?: number;
+    /**
+     * When true (default), and every other tier fails to find/prove a PK, the
+     * classifier returns a Confident synthetic verdict nominating
+     * SYNTHETIC_PK_FIELD_NAME — an identity-hash column the framework
+     * materializes so NO table is left without a PK (plan.md §4). Set false to
+     * opt out and receive the honest 'none' verdict instead.
+     */
+    syntheticFallback?: boolean;
+}
+/** Callback shape for the one-shot LLM step. */
+export type LLMOneShotCallback = (prompt: LLMPrompt) => Promise<LLMResponse>;
+export interface LLMPrompt {
+    objectName: string;
+    fields: Array<{
+        name: string;
+        type?: string | null;
+        isUnique?: boolean | null;
+        length?: number | null;
+    }>;
+    sampleSnippet?: string;
+}
+export interface LLMResponse {
+    nominee: string | null;
+    confidence: number;
+    reason: string;
+}
+/**
+ * Lightweight PK classifier. Cascade (each step is independent; first confident
+ * nominee wins):
+ *
+ *   1. Universal convention   — vendor-wide hint matches a field
+ *   2. Naming heuristic       — common PK names (id, ID, <ObjectName>Id, …)
+ *   3. Statistical uniqueness — sample rows: exactly one column is unique+non-null
+ *   4. One-shot LLM           — single inference; no iteration; honest 'none'
+ *
+ * Returns Confident=false when nothing is confident enough. The pipeline then
+ * leaves the IO row PK-less; no `__mj.Entity` is created for it until a PK
+ * resolves (the runtime D7 rule). No fabrication.
+ */
+export declare class SoftPKClassifier {
+    Classify(opts: ClassifyOptions): Promise<PKClassifierResult>;
+    /**
+     * Terminal tier. When syntheticFallback is on (default), nominates the
+     * synthetic identity-hash column so no table is left PK-less (plan.md §4).
+     * When off, returns the honest 'none' verdict.
+     */
+    private finalVerdict;
+    /** Case-insensitive equality with simple whitespace tolerance. */
+    private nameMatches;
+    /** Common PK naming patterns. Order matters — most-specific first. */
+    private namingHeuristic;
+    /** Sample uniqueness: exactly one field is unique + non-null across the sample. */
+    private statisticalUniqueness;
+    /**
+     * Composite-key uniqueness: when no single column uniquely identifies a row,
+     * search for the SMALLEST set of columns (size 2..maxSetSize) whose
+     * concatenated values are unique + non-null across the sample. Returns the
+     * minimal such set; among sets of equal size, the one over the fewest-
+     * distinct-but-still-unique columns wins (deterministic by field order).
+     */
+    private compositeUniqueness;
+    /** Columns that are non-null across every sample row (PK members must be non-null). */
+    private stableColumns;
+    /** First combination of `size` columns whose concatenated values are all distinct. */
+    private firstUniqueCombination;
+    /** Whether the concatenated values of `combo` are distinct across all rows. */
+    private isCombinationUnique;
+    /** Lazily yield all k-combinations of `items`, preserving input order. */
+    private combinations;
+    /** A value counts as present (non-null) for PK purposes. */
+    private isPresent;
+    /** Very simple singularization — sufficient for common cases (Members→Member, Companies→Companie isn't perfect but covers most). */
+    private singularize;
+    private escapeRe;
+}
+//# sourceMappingURL=SoftPKClassifier.d.ts.map

package/dist/SoftPKClassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SoftPKClassifier.d.ts","sourceRoot":"","sources":["../src/SoftPKClassifier.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACR,yBAAyB,EACzB,8BAA8B,EACjC,MAAM,+BAA+B,CAAC;AAEvC,wEAAwE;AACxE,MAAM,MAAM,oBAAoB,GAC1B,sBAAsB,GACtB,kBAAkB,GAClB,aAAa,GACb,WAAW,GACX,KAAK,GACL,WAAW,GACX,MAAM,CAAC;AAEb;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,EAAG,+BAAwC,CAAC;AAEhF,sDAAsD;AACtD,MAAM,WAAW,kBAAkB;IAC/B,0DAA0D;IAC1D,SAAS,EAAE,OAAO,CAAC;IACnB;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,QAAQ,EAAE,oBAAoB,CAAC;IAC/B,gFAAgF;IAChF,MAAM,EAAE,MAAM,CAAC;CAClB;AAED,0CAA0C;AAC1C,MAAM,WAAW,eAAe;IAC5B,8CAA8C;IAC9C,MAAM,EAAE,yBAAyB,CAAC;IAClC,oCAAoC;IACpC,MAAM,EAAE,8BAA8B,EAAE,CAAC;IACzC;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;OAGG;IACH,UAAU,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5C;;;OAGG;IACH,YAAY,CAAC,EAAE,kBAAkB,CAAC;IAClC,4DAA4D;IAC5D,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED,gDAAgD;AAChD,MAAM,MAAM,kBAAkB,GAAG,CAAC,MAAM,EAAE,SAAS,KAAK,OAAO,CAAC,WAAW,CAAC,CAAC;AAC7E,MAAM,WAAW,SAAS;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC,CAAC;IACzG,aAAa,CAAC,EAAE,MAAM,CAAC;CAC1B;AACD,MAAM,WAAW,WAAW;IACxB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;GAYG;AACH,qBAAa,gBAAgB;IACZ,QAAQ,CAAC,IAAI,EAAE,eAAe,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAmGzE;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAoBpB,kEAAkE;IAClE,OAAO,CAAC,WAAW;IAInB,sEAAsE;IACtE,OAAO,CAAC,eAAe;IAyBvB,mFAAmF;IACnF,OAAO,CAAC,qBAAqB;IA6B7B;;;;;;OAMG;IACH,OAAO,CAAC,mBAAmB;IAqB3B,uFAAuF;IACvF,OAAO,CAAC,aAAa;IASrB,sFAAsF;IACtF,OAAO,CAAC,sBAAsB;IAW9B,+EAA+E;IAC/E,OAAO,CAAC,mBAAmB;IAU3B,0EAA0E;IAC1E,OAAO,CAAE,YAAY;IAcrB,4DAA4D;IAC5D,OAAO,CAAC,SAAS;IAIjB,oIAAoI;IACpI,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,QAAQ;CAGnB"}

package/dist/SoftPKClassifier.js

@@ -0,0 +1,278 @@
+/**
+ * Canonical name of the synthetic identity-hash column nominated by the
+ * synthetic-fallback tier. The framework materializes this column (an identity
+ * hash of the record) so a table that has no provable natural PK is still
+ * syncable (plan.md §4).
+ */
+export const SYNTHETIC_PK_FIELD_NAME = '__mj_integration_IdentityHash';
+/**
+ * Lightweight PK classifier. Cascade (each step is independent; first confident
+ * nominee wins):
+ *
+ *   1. Universal convention   — vendor-wide hint matches a field
+ *   2. Naming heuristic       — common PK names (id, ID, <ObjectName>Id, …)
+ *   3. Statistical uniqueness — sample rows: exactly one column is unique+non-null
+ *   4. One-shot LLM           — single inference; no iteration; honest 'none'
+ *
+ * Returns Confident=false when nothing is confident enough. The pipeline then
+ * leaves the IO row PK-less; no `__mj.Entity` is created for it until a PK
+ * resolves (the runtime D7 rule). No fabrication.
+ */
+export class SoftPKClassifier {
+    async Classify(opts) {
+        const floor = opts.confidenceFloor ?? 0.7;
+        // 1) Universal convention
+        if (opts.universalConvention) {
+            const m = opts.fields.find(f => this.nameMatches(f.Name, opts.universalConvention));
+            if (m) {
+                return {
+                    Confident: true,
+                    Nominee: m.Name,
+                    Confidence: 0.95,
+                    Strategy: 'universal-convention',
+                    Reason: `Vendor universal convention "${opts.universalConvention}" matched field "${m.Name}".`,
+                };
+            }
+        }
+        // 2) Naming heuristic
+        const namingMatch = this.namingHeuristic(opts.object.Name, opts.fields);
+        if (namingMatch) {
+            return {
+                Confident: true,
+                Nominee: namingMatch.fieldName,
+                Confidence: namingMatch.confidence,
+                Strategy: 'naming-heuristic',
+                Reason: namingMatch.reason,
+            };
+        }
+        // 3) Statistical (when sample rows present)
+        if (opts.sampleRows && opts.sampleRows.length > 0) {
+            const statMatch = this.statisticalUniqueness(opts.fields, opts.sampleRows);
+            if (statMatch && statMatch.confidence >= floor) {
+                return {
+                    Confident: true,
+                    Nominee: statMatch.fieldName,
+                    NomineeFields: [statMatch.fieldName],
+                    Confidence: statMatch.confidence,
+                    Strategy: 'statistical',
+                    Reason: statMatch.reason,
+                };
+            }
+        }
+        // 3b) Composite uniqueness (when no single column is unique) — try minimal
+        //     2- then 3-col concatenated key sets; smallest unique+stable set wins.
+        if (opts.sampleRows && opts.sampleRows.length > 0) {
+            const maxSetSize = opts.maxCompositeKeySize ?? 3;
+            const compMatch = this.compositeUniqueness(opts.fields, opts.sampleRows, maxSetSize);
+            if (compMatch && compMatch.confidence >= floor) {
+                return {
+                    Confident: true,
+                    Nominee: compMatch.fieldNames[0],
+                    NomineeFields: compMatch.fieldNames,
+                    Confidence: compMatch.confidence,
+                    Strategy: 'composite',
+                    Reason: compMatch.reason,
+                };
+            }
+        }
+        // 4) LLM one-shot (when callback provided)
+        if (opts.llmInference) {
+            try {
+                const llm = await opts.llmInference({
+                    objectName: opts.object.Name,
+                    fields: opts.fields.map(f => ({
+                        name: f.Name,
+                        type: f.Type ?? null,
+                        isUnique: f.IsUniqueKey,
+                        length: f.Length ?? null,
+                    })),
+                    sampleSnippet: opts.sampleRows ? JSON.stringify(opts.sampleRows.slice(0, 3)) : undefined,
+                });
+                if (llm.nominee && llm.confidence >= floor) {
+                    const exists = opts.fields.some(f => f.Name === llm.nominee);
+                    if (exists) {
+                        return {
+                            Confident: true,
+                            Nominee: llm.nominee,
+                            NomineeFields: [llm.nominee],
+                            Confidence: llm.confidence,
+                            Strategy: 'llm',
+                            Reason: llm.reason || 'LLM one-shot classification.',
+                        };
+                    }
+                }
+            }
+            catch (err) {
+                // LLM failures never crash the pipeline. Fall through to the synthetic
+                // fallback (when enabled) so the table is still rescued; otherwise 'none'.
+                const llmFailNote = `LLM inference failed: ${err instanceof Error ? err.message : String(err)}.`;
+                return this.finalVerdict(opts, llmFailNote);
+            }
+        }
+        // 5) Synthetic fallback (default) or honest no-PK.
+        return this.finalVerdict(opts);
+    }
+    /**
+     * Terminal tier. When syntheticFallback is on (default), nominates the
+     * synthetic identity-hash column so no table is left PK-less (plan.md §4).
+     * When off, returns the honest 'none' verdict.
+     */
+    finalVerdict(opts, prefix) {
+        const note = prefix ? `${prefix} ` : '';
+        if (opts.syntheticFallback ?? true) {
+            return {
+                Confident: true,
+                Nominee: SYNTHETIC_PK_FIELD_NAME,
+                NomineeFields: [SYNTHETIC_PK_FIELD_NAME],
+                Confidence: 0.7,
+                Strategy: 'synthetic',
+                Reason: `${note}No natural PK proven via universal-convention, naming, statistical, composite, or LLM strategies. Falling back to a synthetic identity-hash key "${SYNTHETIC_PK_FIELD_NAME}" so the table remains syncable (plan.md §4).`,
+            };
+        }
+        return {
+            Confident: false,
+            Confidence: 0,
+            Strategy: 'none',
+            Reason: `${note}No confident PK candidate via universal-convention, naming, statistical, composite, or LLM strategies, and synthetic fallback is disabled. IO row persists; MJ entity not generated until a PK resolves.`,
+        };
+    }
+    /** Case-insensitive equality with simple whitespace tolerance. */
+    nameMatches(actual, hint) {
+        return actual.trim().toLowerCase() === hint.trim().toLowerCase();
+    }
+    /** Common PK naming patterns. Order matters — most-specific first. */
+    namingHeuristic(objectName, fields) {
+        const sing = this.singularize(objectName);
+        const candidates = [
+            { pattern: new RegExp(`^${this.escapeRe(sing)}_?id$`, 'i'), confidence: 0.9, reasonTpl: 'Field matches "<ObjectNameSingular>Id" pattern' },
+            { pattern: new RegExp(`^${this.escapeRe(objectName)}_?id$`, 'i'), confidence: 0.88, reasonTpl: 'Field matches "<ObjectName>Id" pattern' },
+            { pattern: /^id$/i, confidence: 0.85, reasonTpl: 'Field is named "id" (common universal PK)' },
+            { pattern: /^uuid$/i, confidence: 0.8, reasonTpl: 'Field is named "uuid"' },
+            { pattern: /^guid$/i, confidence: 0.75, reasonTpl: 'Field is named "guid"' },
+        ];
+        for (const c of candidates) {
+            const m = fields.find(f => c.pattern.test(f.Name));
+            if (m) {
+                return {
+                    fieldName: m.Name,
+                    confidence: c.confidence,
+                    reason: c.reasonTpl.replace('<ObjectName>', objectName).replace('<ObjectNameSingular>', sing),
+                };
+            }
+        }
+        return undefined;
+    }
+    /** Sample uniqueness: exactly one field is unique + non-null across the sample. */
+    statisticalUniqueness(fields, rows) {
+        const candidates = [];
+        for (const f of fields) {
+            const values = rows.map(r => r[f.Name]);
+            const nonNull = values.filter(v => this.isPresent(v));
+            const nullRatio = 1 - (nonNull.length / rows.length);
+            if (nullRatio > 0)
+                continue; // PK fields are non-null
+            const distinct = new Set(nonNull.map(v => String(v)));
+            const uniqueRatio = distinct.size / nonNull.length;
+            if (uniqueRatio === 1.0) {
+                candidates.push({ fieldName: f.Name, uniqueRatio, nullRatio });
+            }
+        }
+        if (candidates.length === 0)
+            return undefined;
+        // Single uniquely-identifying column → strong signal
+        if (candidates.length === 1) {
+            return {
+                fieldName: candidates[0].fieldName,
+                confidence: 0.85,
+                reason: `Sole field unique + non-null across ${rows.length} sample rows.`,
+            };
+        }
+        // Multiple unique columns → ambiguous; defer to a more specific signal
+        return undefined;
+    }
+    /**
+     * Composite-key uniqueness: when no single column uniquely identifies a row,
+     * search for the SMALLEST set of columns (size 2..maxSetSize) whose
+     * concatenated values are unique + non-null across the sample. Returns the
+     * minimal such set; among sets of equal size, the one over the fewest-
+     * distinct-but-still-unique columns wins (deterministic by field order).
+     */
+    compositeUniqueness(fields, rows, maxSetSize) {
+        const stable = this.stableColumns(fields, rows);
+        if (stable.length < 2)
+            return undefined;
+        const cap = Math.min(Math.max(maxSetSize, 2), stable.length);
+        for (let size = 2; size <= cap; size++) {
+            const winner = this.firstUniqueCombination(stable, rows, size);
+            if (winner) {
+                return {
+                    fieldNames: winner,
+                    confidence: 0.8,
+                    reason: `Composite key of ${winner.length} columns [${winner.join(', ')}] is unique + non-null across ${rows.length} sample rows (no single column was unique).`,
+                };
+            }
+        }
+        return undefined;
+    }
+    /** Columns that are non-null across every sample row (PK members must be non-null). */
+    stableColumns(fields, rows) {
+        return fields
+            .filter(f => rows.every(r => this.isPresent(r[f.Name])))
+            .map(f => f.Name);
+    }
+    /** First combination of `size` columns whose concatenated values are all distinct. */
+    firstUniqueCombination(columns, rows, size) {
+        for (const combo of this.combinations(columns, size)) {
+            if (this.isCombinationUnique(combo, rows))
+                return combo;
+        }
+        return undefined;
+    }
+    /** Whether the concatenated values of `combo` are distinct across all rows. */
+    isCombinationUnique(combo, rows) {
+        const seen = new Set();
+        for (const r of rows) {
+            const key = combo.map(c => `${String(r[c])}`).join('');
+            if (seen.has(key))
+                return false;
+            seen.add(key);
+        }
+        return true;
+    }
+    /** Lazily yield all k-combinations of `items`, preserving input order. */
+    *combinations(items, k) {
+        const n = items.length;
+        if (k > n || k <= 0)
+            return;
+        const idx = Array.from({ length: k }, (_, i) => i);
+        while (true) {
+            yield idx.map(i => items[i]);
+            let p = k - 1;
+            while (p >= 0 && idx[p] === n - k + p)
+                p--;
+            if (p < 0)
+                return;
+            idx[p]++;
+            for (let j = p + 1; j < k; j++)
+                idx[j] = idx[j - 1] + 1;
+        }
+    }
+    /** A value counts as present (non-null) for PK purposes. */
+    isPresent(v) {
+        return v !== null && v !== undefined && v !== '';
+    }
+    /** Very simple singularization — sufficient for common cases (Members→Member, Companies→Companie isn't perfect but covers most). */
+    singularize(name) {
+        if (/ies$/i.test(name))
+            return name.slice(0, -3) + 'y';
+        if (/ses$/i.test(name))
+            return name.slice(0, -2);
+        if (/s$/i.test(name) && name.length > 1)
+            return name.slice(0, -1);
+        return name;
+    }
+    escapeRe(s) {
+        return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+    }
+}
+//# sourceMappingURL=SoftPKClassifier.js.map

package/dist/SoftPKClassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SoftPKClassifier.js","sourceRoot":"","sources":["../src/SoftPKClassifier.ts"],"names":[],"mappings":"AAeA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,+BAAwC,CAAC;AAiFhF;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,gBAAgB;IAClB,KAAK,CAAC,QAAQ,CAAC,IAAqB;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,IAAI,GAAG,CAAC;QAE1C,0BAA0B;QAC1B,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,mBAAoB,CAAC,CAAC,CAAC;YACrF,IAAI,CAAC,EAAE,CAAC;gBACJ,OAAO;oBACH,SAAS,EAAE,IAAI;oBACf,OAAO,EAAE,CAAC,CAAC,IAAI;oBACf,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,sBAAsB;oBAChC,MAAM,EAAE,gCAAgC,IAAI,CAAC,mBAAmB,oBAAoB,CAAC,CAAC,IAAI,IAAI;iBACjG,CAAC;YACN,CAAC;QACL,CAAC;QAED,sBAAsB;QACtB,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACxE,IAAI,WAAW,EAAE,CAAC;YACd,OAAO;gBACH,SAAS,EAAE,IAAI;gBACf,OAAO,EAAE,WAAW,CAAC,SAAS;gBAC9B,UAAU,EAAE,WAAW,CAAC,UAAU;gBAClC,QAAQ,EAAE,kBAAkB;gBAC5B,MAAM,EAAE,WAAW,CAAC,MAAM;aAC7B,CAAC;QACN,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3E,IAAI,SAAS,IAAI,SAAS,CAAC,UAAU,IAAI,KAAK,EAAE,CAAC;gBAC7C,OAAO;oBACH,SAAS,EAAE,IAAI;oBACf,OAAO,EAAE,SAAS,CAAC,SAAS;oBAC5B,aAAa,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;oBACpC,UAAU,EAAE,SAAS,CAAC,UAAU;oBAChC,QAAQ,EAAE,aAAa;oBACvB,MAAM,EAAE,SAAS,CAAC,MAAM;iBAC3B,CAAC;YACN,CAAC;QACL,CAAC;QAED,2EAA2E;QAC3E,4EAA4E;QAC5E,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACrF,IAAI,SAAS,IAAI,SAAS,CAAC,UAAU,IAAI,KAAK,EAAE,CAAC;gBAC7C,OAAO;oBACH,SAAS,EAAE,IAAI;oBACf,OAAO,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;oBAChC,aAAa,EAAE,SAAS,CAAC,UAAU;oBACnC,UAAU,EAAE,SAAS,CAAC,UAAU;oBAChC,QAAQ,EAAE,WAAW;oBACrB,MAAM,EAAE,SAAS,CAAC,MAAM;iBAC3B,CAAC;YACN,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,IAAI,CAAC;gBACD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC;oBAChC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;oBAC5B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBAC1B,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;wBACpB,QAAQ,EAAE,CAAC,CAAC,WAAW;wBACvB,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI;qBAC3B,CAAC,CAAC;oBACH,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;iBAC3F,CAAC,CAAC;gBACH,IAAI,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,UAAU,IAAI,KAAK,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;oBAC7D,IAAI,MAAM,EAAE,CAAC;wBACT,OAAO;4BACH,SAAS,EAAE,IAAI;4BACf,OAAO,EAAE,GAAG,CAAC,OAAO;4BACpB,aAAa,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC;4BAC5B,UAAU,EAAE,GAAG,CAAC,UAAU;4BAC1B,QAAQ,EAAE,KAAK;4BACf,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,8BAA8B;yBACvD,CAAC;oBACN,CAAC;gBACL,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,uEAAuE;gBACvE,2EAA2E;gBAC3E,MAAM,WAAW,GAAG,yBAAyB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBACjG,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;QAED,mDAAmD;QACnD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,IAAqB,EAAE,MAAe;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,EAAE,CAAC;YACjC,OAAO;gBACH,SAAS,EAAE,IAAI;gBACf,OAAO,EAAE,uBAAuB;gBAChC,aAAa,EAAE,CAAC,uBAAuB,CAAC;gBACxC,UAAU,EAAE,GAAG;gBACf,QAAQ,EAAE,WAAW;gBACrB,MAAM,EAAE,GAAG,IAAI,oJAAoJ,uBAAuB,+CAA+C;aAC5O,CAAC;QACN,CAAC;QACD,OAAO;YACH,SAAS,EAAE,KAAK;YAChB,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,MAAM;YAChB,MAAM,EAAE,GAAG,IAAI,0MAA0M;SAC5N,CAAC;IACN,CAAC;IAED,kEAAkE;IAC1D,WAAW,CAAC,MAAc,EAAE,IAAY;QAC5C,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrE,CAAC;IAED,sEAAsE;IAC9D,eAAe,CACnB,UAAkB,EAClB,MAAwC;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,UAAU,GAAsE;YAClF,EAAE,OAAO,EAAE,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,SAAS,EAAE,gDAAgD,EAAE;YAC1I,EAAE,OAAO,EAAE,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,wCAAwC,EAAE;YACzI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,2CAA2C,EAAE;YAC9F,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,EAAE,SAAS,EAAE,uBAAuB,EAAE;YAC3E,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,uBAAuB,EAAE;SAC/E,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,EAAE,CAAC;gBACJ,OAAO;oBACH,SAAS,EAAE,CAAC,CAAC,IAAI;oBACjB,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,sBAAsB,EAAE,IAAI,CAAC;iBAChG,CAAC;YACN,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,mFAAmF;IAC3E,qBAAqB,CACzB,MAAwC,EACxC,IAAoC;QAEpC,MAAM,UAAU,GAAyE,EAAE,CAAC;QAC5F,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,SAAS,GAAG,CAAC;gBAAE,SAAS,CAAC,yBAAyB;YACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC;YACnD,IAAI,WAAW,KAAK,GAAG,EAAE,CAAC;gBACtB,UAAU,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC;YACnE,CAAC;QACL,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,qDAAqD;QACrD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACH,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;gBAClC,UAAU,EAAE,IAAI;gBAChB,MAAM,EAAE,uCAAuC,IAAI,CAAC,MAAM,eAAe;aAC5E,CAAC;QACN,CAAC;QACD,uEAAuE;QACvE,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACK,mBAAmB,CACvB,MAAwC,EACxC,IAAoC,EACpC,UAAkB;QAElB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7D,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC/D,IAAI,MAAM,EAAE,CAAC;gBACT,OAAO;oBACH,UAAU,EAAE,MAAM;oBAClB,UAAU,EAAE,GAAG;oBACf,MAAM,EAAE,oBAAoB,MAAM,CAAC,MAAM,aAAa,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,iCAAiC,IAAI,CAAC,MAAM,6CAA6C;iBACnK,CAAC;YACN,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,uFAAuF;IAC/E,aAAa,CACjB,MAAwC,EACxC,IAAoC;QAEpC,OAAO,MAAM;aACR,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACvD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,sFAAsF;IAC9E,sBAAsB,CAC1B,OAAiB,EACjB,IAAoC,EACpC,IAAY;QAEZ,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC5D,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,+EAA+E;IACvE,mBAAmB,CAAC,KAAe,EAAE,IAAoC;QAC7E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,0EAA0E;IAClE,CAAC,YAAY,CAAC,KAAe,EAAE,CAAS;QAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,EAAE,CAAC;YACV,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO;YAClB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACT,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5D,CAAC;IACL,CAAC;IAED,4DAA4D;IACpD,SAAS,CAAC,CAAU;QACxB,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC;IACrD,CAAC;IAED,oIAAoI;IAC5H,WAAW,CAAC,IAAY;QAC5B,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACvD,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IAChB,CAAC;IAEO,QAAQ,CAAC,CAAS;QACtB,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;CACJ"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { SoftPKClassifier, SYNTHETIC_PK_FIELD_NAME } from './SoftPKClassifier.js';
+export type { PKClassifierStrategy, PKClassifierResult, ClassifyOptions, LLMOneShotCallback, LLMPrompt, LLMResponse, } from './SoftPKClassifier.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAClF,YAAY,EACR,oBAAoB,EACpB,kBAAkB,EAClB,eAAe,EACf,kBAAkB,EAClB,SAAS,EACT,WAAW,GACd,MAAM,uBAAuB,CAAC"}

package/dist/index.js

@@ -0,0 +1,2 @@
+export { SoftPKClassifier, SYNTHETIC_PK_FIELD_NAME } from './SoftPKClassifier.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC"}

package/package.json

@@ -1,10 +1,34 @@
 {
   "name": "@memberjunction/integration-pk-classifier",
-  "version": "0.0.1",
-  "description": "OIDC trusted publishing setup package for @memberjunction/integration-pk-classifier",
-  "keywords": [
-    "oidc",
-    "trusted-publishing",
-    "setup"
-  ]
+  "type": "module",
+  "version": "5.39.0",
+  "description": "Lightweight soft-PK classifier for integration objects. Cascades: universal convention (vendor-level hint) → naming heuristic → statistical uniqueness sampling → one-shot LLM. Built from scratch — does NOT depend on DBAutoDoc. Narrow scope: PK only. Honest: returns no candidate when nothing is confident enough — the framework then leaves the entity PK-less rather than synthesizing.",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "files": [
+    "/dist"
+  ],
+  "scripts": {
+    "build": "tsc && tsc-alias -f",
+    "test": "vitest run",
+    "test:watch": "vitest"
+  },
+  "dependencies": {
+    "@memberjunction/core": "5.39.0",
+    "@memberjunction/core-entities": "5.39.0",
+    "@memberjunction/global": "5.39.0"
+  },
+  "devDependencies": {
+    "typescript": "^5.9.3",
+    "tsc-alias": "^1.8.16",
+    "vitest": "^4.0.18"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/MemberJunction/MJ"
+  },
+  "license": "ISC",
+  "publishConfig": {
+    "access": "public"
+  }
 }

package/README.md

@@ -1,45 +0,0 @@
-# @memberjunction/integration-pk-classifier
-
-## ⚠️ IMPORTANT NOTICE ⚠️
-
-**This package is created solely for the purpose of setting up OIDC (OpenID Connect) trusted publishing with npm.**
-
-This is **NOT** a functional package and contains **NO** code or functionality beyond the OIDC setup configuration.
-
-## Purpose
-
-This package exists to:
-1. Configure OIDC trusted publishing for the package name `@memberjunction/integration-pk-classifier`
-2. Enable secure, token-less publishing from CI/CD workflows
-3. Establish provenance for packages published under this name
-
-## What is OIDC Trusted Publishing?
-
-OIDC trusted publishing allows package maintainers to publish packages directly from their CI/CD workflows without needing to manage npm access tokens. Instead, it uses OpenID Connect to establish trust between the CI/CD provider (like GitHub Actions) and npm.
-
-## Setup Instructions
-
-To properly configure OIDC trusted publishing for this package:
-
-1. Go to [npmjs.com](https://www.npmjs.com/) and navigate to your package settings
-2. Configure the trusted publisher (e.g., GitHub Actions)
-3. Specify the repository and workflow that should be allowed to publish
-4. Use the configured workflow to publish your actual package
-
-## DO NOT USE THIS PACKAGE
-
-This package is a placeholder for OIDC configuration only. It:
-- Contains no executable code
-- Provides no functionality
-- Should not be installed as a dependency
-- Exists only for administrative purposes
-
-## More Information
-
-For more details about npm's trusted publishing feature, see:
-- [npm Trusted Publishing Documentation](https://docs.npmjs.com/generating-provenance-statements)
-- [GitHub Actions OIDC Documentation](https://docs.github.com/en/actions/deployment/security-hardening-your-deployments/about-security-hardening-with-openid-connect)
-
----
-
-**Maintained for OIDC setup purposes only**