@proposit/proposit-core 5.1.0 → 5.2.0

package/dist/extensions/pipelines/ingestion/scribe/source-attachment.js

@@ -0,0 +1,200 @@
+// Attaching scribe's source claims — citations and axioms — to the claims
+// they support.
+//
+// A source becomes derivation backing only as the antecedent of an
+// inference relation (`sortInferenceRelations`). `structure` is the only
+// stage that emits relations, and it is shown the claim list, never the
+// text, so it cannot tell which claim a link or an appeal to a principle
+// sits beside — and it may leave a source out altogether. A source
+// attached to nothing backs nothing and is lost downstream.
+//
+// So each source gets extra single-antecedent relations `[source] →
+// supported`: first to every normal claim `extract` named for it (the
+// one stage that reads the text); failing that, when `structure` did not
+// use it either, to a claim chosen by where the mentions sit — the
+// normal claim whose mention overlaps the source's most, else the nearest
+// normal claim in the same sentence, else the nearest normal claim whose
+// mention ends before the source's begins. A relation
+// with only a source antecedent compiles to backing and no freeform
+// premise, so nothing else about the argument changes.
+//
+// An axiom is never attached to a claim a citation backs: grammar rule D-3
+// forbids one derivation mixing the two. Citations are attached first and
+// the axiom is dropped with a warning.
+import { locateSourceAnchor } from "../../base/source-anchors.js";
+import { sortInferenceRelations } from "../../base/stages/formula-compilation.js";
+export const SOURCE_ATTACHMENT_FAILURE_CODES = {
+    invalidSource: "SOURCE_ATTACHMENT_INVALID_SOURCE",
+    invalidTarget: "SOURCE_ATTACHMENT_INVALID_TARGET",
+    mixed: "SOURCE_ATTACHMENT_MIXED",
+    unattached: "SOURCE_ATTACHMENT_UNATTACHED",
+};
+/**
+ * Where a mention sits in the input: its quote located in the text when
+ * it can be, else the offsets the model reported.
+ */
+function mentionRange(mention, inputText) {
+    const match = locateSourceAnchor(inputText, mention.text, mention.span.start);
+    return match === undefined
+        ? mention.span
+        : { start: match.anchor.startUtf16, end: match.anchor.endUtf16 };
+}
+function overlapLength(a, b) {
+    return Math.max(0, Math.min(a.end, b.end) - Math.max(a.start, b.start));
+}
+// A sentence ends at a terminator followed by whitespace (closing quotes and
+// brackets allowed in between), or at a line break. The dots inside a URL
+// are followed by more of the URL, so they never count.
+const SENTENCE_BREAK = /[.!?]["')\]]*\s|\n/;
+/**
+ * The normal claim a source's mentions belong to, if any: the one whose
+ * mention overlaps a source mention most; else the nearest one in the same
+ * sentence, on either side ("According to <link>, <claim>."); else the
+ * nearest one that ends before the source begins.
+ */
+function claimByPosition(sourceRanges, normalRanges, inputText) {
+    let overlapping;
+    let sameSentence;
+    let preceding;
+    for (const claim of normalRanges) {
+        for (const range of claim.ranges) {
+            for (const source of sourceRanges) {
+                const overlap = overlapLength(range, source);
+                if (overlap > 0) {
+                    if (overlapping === undefined ||
+                        overlap > overlapping.overlap)
+                        overlapping = { miniId: claim.miniId, overlap };
+                    continue;
+                }
+                const [gapStart, gapEnd] = range.end <= source.start
+                    ? [range.end, source.start]
+                    : [source.end, range.start];
+                const gap = gapEnd - gapStart;
+                // From the earlier mention's last character, which is where
+                // a sentence it closes has its terminator.
+                const between = inputText.slice(Math.max(0, gapStart - 1), gapEnd);
+                if (!SENTENCE_BREAK.test(between) &&
+                    (sameSentence === undefined || gap < sameSentence.gap))
+                    sameSentence = { miniId: claim.miniId, gap };
+                if (range.end <= source.start &&
+                    (preceding === undefined || range.end > preceding.end))
+                    preceding = { miniId: claim.miniId, end: range.end };
+            }
+        }
+    }
+    return (overlapping ?? sameSentence ?? preceding)?.miniId;
+}
+/**
+ * The relations that attach each citation and axiomatic claim to what it
+ * supports, to be published alongside `structure`'s own. See the file
+ * comment for the order in which a target is chosen.
+ */
+export function buildSourceRelations(args) {
+    const claims = args.extract?.canonicalClaims ?? [];
+    const mentionById = new Map((args.extract?.mentions ?? []).map((m) => [m.mentionId, m]));
+    const rangesOf = (mentionIds) => mentionIds.flatMap((id) => {
+        const mention = mentionById.get(id);
+        return mention === undefined
+            ? []
+            : [mentionRange(mention, args.inputText)];
+    });
+    const normalRanges = claims
+        .filter((c) => args.typeByMiniId.get(c.miniId) === "normal")
+        .map((c) => ({ miniId: c.miniId, ranges: rangesOf(c.mentionIds) }));
+    // Read off what the compiler will make of structure's relations, so a
+    // relation it drops (an unknown claim id, say) attaches nothing here
+    // either. Its warnings are the compiler's to report, not this stage's.
+    const structureBacking = sortInferenceRelations({
+        relations: [...args.structureRelations],
+        typeByClaimMiniId: args.typeByMiniId,
+    }).derivationBacking;
+    const attachedByStructure = new Set([...structureBacking.values()].flat());
+    // Claims a citation backs. An axiom may not join them: one derivation
+    // mixing axioms and citations breaks grammar rule D-3.
+    const backedByCitation = new Set([...structureBacking]
+        .filter(([, supporters]) => supporters.some((id) => args.typeByMiniId.get(id) === "citation"))
+        .map(([consequent]) => consequent));
+    const relations = [];
+    const attach = (sourceMiniId, sourceType, supportedMiniId) => {
+        if (sourceType === "axiomatic" &&
+            backedByCitation.has(supportedMiniId)) {
+            args.addFailure({
+                code: SOURCE_ATTACHMENT_FAILURE_CODES.mixed,
+                message: `Axiom "${sourceMiniId}" supports "${supportedMiniId}", which a citation already backs; one claim cannot be backed by both, so the axiom was not attached.`,
+                severity: "warning",
+                context: { sourceMiniId, supportedMiniId },
+            });
+            return;
+        }
+        if (sourceType === "citation")
+            backedByCitation.add(supportedMiniId);
+        relations.push({
+            relationId: `source-${sourceMiniId}-${supportedMiniId}`,
+            type: "inference",
+            antecedents: [sourceMiniId],
+            consequent: supportedMiniId,
+            title: "",
+            evidence: { segmentIds: [], quote: "" },
+        });
+    };
+    for (const entry of args.extract?.sourceSupport ?? []) {
+        const sourceType = args.typeByMiniId.get(entry.sourceMiniId);
+        if (sourceType === "citation" || sourceType === "axiomatic")
+            continue;
+        args.addFailure({
+            code: SOURCE_ATTACHMENT_FAILURE_CODES.invalidSource,
+            message: `"${entry.sourceMiniId}" was paired as a source for "${entry.supportedMiniId}", but it is ${sourceType === undefined ? "not a known claim" : `a ${sourceType} claim`}; only a citation or axiomatic claim is a source. Ignoring the pairing.`,
+            severity: "warning",
+            context: {
+                sourceMiniId: entry.sourceMiniId,
+                supportedMiniId: entry.supportedMiniId,
+            },
+        });
+    }
+    // Citations first, so an axiom sees every claim a citation backs.
+    for (const sourceType of ["citation", "axiomatic"]) {
+        const label = sourceType === "citation" ? "Source" : "Axiom";
+        for (const claim of claims) {
+            if (args.typeByMiniId.get(claim.miniId) !== sourceType)
+                continue;
+            const sourceMiniId = claim.miniId;
+            const named = new Set();
+            for (const entry of args.extract?.sourceSupport ?? []) {
+                if (entry.sourceMiniId !== sourceMiniId)
+                    continue;
+                const targetType = args.typeByMiniId.get(entry.supportedMiniId);
+                if (targetType !== "normal") {
+                    args.addFailure({
+                        code: SOURCE_ATTACHMENT_FAILURE_CODES.invalidTarget,
+                        message: `${label} "${sourceMiniId}" was said to support "${entry.supportedMiniId}", which is ${targetType === undefined ? "not a known claim" : `a ${targetType} claim`}; a ${label.toLowerCase()} can only support a normal claim.`,
+                        severity: "warning",
+                        context: {
+                            sourceMiniId,
+                            supportedMiniId: entry.supportedMiniId,
+                        },
+                    });
+                    continue;
+                }
+                named.add(entry.supportedMiniId);
+            }
+            for (const supportedMiniId of named) {
+                attach(sourceMiniId, sourceType, supportedMiniId);
+            }
+            if (named.size > 0 || attachedByStructure.has(sourceMiniId))
+                continue;
+            const supportedMiniId = claimByPosition(rangesOf(claim.mentionIds), normalRanges, args.inputText);
+            if (supportedMiniId === undefined) {
+                args.addFailure({
+                    code: SOURCE_ATTACHMENT_FAILURE_CODES.unattached,
+                    message: `${label} "${sourceMiniId}" supports no claim: none was named for it, and no normal claim is stated where it appears or before it.`,
+                    severity: "warning",
+                    context: { sourceMiniId },
+                });
+                continue;
+            }
+            attach(sourceMiniId, sourceType, supportedMiniId);
+        }
+    }
+    return relations;
+}
+//# sourceMappingURL=source-attachment.js.map

package/dist/extensions/pipelines/ingestion/scribe/source-attachment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-attachment.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/ingestion/scribe/source-attachment.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,gBAAgB;AAChB,EAAE;AACF,mEAAmE;AACnE,yEAAyE;AACzE,wEAAwE;AACxE,yEAAyE;AACzE,mEAAmE;AACnE,4DAA4D;AAC5D,EAAE;AACF,oEAAoE;AACpE,sEAAsE;AACtE,yEAAyE;AACzE,mEAAmE;AACnE,0EAA0E;AAC1E,yEAAyE;AACzE,sDAAsD;AACtD,oEAAoE;AACpE,uDAAuD;AACvD,EAAE;AACF,2EAA2E;AAC3E,0EAA0E;AAC1E,uCAAuC;AAOvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAA;AACjE,OAAO,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAA;AAGjF,MAAM,CAAC,MAAM,+BAA+B,GAAG;IAC3C,aAAa,EAAE,kCAAkC;IACjD,aAAa,EAAE,kCAAkC;IACjD,KAAK,EAAE,yBAAyB;IAChC,UAAU,EAAE,8BAA8B;CACpC,CAAA;AAaV;;;GAGG;AACH,SAAS,YAAY,CAAC,OAAsB,EAAE,SAAiB;IAC3D,MAAM,KAAK,GAAG,kBAAkB,CAC5B,SAAS,EACT,OAAO,CAAC,IAAI,EACZ,OAAO,CAAC,IAAI,CAAC,KAAK,CACrB,CAAA;IACD,OAAO,KAAK,KAAK,SAAS;QACtB,CAAC,CAAC,OAAO,CAAC,IAAI;QACd,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAA;AACxE,CAAC;AAED,SAAS,aAAa,CAAC,CAAS,EAAE,CAAS;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;AAC3E,CAAC;AAED,6EAA6E;AAC7E,0EAA0E;AAC1E,wDAAwD;AACxD,MAAM,cAAc,GAAG,oBAAoB,CAAA;AAE3C;;;;;GAKG;AACH,SAAS,eAAe,CACpB,YAAsB,EACtB,YAAoD,EACpD,SAAiB;IAEjB,IAAI,WAA4D,CAAA;IAChE,IAAI,YAAyD,CAAA;IAC7D,IAAI,SAAsD,CAAA;IAC1D,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;gBAC5C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;oBACd,IACI,WAAW,KAAK,SAAS;wBACzB,OAAO,GAAG,WAAW,CAAC,OAAO;wBAE7B,WAAW,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,CAAA;oBACnD,SAAQ;gBACZ,CAAC;gBACD,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,GACpB,KAAK,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK;oBACrB,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC;oBAC3B,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;gBACnC,MAAM,GAAG,GAAG,MAAM,GAAG,QAAQ,CAAA;gBAC7B,4DAA4D;gBAC5D,2CAA2C;gBAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,EACzB,MAAM,CACT,CAAA;gBACD,IACI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;oBAC7B,CAAC,YAAY,KAAK,SAAS,IAAI,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC;oBAEtD,YAAY,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,CAAA;gBAChD,IACI,KAAK,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK;oBACzB,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;oBAEtD,SAAS,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;YAC5D,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,CAAC,WAAW,IAAI,YAAY,IAAI,SAAS,CAAC,EAAE,MAAM,CAAA;AAC7D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAMpC;IACG,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,eAAe,IAAI,EAAE,CAAA;IAClD,MAAM,WAAW,GAAG,IAAI,GAAG,CACvB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAC9D,CAAA;IACD,MAAM,QAAQ,GAAG,CAAC,UAA6B,EAAY,EAAE,CACzD,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;QACtB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnC,OAAO,OAAO,KAAK,SAAS;YACxB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IACN,MAAM,YAAY,GAAG,MAAM;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC;SAC3D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAA;IACvE,sEAAsE;IACtE,qEAAqE;IACrE,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,sBAAsB,CAAC;QAC5C,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACvC,iBAAiB,EAAE,IAAI,CAAC,YAAY;KACvC,CAAC,CAAC,iBAAiB,CAAA;IACpB,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IAC1E,sEAAsE;IACtE,uDAAuD;IACvD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC5B,CAAC,GAAG,gBAAgB,CAAC;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,EAAE,CACvB,UAAU,CAAC,IAAI,CACX,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,UAAU,CACnD,CACJ;SACA,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CACzC,CAAA;IAED,MAAM,SAAS,GAAyB,EAAE,CAAA;IAC1C,MAAM,MAAM,GAAG,CACX,YAAoB,EACpB,UAAsB,EACtB,eAAuB,EACzB,EAAE;QACA,IACI,UAAU,KAAK,WAAW;YAC1B,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC,EACvC,CAAC;YACC,IAAI,CAAC,UAAU,CAAC;gBACZ,IAAI,EAAE,+BAA+B,CAAC,KAAK;gBAC3C,OAAO,EAAE,UAAU,YAAY,eAAe,eAAe,uGAAuG;gBACpK,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,YAAY,EAAE,eAAe,EAAE;aAC7C,CAAC,CAAA;YACF,OAAM;QACV,CAAC;QACD,IAAI,UAAU,KAAK,UAAU;YAAE,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;QACpE,SAAS,CAAC,IAAI,CAAC;YACX,UAAU,EAAE,UAAU,YAAY,IAAI,eAAe,EAAE;YACvD,IAAI,EAAE,WAAW;YACjB,WAAW,EAAE,CAAC,YAAY,CAAC;YAC3B,UAAU,EAAE,eAAe;YAC3B,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE;SAC1C,CAAC,CAAA;IACN,CAAC,CAAA;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,aAAa,IAAI,EAAE,EAAE,CAAC;QACpD,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;QAC5D,IAAI,UAAU,KAAK,UAAU,IAAI,UAAU,KAAK,WAAW;YAAE,SAAQ;QACrE,IAAI,CAAC,UAAU,CAAC;YACZ,IAAI,EAAE,+BAA+B,CAAC,aAAa;YACnD,OAAO,EAAE,IAAI,KAAK,CAAC,YAAY,iCAAiC,KAAK,CAAC,eAAe,gBAAgB,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,KAAK,UAAU,QAAQ,yEAAyE;YACtP,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE;gBACL,YAAY,EAAE,KAAK,CAAC,YAAY;gBAChC,eAAe,EAAE,KAAK,CAAC,eAAe;aACzC;SACJ,CAAC,CAAA;IACN,CAAC;IAED,kEAAkE;IAClE,KAAK,MAAM,UAAU,IAAI,CAAC,UAAU,EAAE,WAAW,CAAU,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAA;QAC5D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,UAAU;gBAAE,SAAQ;YAChE,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAA;YAEjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,aAAa,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,KAAK,CAAC,YAAY,KAAK,YAAY;oBAAE,SAAQ;gBACjD,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,CAAA;gBAC/D,IAAI,UAAU,KAAK,QAAQ,EAAE,CAAC;oBAC1B,IAAI,CAAC,UAAU,CAAC;wBACZ,IAAI,EAAE,+BAA+B,CAAC,aAAa;wBACnD,OAAO,EAAE,GAAG,KAAK,KAAK,YAAY,0BAA0B,KAAK,CAAC,eAAe,eAAe,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,KAAK,UAAU,QAAQ,OAAO,KAAK,CAAC,WAAW,EAAE,mCAAmC;wBACrO,QAAQ,EAAE,SAAS;wBACnB,OAAO,EAAE;4BACL,YAAY;4BACZ,eAAe,EAAE,KAAK,CAAC,eAAe;yBACzC;qBACJ,CAAC,CAAA;oBACF,SAAQ;gBACZ,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,MAAM,eAAe,IAAI,KAAK,EAAE,CAAC;gBAClC,MAAM,CAAC,YAAY,EAAE,UAAU,EAAE,eAAe,CAAC,CAAA;YACrD,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,mBAAmB,CAAC,GAAG,CAAC,YAAY,CAAC;gBACvD,SAAQ;YAEZ,MAAM,eAAe,GAAG,eAAe,CACnC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAC1B,YAAY,EACZ,IAAI,CAAC,SAAS,CACjB,CAAA;YACD,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;gBAChC,IAAI,CAAC,UAAU,CAAC;oBACZ,IAAI,EAAE,+BAA+B,CAAC,UAAU;oBAChD,OAAO,EAAE,GAAG,KAAK,KAAK,YAAY,0GAA0G;oBAC5I,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE,EAAE,YAAY,EAAE;iBAC5B,CAAC,CAAA;gBACF,SAAQ;YACZ,CAAC;YACD,MAAM,CAAC,YAAY,EAAE,UAAU,EAAE,eAAe,CAAC,CAAA;QACrD,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAA;AACpB,CAAC"}

package/dist/extensions/pipelines/ingestion/scribe/structure-stage.d.ts

@@ -2,10 +2,10 @@ import type { TStage } from "../../../../lib/pipelines/types.js";
 import { type TConclusionSelectionOutput, type TRelationExtractionOutput } from "../../base/stages/index.js";
 import type { TLlmStageOptionsOverride } from "../../base/types.js";
 import { type TScribeStructureOutput } from "./schemas.js";
-export declare const STRUCTURE_MODEL = "gpt-5.4-mini";
+export declare const STRUCTURE_MODEL = "gpt-6-sol";
 /** Internal default knobs for scribe's `structure` stage. */
 export declare const STRUCTURE_STAGE_DEFAULTS: TLlmStageOptionsOverride;
-export declare const STRUCTURE_SYSTEM_PROMPT = "You read a canonical claim set \u2014 each claim's id, type, and content fields (title/body) \u2014 and emit the argument's structure.\n\nEmit:\n- `relations` \u2014 the inference edges between claims. Each relation: a stable `relationId` (r1, r2, ...), a `type` of \"inference\", an `antecedents` array of the claim miniIds whose conjunction implies the consequent (one or more; citation- or axiomatic-typed claims may appear here, but never as the consequent), a single `consequent` claim miniId, a `title`, and an `evidence` object, which is always exactly { segmentIds: [], quote: \"\" } \u2014 you are shown the claims, not the text they came from, so you have nothing to quote.\n- each relation's `title` \u2014 a short noun phrase naming what that step DOES in the argument \u2014 the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Examples: \"Limits of the crowd's power\", \"Residence as tacit consent\", \"Principle over survival\".\n- `conclusionCandidates` \u2014 the claim miniIds that could be the argument's conclusion, ordered by DECREASING confidence (best first). The conclusion is the claim other claims support but that supports nothing further. Never list a citation- or axiomatic-typed claim. Return an empty array only when there is no argument structure.\n- `conclusionTitle` \u2014 for your FIRST candidate only: a short noun phrase naming what the concluding step DOES in the argument \u2014 the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Return an empty string when `conclusionCandidates` is empty.\n- `rationale` \u2014 one sentence explaining your best pick (or why none qualifies).\n\nOutput ONLY the schema-shaped object. No prose.";
+export declare const STRUCTURE_SYSTEM_PROMPT = "You read a canonical claim set \u2014 each claim's id, type, and content fields (title/body) \u2014 and emit the argument's structure.\n\nEmit:\n- `relations` \u2014 the inference edges between claims. Each relation: a stable `relationId` (r1, r2, ...), a `type` of \"inference\", an `antecedents` array of the claim miniIds whose conjunction implies the consequent (one or more; citation- or axiomatic-typed claims may appear here, but never as the consequent), a single `consequent` claim miniId, a `title`, and an `evidence` object, which is always exactly { segmentIds: [], quote: \"\" } \u2014 you are shown the claims, not the text they came from, so you have nothing to quote.\n- each relation's `title` \u2014 a short noun phrase naming what that step DOES in the argument \u2014 the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Examples: \"Limits of the crowd's power\", \"Residence as tacit consent\", \"Principle over survival\". Every relation's title must differ from every other relation's \u2014 two steps never share a name.\n- `conclusionCandidates` \u2014 the claim miniIds that could be the argument's conclusion, ordered by DECREASING confidence (best first). The conclusion is the claim other claims support but that supports nothing further. Never list a citation- or axiomatic-typed claim.\n- `conclusionTitle` \u2014 for your FIRST candidate only: a short noun phrase naming what the concluding step DOES in the argument \u2014 the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. It must differ from every relation's `title` \u2014 the step that reaches the conclusion already has its own. Return an empty string when `conclusionCandidates` is empty.\n- `rationale` \u2014 one sentence explaining your best pick (or why none qualifies).\n\nEmit the relations and conclusion the author actually argues. An argument with at least two normal-typed claims has at least one relation and one conclusion candidate, so look for them before concluding there are none. Never invent support the author does not give: if the claims genuinely do not connect, return `relations` and `conclusionCandidates` empty.\n\nOutput ONLY the schema-shaped object. No prose.";
 /**
  * Build scribe's `structure` LLM stage. Depends on the canonicalization
  * + classification slots (populated by `extract`'s adapters) so the
@@ -15,7 +15,9 @@ export declare const STRUCTURE_SYSTEM_PROMPT = "You read a canonical claim set \
 export declare function createStructureStage(options?: TLlmStageOptionsOverride): TStage<TScribeStructureOutput>;
 /**
  * Adapter — republish `structure`'s relations under the
- * relation-extraction slot.
+ * relation-extraction slot, together with the relations that attach each
+ * source claim to the claim it supports (`buildSourceRelations`), read
+ * off the same settled citations the canonicalization slot carries.
  */
 export declare const structureRelationAdapterStage: TStage<TRelationExtractionOutput>;
 /**

package/dist/extensions/pipelines/ingestion/scribe/structure-stage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"structure-stage.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/ingestion/scribe/structure-stage.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,EAQH,KAAK,0BAA0B,EAC/B,KAAK,yBAAyB,EACjC,MAAM,4BAA4B,CAAA;AACnC,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAA;AACnE,OAAO,EAEH,KAAK,sBAAsB,EAC9B,MAAM,cAAc,CAAA;AAErB,eAAO,MAAM,eAAe,iBAAiB,CAAA;AAE7C,6DAA6D;AAC7D,eAAO,MAAM,wBAAwB,EAAE,wBAEtC,CAAA;AAED,eAAO,MAAM,uBAAuB,q3DASY,CAAA;AAwChD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAChC,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,sBAAsB,CAAC,CAchC;AAED;;;GAGG;AACH,eAAO,MAAM,6BAA6B,EAAE,MAAM,CAAC,yBAAyB,CAUtE,CAAA;AAEN;;;;;;;GAOG;AACH,eAAO,MAAM,+BAA+B,EAAE,MAAM,CAAC,0BAA0B,CA4DzE,CAAA"}
+{"version":3,"file":"structure-stage.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/ingestion/scribe/structure-stage.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,EASH,KAAK,0BAA0B,EAC/B,KAAK,yBAAyB,EACjC,MAAM,4BAA4B,CAAA;AAEnC,OAAO,KAAK,EAER,wBAAwB,EAC3B,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAGH,KAAK,sBAAsB,EAC9B,MAAM,cAAc,CAAA;AAIrB,eAAO,MAAM,eAAe,cAAc,CAAA;AAE1C,6DAA6D;AAC7D,eAAO,MAAM,wBAAwB,EAAE,wBAEtC,CAAA;AAED,eAAO,MAAM,uBAAuB,i3EAWY,CAAA;AAwChD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAChC,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,sBAAsB,CAAC,CAehC;AAED;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B,EAAE,MAAM,CAAC,yBAAyB,CAoCtE,CAAA;AAEN;;;;;;;GAOG;AACH,eAAO,MAAM,+BAA+B,EAAE,MAAM,CAAC,0BAA0B,CA4DzE,CAAA"}

package/dist/extensions/pipelines/ingestion/scribe/structure-stage.js

@@ -13,9 +13,12 @@
 // read, not the raw model candidates.
 import { llmStage } from "../../../../lib/pipelines/stage-helpers.js";
 import { deterministicStage } from "../../../../lib/pipelines/stage-helpers.js";
-import { STAGE_IDS, RelationExtractionOutputSchema, ConclusionSelectionOutputSchema, selectFallbackConclusion, CONCLUSION_SELECTION_NO_CONCLUSION_FAILURE_CODE, } from "../../base/stages/index.js";
+import { STAGE_IDS, RelationExtractionOutputSchema, ConclusionSelectionOutputSchema, checkArgumentStructure, selectFallbackConclusion, CONCLUSION_SELECTION_NO_CONCLUSION_FAILURE_CODE, } from "../../base/stages/index.js";
+import { resolveClaimTypes } from "../../base/stages/formula-compilation.js";
 import { ScribeStructureOutputSchema, } from "./schemas.js";
-export const STRUCTURE_MODEL = "gpt-5.4-mini";
+import { buildSourceRelations } from "./source-attachment.js";
+import { settleCitations } from "./extract-stage.js";
+export const STRUCTURE_MODEL = "gpt-6-sol";
 /** Internal default knobs for scribe's `structure` stage. */
 export const STRUCTURE_STAGE_DEFAULTS = {
     model: STRUCTURE_MODEL,
@@ -24,11 +27,13 @@ export const STRUCTURE_SYSTEM_PROMPT = `You read a canonical claim set — each
 
 Emit:
 - \`relations\` — the inference edges between claims. Each relation: a stable \`relationId\` (r1, r2, ...), a \`type\` of "inference", an \`antecedents\` array of the claim miniIds whose conjunction implies the consequent (one or more; citation- or axiomatic-typed claims may appear here, but never as the consequent), a single \`consequent\` claim miniId, a \`title\`, and an \`evidence\` object, which is always exactly { segmentIds: [], quote: "" } — you are shown the claims, not the text they came from, so you have nothing to quote.
-- each relation's \`title\` — a short noun phrase naming what that step DOES in the argument — the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Examples: "Limits of the crowd's power", "Residence as tacit consent", "Principle over survival".
-- \`conclusionCandidates\` — the claim miniIds that could be the argument's conclusion, ordered by DECREASING confidence (best first). The conclusion is the claim other claims support but that supports nothing further. Never list a citation- or axiomatic-typed claim. Return an empty array only when there is no argument structure.
-- \`conclusionTitle\` — for your FIRST candidate only: a short noun phrase naming what the concluding step DOES in the argument — the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Return an empty string when \`conclusionCandidates\` is empty.
+- each relation's \`title\` — a short noun phrase naming what that step DOES in the argument — the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. Examples: "Limits of the crowd's power", "Residence as tacit consent", "Principle over survival". Every relation's title must differ from every other relation's — two steps never share a name.
+- \`conclusionCandidates\` — the claim miniIds that could be the argument's conclusion, ordered by DECREASING confidence (best first). The conclusion is the claim other claims support but that supports nothing further. Never list a citation- or axiomatic-typed claim.
+- \`conclusionTitle\` — for your FIRST candidate only: a short noun phrase naming what the concluding step DOES in the argument — the inferential move, not the proposition. Do not restate the consequent: that claim's own title is already shown directly beneath this one. Aim for under 60 characters. It must differ from every relation's \`title\` — the step that reaches the conclusion already has its own. Return an empty string when \`conclusionCandidates\` is empty.
 - \`rationale\` — one sentence explaining your best pick (or why none qualifies).
 
+Emit the relations and conclusion the author actually argues. An argument with at least two normal-typed claims has at least one relation and one conclusion candidate, so look for them before concluding there are none. Never invent support the author does not give: if the claims genuinely do not connect, return \`relations\` and \`conclusionCandidates\` empty.
+
 Output ONLY the schema-shaped object. No prose.`;
 function buildStructurePrompt(ctx) {
     const canon = ctx.get(STAGE_IDS.claimCanonicalization);
@@ -77,20 +82,42 @@ export function createStructureStage(options) {
         reasoningEffort: options?.reasoningEffort,
         retry: options?.retry,
         buildPrompt: buildStructurePrompt,
+        checkOutput: (output, ctx) => checkArgumentStructure(ctx, output),
     });
 }
 /**
  * Adapter — republish `structure`'s relations under the
- * relation-extraction slot.
+ * relation-extraction slot, together with the relations that attach each
+ * source claim to the claim it supports (`buildSourceRelations`), read
+ * off the same settled citations the canonicalization slot carries.
  */
 export const structureRelationAdapterStage = deterministicStage({
     id: STAGE_IDS.relationExtraction,
-    dependsOn: [STAGE_IDS.scribeStructure],
+    dependsOn: [
+        STAGE_IDS.scribeStructure,
+        STAGE_IDS.extract,
+        STAGE_IDS.claimTypeClassification,
+    ],
     outputSchema: RelationExtractionOutputSchema,
-    fn: (ctx) => ({
-        relations: ctx.get(STAGE_IDS.scribeStructure)
-            ?.relations ?? [],
-    }),
+    fn: (ctx) => {
+        const structureRelations = ctx.get(STAGE_IDS.scribeStructure)
+            ?.relations ?? [];
+        // Settled again rather than read from the canonicalization slot:
+        // attachment needs the mentions and source pairings too, which
+        // that slot does not carry. The adapter there has reported.
+        const extract = settleCitations(ctx.get(STAGE_IDS.extract), ctx.input.text, () => undefined);
+        const sourceRelations = buildSourceRelations({
+            extract,
+            structureRelations,
+            typeByMiniId: resolveClaimTypes({
+                classifications: ctx.get(STAGE_IDS.claimTypeClassification)?.classifications ?? [],
+                canonicalClaims: extract?.canonicalClaims ?? [],
+            }),
+            inputText: ctx.input.text,
+            addFailure: ctx.addFailure,
+        });
+        return { relations: [...structureRelations, ...sourceRelations] };
+    },
 });
 /**
  * Adapter — republish `structure`'s conclusion candidates under the
@@ -105,7 +132,6 @@ export const structureConclusionAdapterStage = deterministicStage({
     dependsOn: [
         STAGE_IDS.scribeStructure,
         STAGE_IDS.claimTypeClassification,
-        STAGE_IDS.relationExtraction,
     ],
     outputSchema: ConclusionSelectionOutputSchema,
     fn: (ctx) => {
@@ -113,8 +139,10 @@ export const structureConclusionAdapterStage = deterministicStage({
         const candidates = structure?.conclusionCandidates ?? [];
         const rationale = structure?.rationale ?? "";
         const classifications = ctx.get(STAGE_IDS.claimTypeClassification)?.classifications ?? [];
-        const relations = ctx.get(STAGE_IDS.relationExtraction)
-            ?.relations ?? [];
+        // `structure`'s own relations, not the published slot: the
+        // source relations added there would make each supported claim
+        // look like a candidate conclusion to the graph fallback.
+        const relations = structure?.relations ?? [];
         const normalMiniIds = new Set(classifications
             .filter((entry) => entry.type === "normal")
             .map((entry) => entry.miniId));

package/dist/extensions/pipelines/ingestion/scribe/structure-stage.js.map

@@ -1 +1 @@
-{"version":3,"file":"structure-stage.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/ingestion/scribe/structure-stage.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,oEAAoE;AACpE,2DAA2D;AAC3D,iEAAiE;AACjE,sDAAsD;AACtD,gEAAgE;AAChE,EAAE;AACF,mEAAmE;AACnE,kEAAkE;AAClE,qEAAqE;AACrE,sEAAsE;AACtE,sEAAsE;AACtE,sCAAsC;AAEtC,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AACrE,OAAO,EAAE,kBAAkB,EAAE,MAAM,4CAA4C,CAAA;AAE/E,OAAO,EACH,SAAS,EACT,8BAA8B,EAC9B,+BAA+B,EAC/B,wBAAwB,EACxB,+CAA+C,GAKlD,MAAM,4BAA4B,CAAA;AAEnC,OAAO,EACH,2BAA2B,GAE9B,MAAM,cAAc,CAAA;AAErB,MAAM,CAAC,MAAM,eAAe,GAAG,cAAc,CAAA;AAE7C,6DAA6D;AAC7D,MAAM,CAAC,MAAM,wBAAwB,GAA6B;IAC9D,KAAK,EAAE,eAAe;CACzB,CAAA;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAG;;;;;;;;;gDASS,CAAA;AAEhD,SAAS,oBAAoB,CAAC,GAAkB;IAI5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC9C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,eAAe,IAAI,EAAE,EAAE,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IACD,oEAAoE;IACpE,qEAAqE;IACrE,sEAAsE;IACtE,kEAAkE;IAClE,gEAAgE;IAChE,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,eAAe,IAAI,EAAE,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAA;QACxD,OAAO,MAAM,CAAC,CAAC,MAAM,UAAU,WAAW,WAAW,CAAC,CAAC,eAAe,WAAW,IAAI,CAAC,SAAS,CAC3F;YACI,GAAG,CAAC;YACJ,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,SAAS;YACrB,eAAe,EAAE,SAAS;YAC1B,IAAI,EAAE,SAAS;SAClB,CACJ,EAAE,CAAA;IACP,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,MAAM,GAAG,kBAAkB,SAAS,CAAC,eAAe,SAAS,uBAAuB,EAAE,CAAA;IAC5F,MAAM,IAAI,GAAG,oDAAoD,UAAU,mEAAmE,CAAA;IAC9I,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAChC,OAAkC;IAElC,OAAO,QAAQ,CAAyB;QACpC,EAAE,EAAE,SAAS,CAAC,eAAe;QAC7B,SAAS,EAAE;YACP,SAAS,CAAC,qBAAqB;YAC/B,SAAS,CAAC,uBAAuB;SACpC;QACD,YAAY,EAAE,2BAA2B;QACzC,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,eAAe;QACxC,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,KAAK,EAAE,OAAO,EAAE,KAAK;QACrB,WAAW,EAAE,oBAAoB;KACpC,CAAC,CAAA;AACN,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,6BAA6B,GACtC,kBAAkB,CAA4B;IAC1C,EAAE,EAAE,SAAS,CAAC,kBAAkB;IAChC,SAAS,EAAE,CAAC,SAAS,CAAC,eAAe,CAAC;IACtC,YAAY,EAAE,8BAA8B;IAC5C,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACV,SAAS,EACL,GAAG,CAAC,GAAG,CAAyB,SAAS,CAAC,eAAe,CAAC;YACtD,EAAE,SAAS,IAAI,EAAE;KAC5B,CAAC;CACL,CAAC,CAAA;AAEN;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,+BAA+B,GACxC,kBAAkB,CAA6B;IAC3C,EAAE,EAAE,SAAS,CAAC,mBAAmB;IACjC,SAAS,EAAE;QACP,SAAS,CAAC,eAAe;QACzB,SAAS,CAAC,uBAAuB;QACjC,SAAS,CAAC,kBAAkB;KAC/B;IACD,YAAY,EAAE,+BAA+B;IAC7C,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;QACR,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CACrB,SAAS,CAAC,eAAe,CAC5B,CAAA;QACD,MAAM,UAAU,GAAG,SAAS,EAAE,oBAAoB,IAAI,EAAE,CAAA;QACxD,MAAM,SAAS,GAAG,SAAS,EAAE,SAAS,IAAI,EAAE,CAAA;QAC5C,MAAM,eAAe,GACjB,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,uBAAuB,CACpC,EAAE,eAAe,IAAI,EAAE,CAAA;QAC5B,MAAM,SAAS,GACX,GAAG,CAAC,GAAG,CAA4B,SAAS,CAAC,kBAAkB,CAAC;YAC5D,EAAE,SAAS,IAAI,EAAE,CAAA;QAEzB,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,eAAe;aACV,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;aAC1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CACpC,CAAA;QACD,MAAM,SAAS,GACX,UAAU,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,IAAI,CAAA;QAClE,MAAM,gBAAgB,GAClB,SAAS;YACT,wBAAwB,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;QACxD,MAAM,iBAAiB,GACnB,SAAS,KAAK,IAAI,IAAI,gBAAgB,KAAK,IAAI,CAAA;QAEnD,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAC5B,GAAG,CAAC,UAAU,CAAC;gBACX,IAAI,EAAE,+CAA+C;gBACrD,OAAO,EACH,SAAS,CAAC,MAAM,GAAG,CAAC;oBAChB,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,yCAAyC;gBACnD,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,SAAS,EAAE;aACzB,CAAC,CAAA;QACN,CAAC;QAED,OAAO;YACH,gBAAgB;YAChB,oBAAoB,EAAE,UAAU;YAChC,oDAAoD;YACpD,gDAAgD;YAChD,6CAA6C;YAC7C,KAAK,EAAE,SAAS,EAAE,eAAe,IAAI,EAAE;YACvC,SAAS,EAAE,iBAAiB;gBACxB,CAAC,CAAC,iBAAiB,gBAAgB,iEAAiE;gBACpG,CAAC,CAAC,SAAS;SAClB,CAAA;IACL,CAAC;CACJ,CAAC,CAAA"}
+{"version":3,"file":"structure-stage.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/ingestion/scribe/structure-stage.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,oEAAoE;AACpE,2DAA2D;AAC3D,iEAAiE;AACjE,sDAAsD;AACtD,gEAAgE;AAChE,EAAE;AACF,mEAAmE;AACnE,kEAAkE;AAClE,qEAAqE;AACrE,sEAAsE;AACtE,sEAAsE;AACtE,sCAAsC;AAEtC,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AACrE,OAAO,EAAE,kBAAkB,EAAE,MAAM,4CAA4C,CAAA;AAE/E,OAAO,EACH,SAAS,EACT,8BAA8B,EAC9B,+BAA+B,EAC/B,sBAAsB,EACtB,wBAAwB,EACxB,+CAA+C,GAKlD,MAAM,4BAA4B,CAAA;AACnC,OAAO,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAA;AAK5E,OAAO,EACH,2BAA2B,GAG9B,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAA;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAA;AAEpD,MAAM,CAAC,MAAM,eAAe,GAAG,WAAW,CAAA;AAE1C,6DAA6D;AAC7D,MAAM,CAAC,MAAM,wBAAwB,GAA6B;IAC9D,KAAK,EAAE,eAAe;CACzB,CAAA;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAG;;;;;;;;;;;gDAWS,CAAA;AAEhD,SAAS,oBAAoB,CAAC,GAAkB;IAI5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC9C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,eAAe,IAAI,EAAE,EAAE,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IACD,oEAAoE;IACpE,qEAAqE;IACrE,sEAAsE;IACtE,kEAAkE;IAClE,gEAAgE;IAChE,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,eAAe,IAAI,EAAE,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAA;QACxD,OAAO,MAAM,CAAC,CAAC,MAAM,UAAU,WAAW,WAAW,CAAC,CAAC,eAAe,WAAW,IAAI,CAAC,SAAS,CAC3F;YACI,GAAG,CAAC;YACJ,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,SAAS;YACrB,eAAe,EAAE,SAAS;YAC1B,IAAI,EAAE,SAAS;SAClB,CACJ,EAAE,CAAA;IACP,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,MAAM,GAAG,kBAAkB,SAAS,CAAC,eAAe,SAAS,uBAAuB,EAAE,CAAA;IAC5F,MAAM,IAAI,GAAG,oDAAoD,UAAU,mEAAmE,CAAA;IAC9I,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAChC,OAAkC;IAElC,OAAO,QAAQ,CAAyB;QACpC,EAAE,EAAE,SAAS,CAAC,eAAe;QAC7B,SAAS,EAAE;YACP,SAAS,CAAC,qBAAqB;YAC/B,SAAS,CAAC,uBAAuB;SACpC;QACD,YAAY,EAAE,2BAA2B;QACzC,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,eAAe;QACxC,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,KAAK,EAAE,OAAO,EAAE,KAAK;QACrB,WAAW,EAAE,oBAAoB;QACjC,WAAW,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,sBAAsB,CAAC,GAAG,EAAE,MAAM,CAAC;KACpE,CAAC,CAAA;AACN,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,6BAA6B,GACtC,kBAAkB,CAA4B;IAC1C,EAAE,EAAE,SAAS,CAAC,kBAAkB;IAChC,SAAS,EAAE;QACP,SAAS,CAAC,eAAe;QACzB,SAAS,CAAC,OAAO;QACjB,SAAS,CAAC,uBAAuB;KACpC;IACD,YAAY,EAAE,8BAA8B;IAC5C,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;QACR,MAAM,kBAAkB,GACpB,GAAG,CAAC,GAAG,CAAyB,SAAS,CAAC,eAAe,CAAC;YACtD,EAAE,SAAS,IAAI,EAAE,CAAA;QACzB,iEAAiE;QACjE,+DAA+D;QAC/D,4DAA4D;QAC5D,MAAM,OAAO,GAAG,eAAe,CAC3B,GAAG,CAAC,GAAG,CAAuB,SAAS,CAAC,OAAO,CAAC,EAC/C,GAAG,CAAC,KAAyB,CAAC,IAAI,EACnC,GAAG,EAAE,CAAC,SAAS,CAClB,CAAA;QACD,MAAM,eAAe,GAAG,oBAAoB,CAAC;YACzC,OAAO;YACP,kBAAkB;YAClB,YAAY,EAAE,iBAAiB,CAAC;gBAC5B,eAAe,EACX,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,uBAAuB,CACpC,EAAE,eAAe,IAAI,EAAE;gBAC5B,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,EAAE;aAClD,CAAC;YACF,SAAS,EAAG,GAAG,CAAC,KAAyB,CAAC,IAAI;YAC9C,UAAU,EAAE,GAAG,CAAC,UAAU;SAC7B,CAAC,CAAA;QACF,OAAO,EAAE,SAAS,EAAE,CAAC,GAAG,kBAAkB,EAAE,GAAG,eAAe,CAAC,EAAE,CAAA;IACrE,CAAC;CACJ,CAAC,CAAA;AAEN;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,+BAA+B,GACxC,kBAAkB,CAA6B;IAC3C,EAAE,EAAE,SAAS,CAAC,mBAAmB;IACjC,SAAS,EAAE;QACP,SAAS,CAAC,eAAe;QACzB,SAAS,CAAC,uBAAuB;KACpC;IACD,YAAY,EAAE,+BAA+B;IAC7C,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;QACR,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CACrB,SAAS,CAAC,eAAe,CAC5B,CAAA;QACD,MAAM,UAAU,GAAG,SAAS,EAAE,oBAAoB,IAAI,EAAE,CAAA;QACxD,MAAM,SAAS,GAAG,SAAS,EAAE,SAAS,IAAI,EAAE,CAAA;QAC5C,MAAM,eAAe,GACjB,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,uBAAuB,CACpC,EAAE,eAAe,IAAI,EAAE,CAAA;QAC5B,2DAA2D;QAC3D,+DAA+D;QAC/D,0DAA0D;QAC1D,MAAM,SAAS,GAAG,SAAS,EAAE,SAAS,IAAI,EAAE,CAAA;QAE5C,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,eAAe;aACV,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;aAC1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CACpC,CAAA;QACD,MAAM,SAAS,GACX,UAAU,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,IAAI,CAAA;QAClE,MAAM,gBAAgB,GAClB,SAAS;YACT,wBAAwB,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;QACxD,MAAM,iBAAiB,GACnB,SAAS,KAAK,IAAI,IAAI,gBAAgB,KAAK,IAAI,CAAA;QAEnD,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAC5B,GAAG,CAAC,UAAU,CAAC;gBACX,IAAI,EAAE,+CAA+C;gBACrD,OAAO,EACH,SAAS,CAAC,MAAM,GAAG,CAAC;oBAChB,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,yCAAyC;gBACnD,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,SAAS,EAAE;aACzB,CAAC,CAAA;QACN,CAAC;QAED,OAAO;YACH,gBAAgB;YAChB,oBAAoB,EAAE,UAAU;YAChC,oDAAoD;YACpD,gDAAgD;YAChD,6CAA6C;YAC7C,KAAK,EAAE,SAAS,EAAE,eAAe,IAAI,EAAE;YACvC,SAAS,EAAE,iBAAiB;gBACxB,CAAC,CAAC,iBAAiB,gBAAgB,iEAAiE;gBACpG,CAAC,CAAC,SAAS;SAClB,CAAA;IACL,CAAC;CACJ,CAAC,CAAA"}