@proposit/proposit-core 2.2.1 → 2.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/extensions/basics/schemata.d.ts +4 -0
- package/dist/extensions/basics/schemata.d.ts.map +1 -1
- package/dist/extensions/basics/schemata.js +6 -0
- package/dist/extensions/basics/schemata.js.map +1 -1
- package/dist/extensions/pipelines/base/finalize-response-v2.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/finalize-response-v2.js +88 -22
- package/dist/extensions/pipelines/base/finalize-response-v2.js.map +1 -1
- package/dist/extensions/pipelines/base/stages/claim-canonicalization.d.ts +1 -1
- package/dist/extensions/pipelines/base/stages/claim-canonicalization.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/stages/claim-canonicalization.js +1 -1
- package/dist/extensions/pipelines/base/stages/conclusion-selection.d.ts +3 -3
- package/dist/extensions/pipelines/base/stages/conclusion-selection.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/stages/conclusion-selection.js +5 -5
- package/dist/extensions/pipelines/base/stages/conclusion-selection.js.map +1 -1
- package/dist/extensions/pipelines/base/stages/formula-compilation.d.ts +69 -14
- package/dist/extensions/pipelines/base/stages/formula-compilation.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/stages/formula-compilation.js +204 -76
- package/dist/extensions/pipelines/base/stages/formula-compilation.js.map +1 -1
- package/dist/extensions/pipelines/base/stages/relation-extraction.d.ts +1 -1
- package/dist/extensions/pipelines/base/stages/relation-extraction.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/stages/relation-extraction.js +20 -19
- package/dist/extensions/pipelines/base/stages/relation-extraction.js.map +1 -1
- package/dist/extensions/pipelines/base/stages/schemas.d.ts +10 -8
- package/dist/extensions/pipelines/base/stages/schemas.d.ts.map +1 -1
- package/dist/extensions/pipelines/base/stages/schemas.js +14 -11
- package/dist/extensions/pipelines/base/stages/schemas.js.map +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/extract-stage.d.ts +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/extract-stage.d.ts.map +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/extract-stage.js +2 -1
- package/dist/extensions/pipelines/ingestion/scribe/extract-stage.js.map +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/schemas.d.ts +3 -3
- package/dist/extensions/pipelines/ingestion/scribe/structure-stage.d.ts +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/structure-stage.d.ts.map +1 -1
- package/dist/extensions/pipelines/ingestion/scribe/structure-stage.js +2 -2
- package/dist/extensions/pipelines/ingestion/scribe/structure-stage.js.map +1 -1
- package/dist/lib/parsing/argument-parser.d.ts.map +1 -1
- package/dist/lib/parsing/argument-parser.js +18 -68
- package/dist/lib/parsing/argument-parser.js.map +1 -1
- package/dist/lib/parsing/schemata.d.ts +13 -0
- package/dist/lib/parsing/schemata.d.ts.map +1 -1
- package/dist/lib/parsing/schemata.js +10 -0
- package/dist/lib/parsing/schemata.js.map +1 -1
- package/package.json +1 -1
|
@@ -7,6 +7,7 @@ export declare const BasicsNormalClaimExtension: Type.TObject<{
|
|
|
7
7
|
export declare const BasicsCitationClaimExtension: Type.TObject<{
|
|
8
8
|
title: Type.TString;
|
|
9
9
|
url: Type.TString;
|
|
10
|
+
citationTypeGuess: Type.TOptional<Type.TUnion<[Type.TUnion<[Type.TLiteral<"Book">, Type.TLiteral<"Website">, Type.TLiteral<"BookChapter">, Type.TLiteral<"Handbook">, Type.TLiteral<"TechnicalReport">, Type.TLiteral<"Standard">, Type.TLiteral<"Thesis">, Type.TLiteral<"Patent">, Type.TLiteral<"Dictionary">, Type.TLiteral<"Encyclopedia">, Type.TLiteral<"JournalArticle">, Type.TLiteral<"MagazineArticle">, Type.TLiteral<"NewspaperArticle">, Type.TLiteral<"ConferencePaper">, Type.TLiteral<"ConferenceProceedings">, Type.TLiteral<"Dataset">, Type.TLiteral<"Software">, Type.TLiteral<"OnlineDocument">, Type.TLiteral<"Blog">, Type.TLiteral<"SocialMedia">, Type.TLiteral<"Preprint">, Type.TLiteral<"Video">, Type.TLiteral<"Podcast">, Type.TLiteral<"Course">, Type.TLiteral<"Presentation">, Type.TLiteral<"Interview">, Type.TLiteral<"PersonalCommunication">, Type.TLiteral<"Email">, Type.TLiteral<"Law">, Type.TLiteral<"CourtCase">, Type.TLiteral<"GovernmentPublication">, Type.TLiteral<"Datasheet">, Type.TLiteral<"ProductManual">]>, Type.TLiteral<"unknown">]>>;
|
|
10
11
|
type: Type.TLiteral<"citation">;
|
|
11
12
|
}>;
|
|
12
13
|
export declare const BasicsAxiomaticClaimExtension: Type.TObject<{
|
|
@@ -20,6 +21,7 @@ export declare const BasicsClaimExtension: Type.TUnion<[Type.TObject<{
|
|
|
20
21
|
}>, Type.TObject<{
|
|
21
22
|
title: Type.TString;
|
|
22
23
|
url: Type.TString;
|
|
24
|
+
citationTypeGuess: Type.TOptional<Type.TUnion<[Type.TUnion<[Type.TLiteral<"Book">, Type.TLiteral<"Website">, Type.TLiteral<"BookChapter">, Type.TLiteral<"Handbook">, Type.TLiteral<"TechnicalReport">, Type.TLiteral<"Standard">, Type.TLiteral<"Thesis">, Type.TLiteral<"Patent">, Type.TLiteral<"Dictionary">, Type.TLiteral<"Encyclopedia">, Type.TLiteral<"JournalArticle">, Type.TLiteral<"MagazineArticle">, Type.TLiteral<"NewspaperArticle">, Type.TLiteral<"ConferencePaper">, Type.TLiteral<"ConferenceProceedings">, Type.TLiteral<"Dataset">, Type.TLiteral<"Software">, Type.TLiteral<"OnlineDocument">, Type.TLiteral<"Blog">, Type.TLiteral<"SocialMedia">, Type.TLiteral<"Preprint">, Type.TLiteral<"Video">, Type.TLiteral<"Podcast">, Type.TLiteral<"Course">, Type.TLiteral<"Presentation">, Type.TLiteral<"Interview">, Type.TLiteral<"PersonalCommunication">, Type.TLiteral<"Email">, Type.TLiteral<"Law">, Type.TLiteral<"CourtCase">, Type.TLiteral<"GovernmentPublication">, Type.TLiteral<"Datasheet">, Type.TLiteral<"ProductManual">]>, Type.TLiteral<"unknown">]>>;
|
|
23
25
|
type: Type.TLiteral<"citation">;
|
|
24
26
|
}>, Type.TObject<{
|
|
25
27
|
axiom: Type.TString;
|
|
@@ -69,6 +71,7 @@ export declare const BasicsCitationClaimSchema: Type.TIntersect<[Type.TObject<{
|
|
|
69
71
|
}>, Type.TObject<{
|
|
70
72
|
title: Type.TString;
|
|
71
73
|
url: Type.TString;
|
|
74
|
+
citationTypeGuess: Type.TOptional<Type.TUnion<[Type.TUnion<[Type.TLiteral<"Book">, Type.TLiteral<"Website">, Type.TLiteral<"BookChapter">, Type.TLiteral<"Handbook">, Type.TLiteral<"TechnicalReport">, Type.TLiteral<"Standard">, Type.TLiteral<"Thesis">, Type.TLiteral<"Patent">, Type.TLiteral<"Dictionary">, Type.TLiteral<"Encyclopedia">, Type.TLiteral<"JournalArticle">, Type.TLiteral<"MagazineArticle">, Type.TLiteral<"NewspaperArticle">, Type.TLiteral<"ConferencePaper">, Type.TLiteral<"ConferenceProceedings">, Type.TLiteral<"Dataset">, Type.TLiteral<"Software">, Type.TLiteral<"OnlineDocument">, Type.TLiteral<"Blog">, Type.TLiteral<"SocialMedia">, Type.TLiteral<"Preprint">, Type.TLiteral<"Video">, Type.TLiteral<"Podcast">, Type.TLiteral<"Course">, Type.TLiteral<"Presentation">, Type.TLiteral<"Interview">, Type.TLiteral<"PersonalCommunication">, Type.TLiteral<"Email">, Type.TLiteral<"Law">, Type.TLiteral<"CourtCase">, Type.TLiteral<"GovernmentPublication">, Type.TLiteral<"Datasheet">, Type.TLiteral<"ProductManual">]>, Type.TLiteral<"unknown">]>>;
|
|
72
75
|
type: Type.TLiteral<"citation">;
|
|
73
76
|
}>]>;
|
|
74
77
|
export type TBasicsCitationClaim = Static<typeof BasicsCitationClaimSchema>;
|
|
@@ -102,6 +105,7 @@ export declare const BasicsClaimSchema: Type.TUnion<[Type.TIntersect<[Type.TObje
|
|
|
102
105
|
}>, Type.TObject<{
|
|
103
106
|
title: Type.TString;
|
|
104
107
|
url: Type.TString;
|
|
108
|
+
citationTypeGuess: Type.TOptional<Type.TUnion<[Type.TUnion<[Type.TLiteral<"Book">, Type.TLiteral<"Website">, Type.TLiteral<"BookChapter">, Type.TLiteral<"Handbook">, Type.TLiteral<"TechnicalReport">, Type.TLiteral<"Standard">, Type.TLiteral<"Thesis">, Type.TLiteral<"Patent">, Type.TLiteral<"Dictionary">, Type.TLiteral<"Encyclopedia">, Type.TLiteral<"JournalArticle">, Type.TLiteral<"MagazineArticle">, Type.TLiteral<"NewspaperArticle">, Type.TLiteral<"ConferencePaper">, Type.TLiteral<"ConferenceProceedings">, Type.TLiteral<"Dataset">, Type.TLiteral<"Software">, Type.TLiteral<"OnlineDocument">, Type.TLiteral<"Blog">, Type.TLiteral<"SocialMedia">, Type.TLiteral<"Preprint">, Type.TLiteral<"Video">, Type.TLiteral<"Podcast">, Type.TLiteral<"Course">, Type.TLiteral<"Presentation">, Type.TLiteral<"Interview">, Type.TLiteral<"PersonalCommunication">, Type.TLiteral<"Email">, Type.TLiteral<"Law">, Type.TLiteral<"CourtCase">, Type.TLiteral<"GovernmentPublication">, Type.TLiteral<"Datasheet">, Type.TLiteral<"ProductManual">]>, Type.TLiteral<"unknown">]>>;
|
|
105
109
|
type: Type.TLiteral<"citation">;
|
|
106
110
|
}>]>, Type.TIntersect<[Type.TObject<{
|
|
107
111
|
id: Type.TString;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"schemata.d.ts","sourceRoot":"","sources":["../../../src/extensions/basics/schemata.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;
|
|
1
|
+
{"version":3,"file":"schemata.d.ts","sourceRoot":"","sources":["../../../src/extensions/basics/schemata.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;AAoB3C,eAAO,MAAM,0BAA0B;;;;EAUrC,CAAA;AAEF,eAAO,MAAM,4BAA4B;;;;;EAuBvC,CAAA;AAEF,eAAO,MAAM,6BAA6B;;;EAMxC,CAAA;AAEF,eAAO,MAAM,oBAAoB;;;;;;;;;;;;IAUhC,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,kBAAkB,CAAA;AAEtD,eAAO,MAAM,sBAAsB;;EAKjC,CAAA;AAEF,eAAO,MAAM,uBAAuB;;EAKlC,CAAA;AAGF,eAAO,MAAM,oBAAoB;;;;;;;;IAG/B,CAAA;AACF,MAAM,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,oBAAoB,CAAC,CAAA;AAEjE,eAAO,MAAM,uBAAuB;;;;;;;;;;IAGlC,CAAA;AACF,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,OAAO,uBAAuB,CAAC,CAAA;AAEvE,eAAO,MAAM,yBAAyB;;;;;;;;;;;IAGpC,CAAA;AACF,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,OAAO,yBAAyB,CAAC,CAAA;AAE3E,eAAO,MAAM,0BAA0B;;;;;;;;;IAGrC,CAAA;AACF,MAAM,MAAM,qBAAqB,GAAG,MAAM,CAAC,OAAO,0BAA0B,CAAC,CAAA;AAE7E,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAI5B,CAAA;AACF,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,iBAAiB,CAAC,CAAA;AAE3D,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;IAG9B,CAAA;AACF,MAAM,MAAM,cAAc,GAAG,MAAM,CAAC,OAAO,mBAAmB,CAAC,CAAA;AAE/D,eAAO,MAAM,mBAAmB,cAI9B,CAAA"}
|
|
@@ -3,6 +3,7 @@ import { CoreArgumentSchema } from "../../lib/schemata/argument.js";
|
|
|
3
3
|
import { CoreClaimAxiomaticTypeSchema, CoreClaimCitationTypeSchema, CoreClaimNormalTypeSchema, CoreClaimSchema, } from "../../lib/schemata/claim.js";
|
|
4
4
|
import { CorePremiseSchema } from "../../lib/schemata/propositional.js";
|
|
5
5
|
import { buildParsingResponseSchema } from "../../lib/parsing/schemata.js";
|
|
6
|
+
import { UnparsedCitationTypeGuessSchema } from "../citations/unparsed/index.js";
|
|
6
7
|
// Parsing response extensions.
|
|
7
8
|
//
|
|
8
9
|
// These per-entity extension shapes are exported so downstream
|
|
@@ -39,6 +40,11 @@ export const BasicsCitationClaimExtension = Type.Object({
|
|
|
39
40
|
// hint, and the post-hoc clamp still allows the full 500 chars.
|
|
40
41
|
description: "The URL of the citation supporting the claim",
|
|
41
42
|
}),
|
|
43
|
+
// Best-guess IEEE reference type for the as-yet-unstructured
|
|
44
|
+
// citation (or "unknown"). Optional so older recorded data that
|
|
45
|
+
// predates the guess still validates against this schema; finalize
|
|
46
|
+
// sanitizes whatever the model emits back into the enum.
|
|
47
|
+
citationTypeGuess: Type.Optional(UnparsedCitationTypeGuessSchema),
|
|
42
48
|
type: CoreClaimCitationTypeSchema,
|
|
43
49
|
});
|
|
44
50
|
export const BasicsAxiomaticClaimExtension = Type.Object({
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"schemata.js","sourceRoot":"","sources":["../../../src/extensions/basics/schemata.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAe,MAAM,SAAS,CAAA;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAA;AACnE,OAAO,EACH,4BAA4B,EAC5B,2BAA2B,EAC3B,yBAAyB,EACzB,eAAe,GAClB,MAAM,6BAA6B,CAAA;AACpC,OAAO,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAA;AACvE,OAAO,EAAE,0BAA0B,EAAE,MAAM,+BAA+B,CAAA;
|
|
1
|
+
{"version":3,"file":"schemata.js","sourceRoot":"","sources":["../../../src/extensions/basics/schemata.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAe,MAAM,SAAS,CAAA;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAA;AACnE,OAAO,EACH,4BAA4B,EAC5B,2BAA2B,EAC3B,yBAAyB,EACzB,eAAe,GAClB,MAAM,6BAA6B,CAAA;AACpC,OAAO,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAA;AACvE,OAAO,EAAE,0BAA0B,EAAE,MAAM,+BAA+B,CAAA;AAC1E,OAAO,EAAE,+BAA+B,EAAE,MAAM,gCAAgC,CAAA;AAEhF,+BAA+B;AAC/B,EAAE;AACF,+DAA+D;AAC/D,6DAA6D;AAC7D,iEAAiE;AACjE,kEAAkE;AAClE,sEAAsE;AACtE,qDAAqD;AACrD,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC,MAAM,CAAC;IAClD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;QACf,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,qCAAqC;KACrD,CAAC;IACF,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC;QACd,SAAS,EAAE,GAAG;QACd,WAAW,EAAE,qCAAqC;KACrD,CAAC;IACF,IAAI,EAAE,yBAAyB;CAClC,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,4BAA4B,GAAG,IAAI,CAAC,MAAM,CAAC;IACpD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;QACf,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,qCAAqC;KACrD,CAAC;IACF,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;QACb,SAAS,EAAE,GAAG;QACd,gEAAgE;QAChE,yDAAyD;QACzD,iEAAiE;QACjE,iEAAiE;QACjE,4DAA4D;QAC5D,4DAA4D;QAC5D,iEAAiE;QACjE,gEAAgE;QAChE,WAAW,EAAE,8CAA8C;KAC9D,CAAC;IACF,6DAA6D;IAC7D,gEAAgE;IAChE,mEAAmE;IACnE,yDAAyD;IACzD,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,+BAA+B,CAAC;IACjE,IAAI,EAAE,2BAA2B;CACpC,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAI,CAAC,MAAM,CAAC;IACrD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;QACf,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,gCAAgC;KAChD,CAAC;IACF,IAAI,EAAE,4BAA4B;CACrC,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAC1C;IACI,0BAA0B;IAC1B,4BAA4B;IAC5B,6BAA6B;CAChC,EACD;IACI,WAAW,EACP,oIAAoI;CAC3I,CACJ,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;AAEtD,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,CAAC,MAAM,CAAC;IAC9C,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;QACf,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,gCAAgC;KAChD,CAAC;CACL,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/C,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;QACf,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,gCAAgC;KAChD,CAAC;CACL,CAAC,CAAA;AAEF,yBAAyB;AACzB,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,SAAS,CAAC;IAC/C,kBAAkB;IAClB,uBAAuB;CAC1B,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC,SAAS,CAAC;IAClD,eAAe;IACf,0BAA0B;CAC7B,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,yBAAyB,GAAG,IAAI,CAAC,SAAS,CAAC;IACpD,eAAe;IACf,4BAA4B;CAC/B,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC,SAAS,CAAC;IACrD,eAAe;IACf,6BAA6B;CAChC,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC;IACxC,uBAAuB;IACvB,yBAAyB;IACzB,0BAA0B;CAC7B,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC,SAAS,CAAC;IAC9C,iBAAiB;IACjB,sBAAsB;CACzB,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,mBAAmB,GAAG,0BAA0B,CAAC;IAC1D,WAAW,EAAE,oBAAoB;IACjC,aAAa,EAAE,sBAAsB;IACrC,oBAAoB,EAAE,uBAAuB;CAChD,CAAC,CAAA"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"finalize-response-v2.d.ts","sourceRoot":"","sources":["../../../../src/extensions/pipelines/base/finalize-response-v2.ts"],"names":[],"mappings":"AAgCA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAA;AAC5E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAA;AAapE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAA;
|
|
1
|
+
{"version":3,"file":"finalize-response-v2.d.ts","sourceRoot":"","sources":["../../../../src/extensions/pipelines/base/finalize-response-v2.ts"],"names":[],"mappings":"AAgCA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAA;AAC5E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAA;AAapE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAA;AAoErD,eAAO,MAAM,yBAAyB;;;CAG5B,CAAA;AAuMV,MAAM,MAAM,wBAAwB,GAAG;IACnC,GAAG,EAAE,aAAa,CAAA;IAClB,SAAS,EAAE,mBAAmB,CAAA;CACjC,CAAA;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAC9B,KAAK,EAAE,wBAAwB,GAChC,uBAAuB,CAqJzB"}
|
|
@@ -30,6 +30,56 @@
|
|
|
30
30
|
// way for `finalize.run` to consult the executor's accumulated failure
|
|
31
31
|
// list (which would require widening `TStageContext`).
|
|
32
32
|
import { STAGE_IDS, } from "./stages/schemas.js";
|
|
33
|
+
import { IEEE_REFERENCE_TYPES } from "../../citations/ieee/references.js";
|
|
34
|
+
// The valid `citationTypeGuess` values — the 33 IEEE reference types
|
|
35
|
+
// plus the explicit "unknown" fallback. Built from the IEEE list so the
|
|
36
|
+
// sanitizer stays in lockstep with the reference-type schema.
|
|
37
|
+
const VALID_CITATION_TYPE_GUESSES = new Set([
|
|
38
|
+
...IEEE_REFERENCE_TYPES,
|
|
39
|
+
"unknown",
|
|
40
|
+
]);
|
|
41
|
+
/**
|
|
42
|
+
* Coerce an LLM-emitted citation-type guess into the valid guess enum,
|
|
43
|
+
* clamping anything absent or out-of-enum to "unknown". The model is
|
|
44
|
+
* never trusted to stay in-enum, so its raw value is validated here
|
|
45
|
+
* rather than relied upon.
|
|
46
|
+
*/
|
|
47
|
+
function sanitizeCitationTypeGuess(raw) {
|
|
48
|
+
if (typeof raw === "string" &&
|
|
49
|
+
VALID_CITATION_TYPE_GUESSES.has(raw)) {
|
|
50
|
+
return raw;
|
|
51
|
+
}
|
|
52
|
+
return "unknown";
|
|
53
|
+
}
|
|
54
|
+
/**
|
|
55
|
+
* Build the `UnparsedCitation` attached to a claim that finalize keeps
|
|
56
|
+
* typed `citation`. The display `text` is the claim's authored title,
|
|
57
|
+
* falling back to the type-classifier's recorded `sourceString` and
|
|
58
|
+
* finally the claim miniId so the text is never empty. The guess is
|
|
59
|
+
* sanitized; a present, non-empty url is carried, else omitted.
|
|
60
|
+
*/
|
|
61
|
+
function buildUnparsedCitation(args) {
|
|
62
|
+
const text = firstNonEmptyString(args.title) ??
|
|
63
|
+
firstNonEmptyString(args.sourceString) ??
|
|
64
|
+
args.fallbackText;
|
|
65
|
+
const citation = {
|
|
66
|
+
type: "unparsed",
|
|
67
|
+
text,
|
|
68
|
+
citationTypeGuess: sanitizeCitationTypeGuess(args.rawGuess),
|
|
69
|
+
};
|
|
70
|
+
const url = firstNonEmptyString(args.url);
|
|
71
|
+
if (url !== undefined) {
|
|
72
|
+
citation.url = url;
|
|
73
|
+
}
|
|
74
|
+
return citation;
|
|
75
|
+
}
|
|
76
|
+
/** Return a trimmed non-empty string, or undefined for anything else. */
|
|
77
|
+
function firstNonEmptyString(value) {
|
|
78
|
+
if (typeof value !== "string")
|
|
79
|
+
return undefined;
|
|
80
|
+
const trimmed = value.trim();
|
|
81
|
+
return trimmed.length > 0 ? trimmed : undefined;
|
|
82
|
+
}
|
|
33
83
|
export const FINALIZE_V2_FAILURE_TEXTS = {
|
|
34
84
|
noClaims: "No claims could be extracted from the input.",
|
|
35
85
|
noConclusion: "No single conclusion could be selected.",
|
|
@@ -41,9 +91,9 @@ function buildClaimToRole(args) {
|
|
|
41
91
|
// are "intermediate" (per spec §7.4). The conclusion overrides.
|
|
42
92
|
const claimsInRelations = new Set();
|
|
43
93
|
for (const rel of args.relations) {
|
|
44
|
-
for (const
|
|
45
|
-
claimsInRelations.add(
|
|
46
|
-
claimsInRelations.add(rel.
|
|
94
|
+
for (const antecedent of rel.antecedents)
|
|
95
|
+
claimsInRelations.add(antecedent);
|
|
96
|
+
claimsInRelations.add(rel.consequent);
|
|
47
97
|
}
|
|
48
98
|
for (const claim of args.canonicalClaims) {
|
|
49
99
|
if (claim.miniId === args.conclusionMiniId) {
|
|
@@ -111,10 +161,10 @@ function buildPremiseTitle(premise, maps) {
|
|
|
111
161
|
// resolves; the bare-formula fallback is purely defensive.)
|
|
112
162
|
return premise.formula;
|
|
113
163
|
}
|
|
114
|
-
const antecedent = relation.
|
|
164
|
+
const antecedent = relation.antecedents
|
|
115
165
|
.map((src) => quotedClaimTitle(src, maps))
|
|
116
166
|
.join(" and ");
|
|
117
|
-
const consequent = quotedClaimTitle(relation.
|
|
167
|
+
const consequent = quotedClaimTitle(relation.consequent, maps);
|
|
118
168
|
return `If ${antecedent} then ${consequent}`;
|
|
119
169
|
}
|
|
120
170
|
function buildClaimTitleByMiniId(canonicalClaims) {
|
|
@@ -196,25 +246,38 @@ export function finalizeResponseV2(input) {
|
|
|
196
246
|
const claims = canon.canonicalClaims.map((c) => {
|
|
197
247
|
const role = roles[c.miniId];
|
|
198
248
|
const classifiedType = typeByMiniId.get(c.miniId)?.type ?? c.type;
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
//
|
|
202
|
-
//
|
|
203
|
-
//
|
|
204
|
-
//
|
|
205
|
-
//
|
|
206
|
-
//
|
|
207
|
-
//
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
249
|
+
const record = c;
|
|
250
|
+
const stripped = stripCanonicalizerOnlyFields(record);
|
|
251
|
+
// A claim classified `citation` stays `citation` and carries an
|
|
252
|
+
// explicit `UnparsedCitation` (its `text` is the display text, so
|
|
253
|
+
// a url-less reference no longer renders blank). Premise
|
|
254
|
+
// placement is handled upstream by the deterministic relation
|
|
255
|
+
// sort, which keeps citation claims out of freeform premises — so a
|
|
256
|
+
// citation never lands as a freeform antecedent here, and there is
|
|
257
|
+
// no url-presence demotion to do.
|
|
258
|
+
if (classifiedType === "citation") {
|
|
259
|
+
const unparsedCitation = buildUnparsedCitation({
|
|
260
|
+
title: firstNonEmptyString(stripped.title),
|
|
261
|
+
sourceString: typeByMiniId.get(c.miniId)?.sourceString,
|
|
262
|
+
rawGuess: record.citationTypeGuess,
|
|
263
|
+
url: record.url,
|
|
264
|
+
fallbackText: c.miniId,
|
|
265
|
+
});
|
|
266
|
+
// The raw `citationTypeGuess` field rides into finalize on the
|
|
267
|
+
// canonical claim; it is folded into the `citation` object's
|
|
268
|
+
// `citationTypeGuess`, so drop the loose copy from the output.
|
|
269
|
+
const { citationTypeGuess: _rawGuess, ...withoutRawGuess } = stripped;
|
|
270
|
+
void _rawGuess;
|
|
271
|
+
return {
|
|
272
|
+
...withoutRawGuess,
|
|
273
|
+
type: classifiedType,
|
|
274
|
+
role,
|
|
275
|
+
citation: unparsedCitation,
|
|
276
|
+
};
|
|
277
|
+
}
|
|
215
278
|
return {
|
|
216
279
|
...stripped,
|
|
217
|
-
type:
|
|
280
|
+
type: classifiedType,
|
|
218
281
|
role,
|
|
219
282
|
};
|
|
220
283
|
});
|
|
@@ -237,6 +300,9 @@ export function finalizeResponseV2(input) {
|
|
|
237
300
|
variables: finalVariables,
|
|
238
301
|
premises: finalPremises,
|
|
239
302
|
conclusionPremiseMiniId: compilation.conclusionPremiseMiniId,
|
|
303
|
+
// Citation/axiomatic backing the sort extracted from inference
|
|
304
|
+
// antecedents; the parser materializes it into derivation edges.
|
|
305
|
+
derivationBacking: compilation.derivationBacking,
|
|
240
306
|
title: buildArgumentTitle(canon.canonicalClaims, conclusionMiniId),
|
|
241
307
|
};
|
|
242
308
|
return {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"finalize-response-v2.js","sourceRoot":"","sources":["../../../../src/extensions/pipelines/base/finalize-response-v2.ts"],"names":[],"mappings":"AAAA,mEAAmE;AACnE,iEAAiE;AACjE,qBAAqB;AACrB,EAAE;AACF,iEAAiE;AACjE,wBAAwB;AACxB,EAAE;AACF,8DAA8D;AAC9D,oEAAoE;AACpE,iDAAiD;AACjD,2DAA2D;AAC3D,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,yDAAyD;AACzD,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,gEAAgE;AAChE,yEAAyE;AACzE,4EAA4E;AAC5E,kEAAkE;AAClE,yBAAyB;AACzB,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AACtE,yEAAyE;AACzE,uEAAuE;AACvE,sEAAsE;AACtE,uEAAuE;AACvE,uDAAuD;AAIvD,OAAO,EACH,SAAS,GAUZ,MAAM,qBAAqB,CAAA;
|
|
1
|
+
{"version":3,"file":"finalize-response-v2.js","sourceRoot":"","sources":["../../../../src/extensions/pipelines/base/finalize-response-v2.ts"],"names":[],"mappings":"AAAA,mEAAmE;AACnE,iEAAiE;AACjE,qBAAqB;AACrB,EAAE;AACF,iEAAiE;AACjE,wBAAwB;AACxB,EAAE;AACF,8DAA8D;AAC9D,oEAAoE;AACpE,iDAAiD;AACjD,2DAA2D;AAC3D,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,yDAAyD;AACzD,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,gEAAgE;AAChE,yEAAyE;AACzE,4EAA4E;AAC5E,kEAAkE;AAClE,yBAAyB;AACzB,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AACtE,yEAAyE;AACzE,uEAAuE;AACvE,sEAAsE;AACtE,uEAAuE;AACvE,uDAAuD;AAIvD,OAAO,EACH,SAAS,GAUZ,MAAM,qBAAqB,CAAA;AAE5B,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAA;AAMzE,qEAAqE;AACrE,wEAAwE;AACxE,8DAA8D;AAC9D,MAAM,2BAA2B,GAAG,IAAI,GAAG,CAA6B;IACpE,GAAG,oBAAoB;IACvB,SAAS;CACZ,CAAC,CAAA;AAEF;;;;;GAKG;AACH,SAAS,yBAAyB,CAAC,GAAY;IAC3C,IACI,OAAO,GAAG,KAAK,QAAQ;QACvB,2BAA2B,CAAC,GAAG,CAAC,GAAiC,CAAC,EACpE,CAAC;QACC,OAAO,GAAiC,CAAA;IAC5C,CAAC;IACD,OAAO,SAAS,CAAA;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,IAM9B;IACG,MAAM,IAAI,GACN,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC;QAC/B,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,YAAY,CAAA;IACrB,MAAM,QAAQ,GAAsB;QAChC,IAAI,EAAE,UAAU;QAChB,IAAI;QACJ,iBAAiB,EAAE,yBAAyB,CAAC,IAAI,CAAC,QAAQ,CAAC;KAC9D,CAAA;IACD,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACzC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACpB,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAA;IACtB,CAAC;IACD,OAAO,QAAQ,CAAA;AACnB,CAAC;AAED,yEAAyE;AACzE,SAAS,mBAAmB,CAAC,KAAc;IACvC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAA;IAC5B,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAA;AACnD,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GAAG;IACrC,QAAQ,EAAE,8CAA8C;IACxD,YAAY,EAAE,yCAAyC;CACjD,CAAA;AA0BV,SAAS,gBAAgB,CAAC,IAKzB;IACG,MAAM,GAAG,GAA8D,EAAE,CAAA;IACzE,iEAAiE;IACjE,iEAAiE;IACjE,gEAAgE;IAChE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,WAAW;YACpC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACrC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACzC,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACzC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,YAAY,CAAA;QACpC,CAAC;aAAM,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS,CAAA;QACjC,CAAC;aAAM,CAAC;YACJ,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,cAAc,CAAA;QACtC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,SAAS,4BAA4B,CACjC,KAA8B;IAE9B,gEAAgE;IAChE,8DAA8D;IAC9D,8DAA8D;IAC9D,8DAA8D;IAC9D,mBAAmB;IACnB,MAAM,QAAQ,GAA4B,EAAE,CAAA;IAC5C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/C,IAAI,GAAG,KAAK,YAAY,IAAI,GAAG,KAAK,iBAAiB;YAAE,SAAQ;QAC/D,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;IACzB,CAAC;IACD,OAAO,QAAQ,CAAA;AACnB,CAAC;AAuCD;;;;;;GAMG;AACH,SAAS,gBAAgB,CACrB,WAAmB,EACnB,IAAwB;IAExB,MAAM,KAAK,GACP,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC;QACxC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,WAAW,CAAC;QACzC,WAAW,CAAA;IACf,OAAO,IAAI,KAAK,GAAG,CAAA;AACvB,CAAC;AAED,SAAS,iBAAiB,CACtB,OAAyB,EACzB,IAAwB;IAExB,IAAI,OAAO,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;QACpC,8DAA8D;QAC9D,8DAA8D;QAC9D,6DAA6D;QAC7D,+CAA+C;QAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,CAAA;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACxD,OAAO,CACH,CAAC,WAAW,KAAK,SAAS;YACtB,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC;YAC1C,CAAC,CAAC,SAAS,CAAC,IAAI,MAAM,CAC7B,CAAA;IACL,CAAC;IAED,0DAA0D;IAC1D,kEAAkE;IAClE,8DAA8D;IAC9D,sBAAsB;IACtB,MAAM,QAAQ,GACV,OAAO,CAAC,gBAAgB,KAAK,IAAI;QAC7B,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,CAAC;QACjD,CAAC,CAAC,SAAS,CAAA;IACnB,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QACzB,+DAA+D;QAC/D,8DAA8D;QAC9D,+DAA+D;QAC/D,4DAA4D;QAC5D,OAAO,OAAO,CAAC,OAAO,CAAA;IAC1B,CAAC;IAED,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW;SAClC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;SACzC,IAAI,CAAC,OAAO,CAAC,CAAA;IAClB,MAAM,UAAU,GAAG,gBAAgB,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;IAC9D,OAAO,MAAM,UAAU,SAAS,UAAU,EAAE,CAAA;AAChD,CAAC;AAED,SAAS,uBAAuB,CAC5B,eAAgE;IAEhE,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAA;IACnC,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,KAAgC,CAAA;QAC/C,MAAM,KAAK,GACN,MAAM,CAAC,KAA4B;YACnC,MAAM,CAAC,KAA4B,CAAA;QACxC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACtB,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAC9B,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,SAAS,kBAAkB,CACvB,eAAgE,EAChE,gBAA+B;IAE/B,MAAM,GAAG,GAAG,EAAE,CAAA;IACd,MAAM,eAAe,GAAG,eAAe,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,gBAAgB,CACA,CAAA;IACxC,MAAM,cAAc,GACf,eAAe,EAAE,KAA4B;QAC7C,eAAe,EAAE,KAA4B;QAC9C,UAAU,CAAA;IACd,OAAO,cAAc,CAAC,MAAM,IAAI,GAAG;QAC/B,CAAC,CAAC,cAAc;QAChB,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;AAChD,CAAC;AAOD;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAA+B;IAE/B,KAAK,KAAK,CAAC,SAAS,CAAA,CAAC,qDAAqD;IAC1E,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAA;IACrB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;IACD,MAAM,SAAS,GACX,GAAG,CAAC,GAAG,CAA4B,SAAS,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAA;IAC1E,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CACvB,SAAS,CAAC,kBAAkB,CAC/B,CAAA;IACD,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CACtB,SAAS,CAAC,mBAAmB,CAChC,CAAA;IACD,MAAM,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAC5B,SAAS,CAAC,kBAAkB,CAC/B,CAAA;IACD,MAAM,SAAS,GAAG,gBAAgB,EAAE,SAAS,IAAI,EAAE,CAAA;IACnD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyC,CAAA;IACrE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,eAAe,IAAI,EAAE,EAAE,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACzC,CAAC;IAED,MAAM,kBAAkB,GAAY,EAAE,CAAA;IACtC,MAAM,YAAY,GAAG;QACjB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,UAAU,EAAE,SAAS,IAAI,IAAI;KACpD,CAAA;IAED,8CAA8C;IAC9C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/C,OAAO;YACH,QAAQ,EAAE,IAAI;YACd,WAAW,EAAE,yBAAyB,CAAC,QAAQ;YAC/C,GAAG,YAAY;YACf,qDAAqD;YACrD,sDAAsD;YACtD,yBAAyB;YAEzB,kBAAkB;SACM,CAAA;IAChC,CAAC;IAED,iEAAiE;IACjE,6DAA6D;IAC7D,+DAA+D;IAC/D,kDAAkD;IAClD,IAAI,WAAW,EAAE,uBAAuB,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAChE,OAAO;YACH,QAAQ,EAAE,IAAI;YACd,WAAW,EAAE,yBAAyB,CAAC,YAAY;YACnD,GAAG,YAAY;YAEf,kBAAkB;SACM,CAAA;IAChC,CAAC;IAED,qCAAqC;IACrC,MAAM,gBAAgB,GAAG,UAAU,EAAE,gBAAgB,IAAI,IAAI,CAAA;IAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC;QAC3B,eAAe,EAAE,KAAK,CAAC,eAAe;QACtC,SAAS;QACT,gBAAgB;KACnB,CAAC,CAAA;IAEF,MAAM,MAAM,GAAsB,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC9D,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QAC5B,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAA;QACjE,MAAM,MAAM,GAAG,CAAuC,CAAA;QACtD,MAAM,QAAQ,GAAG,4BAA4B,CAAC,MAAM,CAAC,CAAA;QACrD,gEAAgE;QAChE,kEAAkE;QAClE,yDAAyD;QACzD,8DAA8D;QAC9D,oEAAoE;QACpE,mEAAmE;QACnE,kCAAkC;QAClC,IAAI,cAAc,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,gBAAgB,GAAG,qBAAqB,CAAC;gBAC3C,KAAK,EAAE,mBAAmB,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAC1C,YAAY,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,YAAY;gBACtD,QAAQ,EAAE,MAAM,CAAC,iBAAiB;gBAClC,GAAG,EAAE,MAAM,CAAC,GAAG;gBACf,YAAY,EAAE,CAAC,CAAC,MAAM;aACzB,CAAC,CAAA;YACF,+DAA+D;YAC/D,6DAA6D;YAC7D,+DAA+D;YAC/D,MAAM,EAAE,iBAAiB,EAAE,SAAS,EAAE,GAAG,eAAe,EAAE,GACtD,QAAQ,CAAA;YACZ,KAAK,SAAS,CAAA;YACd,OAAO;gBACH,GAAG,eAAe;gBAClB,IAAI,EAAE,cAAc;gBACpB,IAAI;gBACJ,QAAQ,EAAE,gBAAgB;aACC,CAAA;QACnC,CAAC;QACD,OAAO;YACH,GAAG,QAAQ;YACX,IAAI,EAAE,cAAc;YACpB,IAAI;SACuB,CAAA;IACnC,CAAC,CAAC,CAAA;IAEF,MAAM,cAAc,GAAyB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,GAAG,CAAC;KACP,CAAC,CAAC,CAAA;IAEH,MAAM,iBAAiB,GAAuB;QAC1C,kBAAkB,EAAE,uBAAuB,CAAC,KAAK,CAAC,eAAe,CAAC;QAClE,mBAAmB,EAAE,IAAI,GAAG,CACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAClD;QACD,mBAAmB,EAAE,IAAI,GAAG,CACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAClD;QACD,YAAY,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;KACjE,CAAA;IAED,MAAM,aAAa,GAAwB,WAAW,CAAC,QAAQ,CAAC,GAAG,CAC/D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACJ,MAAM,EAAE,CAAC,CAAC,aAAa;QACvB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,KAAK,EAAE,iBAAiB,CAAC,CAAC,EAAE,iBAAiB,CAAC;KACjD,CAAC,CACL,CAAA;IAED,MAAM,QAAQ,GAAuB;QACjC,MAAM;QACN,SAAS,EAAE,cAAc;QACzB,QAAQ,EAAE,aAAa;QACvB,uBAAuB,EAAE,WAAW,CAAC,uBAAuB;QAC5D,+DAA+D;QAC/D,iEAAiE;QACjE,iBAAiB,EAAE,WAAW,CAAC,iBAAiB;QAChD,KAAK,EAAE,kBAAkB,CAAC,KAAK,CAAC,eAAe,EAAE,gBAAgB,CAAC;KACrE,CAAA;IAED,OAAO;QACH,QAAQ,EAAE,QAA0D;QACpE,WAAW,EAAE,IAAI;QACjB,GAAG,YAAY;QAEf,kBAAkB;KACM,CAAA;AAChC,CAAC"}
|
|
@@ -4,7 +4,7 @@ import type { TStage } from "../../../../lib/pipelines/types.js";
|
|
|
4
4
|
import type { TIngestionExtension, TLlmStageOptionsOverride } from "../types.js";
|
|
5
5
|
export declare const CLAIM_CANONICALIZATION_MODEL = "gpt-5.5";
|
|
6
6
|
export declare const CLAIM_CANONICALIZATION_REASONING: "minimal" | "low" | "medium" | "high";
|
|
7
|
-
export declare const CLAIM_CANONICALIZATION_SYSTEM_PROMPT = "You merge raw claim mentions into a single canonical set of claims for an argument-ingestion pipeline.\n\nYou are given:\n- the raw input text (for full context)\n- the segmented breakdown of the text\n- the list of every claim mention extracted from those segments\n- optionally, the detected citation sources + axiom indicators\n\nYour output has two parts:\n\n1. `canonicalClaims` \u2014 an array of canonical claims, one entry per distinct proposition the author makes. Two mentions that assert the same proposition (even when phrased differently across the text) merge into a single canonical claim. Each canonical claim carries:\n - `miniId` \u2014 assign in canonicalization order: c1, c2, c3, ...\n - `mentionIds` \u2014 list of the mention ids that resolved to this claim\n - `type` \u2014 one of \"normal\", \"citation\", or \"axiomatic\" (see below)\n - `suggestedSymbol` \u2014 a short PascalCase-or-snake_case identifier summarizing the claim (e.g. \"Rain_Wets_Ground\", \"NASA_Temp_Rise\", \"Socrates_Mortal\"). Use letters, digits, and underscores only; start with a letter or underscore; keep under 32 characters; aim for under 20. AVOID single letters and generic names like \"Claim1\".\n - the extension fields described in your output schema (title, body, url, axiom \u2014 whichever apply to the claim's `type`)\n\n2. `mentionToClaim` \u2014 an array of `{ \"mentionId\": \"...\", \"claimMiniId\": \"...\" }` entries, one per input mention. Every input mentionId must appear in exactly one entry; the mapping is total. (We surface this as a list rather than a map because the response schema does not allow arbitrary string keys.)\n\n## Claim types\n\n- `\"normal\"` \u2014 a primary proposition the argument argues for or from.\n- `\"citation\"` \u2014 a claim whose content is \"the cited source asserts X\". Use this type when one of the citation sources covers the same span(s) as the mention. Populate `url` (the URL if present)
|
|
7
|
+
export declare const CLAIM_CANONICALIZATION_SYSTEM_PROMPT = "You merge raw claim mentions into a single canonical set of claims for an argument-ingestion pipeline.\n\nYou are given:\n- the raw input text (for full context)\n- the segmented breakdown of the text\n- the list of every claim mention extracted from those segments\n- optionally, the detected citation sources + axiom indicators\n\nYour output has two parts:\n\n1. `canonicalClaims` \u2014 an array of canonical claims, one entry per distinct proposition the author makes. Two mentions that assert the same proposition (even when phrased differently across the text) merge into a single canonical claim. Each canonical claim carries:\n - `miniId` \u2014 assign in canonicalization order: c1, c2, c3, ...\n - `mentionIds` \u2014 list of the mention ids that resolved to this claim\n - `type` \u2014 one of \"normal\", \"citation\", or \"axiomatic\" (see below)\n - `suggestedSymbol` \u2014 a short PascalCase-or-snake_case identifier summarizing the claim (e.g. \"Rain_Wets_Ground\", \"NASA_Temp_Rise\", \"Socrates_Mortal\"). Use letters, digits, and underscores only; start with a letter or underscore; keep under 32 characters; aim for under 20. AVOID single letters and generic names like \"Claim1\".\n - the extension fields described in your output schema (title, body, url, axiom \u2014 whichever apply to the claim's `type`)\n\n2. `mentionToClaim` \u2014 an array of `{ \"mentionId\": \"...\", \"claimMiniId\": \"...\" }` entries, one per input mention. Every input mentionId must appear in exactly one entry; the mapping is total. (We surface this as a list rather than a map because the response schema does not allow arbitrary string keys.)\n\n## Claim types\n\n- `\"normal\"` \u2014 a primary proposition the argument argues for or from.\n- `\"citation\"` \u2014 a claim whose content is \"the cited source asserts X\". Use this type when one of the citation sources covers the same span(s) as the mention. Populate `url` (the URL if present), `title` (a short human-readable label), and `citationTypeGuess` (your best guess at the source's IEEE reference type, chosen from the allowed values in your output schema \u2014 e.g. \"JournalArticle\", \"NewspaperArticle\", \"Book\", \"Website\", \"GovernmentPublication\", \u2026 \u2014 or \"unknown\" when no IEEE type fits or you cannot tell).\n- `\"axiomatic\"` \u2014 a claim invoked as self-evident truth. Use this type when an axiom indicator (e.g. \"by definition\") covers or precedes the mention. Populate `axiom` with the gist of the self-evident proposition.\n\nWhen a mention is the antecedent of \"according to X, P\", split it into two claims: a citation-typed claim for the source itself + a normal-typed claim for the proposition. The two are connected via a relation in a later stage, not here.\n\n## Style\n\n- Claim titles + bodies are written in third-person, present-tense, active voice.\n- State the proposition itself \u2014 never prepend an author-attributive reporting frame such as \"The author claims that\u2026\", \"The author argues\u2026\", \"The writer believes\u2026\", or \"According to the author\u2026\". Write *what is asserted*, not *that someone asserts it*: emit \"Rain wets the ground,\" not \"The author claims that rain wets the ground.\" This applies to the `title`, `body`, and `axiom` prose for the argument's own (normal / axiomatic) claims.\n- Titles are short (\u2264 50 characters); bodies fill in the detail.\n- For citation claims, the title summarizes what the source asserts (e.g. \"NASA reports temperature rise\"); the URL goes in `url`. This source attribution is intentional and is NOT removed by the rule above \u2014 that rule targets only author-attribution of the argument's own claims, never the cited-source framing of a citation claim.\n- For axiomatic claims, the `axiom` field captures the self-evident proposition as a bare declarative statement (e.g. \"A bachelor is an unmarried man by definition.\").\n\nOutput ONLY the schema-shaped object. No prose.";
|
|
8
8
|
/**
|
|
9
9
|
* Build the per-extension canonicalization output schema: an object of
|
|
10
10
|
* `canonicalClaims` (each carrying the canonicalizer fields merged with
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"claim-canonicalization.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/claim-canonicalization.ts"],"names":[],"mappings":"AAgBA,OAAa,EAAE,KAAK,OAAO,EAAE,MAAM,SAAS,CAAA;AAC5C,OAAO,EAMH,KAAK,4BAA4B,EACpC,MAAM,cAAc,CAAA;AAGrB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,KAAK,EACR,mBAAmB,EAEnB,wBAAwB,EAC3B,MAAM,aAAa,CAAA;AAEpB,eAAO,MAAM,4BAA4B,YAAY,CAAA;AACrD,eAAO,MAAM,gCAAgC,EACvC,SAAS,GACT,KAAK,GACL,QAAQ,GACR,MAAiB,CAAA;AAEvB,eAAO,MAAM,oCAAoC,
|
|
1
|
+
{"version":3,"file":"claim-canonicalization.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/claim-canonicalization.ts"],"names":[],"mappings":"AAgBA,OAAa,EAAE,KAAK,OAAO,EAAE,MAAM,SAAS,CAAA;AAC5C,OAAO,EAMH,KAAK,4BAA4B,EACpC,MAAM,cAAc,CAAA;AAGrB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,KAAK,EACR,mBAAmB,EAEnB,wBAAwB,EAC3B,MAAM,aAAa,CAAA;AAEpB,eAAO,MAAM,4BAA4B,YAAY,CAAA;AACrD,eAAO,MAAM,gCAAgC,EACvC,SAAS,GACT,KAAK,GACL,QAAQ,GACR,MAAiB,CAAA;AAEvB,eAAO,MAAM,oCAAoC,y5HAmCD,CAAA;AAEhD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,mBAAmB,GAAG,OAAO,CAc3E;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,OAAO,GAAG,OAAO,CA6CpE;AA+CD,mEAAmE;AACnE,eAAO,MAAM,qCAAqC,EAAE,wBAGnD,CAAA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,gCAAgC,CAC5C,SAAS,EAAE,mBAAmB,EAC9B,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,4BAA4B,CAAC,CAgBtC"}
|
|
@@ -41,7 +41,7 @@ Your output has two parts:
|
|
|
41
41
|
## Claim types
|
|
42
42
|
|
|
43
43
|
- \`"normal"\` — a primary proposition the argument argues for or from.
|
|
44
|
-
- \`"citation"\` — a claim whose content is "the cited source asserts X". Use this type when one of the citation sources covers the same span(s) as the mention. Populate \`url\` (the URL if present)
|
|
44
|
+
- \`"citation"\` — a claim whose content is "the cited source asserts X". Use this type when one of the citation sources covers the same span(s) as the mention. Populate \`url\` (the URL if present), \`title\` (a short human-readable label), and \`citationTypeGuess\` (your best guess at the source's IEEE reference type, chosen from the allowed values in your output schema — e.g. "JournalArticle", "NewspaperArticle", "Book", "Website", "GovernmentPublication", … — or "unknown" when no IEEE type fits or you cannot tell).
|
|
45
45
|
- \`"axiomatic"\` — a claim invoked as self-evident truth. Use this type when an axiom indicator (e.g. "by definition") covers or precedes the mention. Populate \`axiom\` with the gist of the self-evident proposition.
|
|
46
46
|
|
|
47
47
|
When a mention is the antecedent of "according to X, P", split it into two claims: a citation-typed claim for the source itself + a normal-typed claim for the proposition. The two are connected via a relation in a later stage, not here.
|
|
@@ -1,10 +1,10 @@
|
|
|
1
|
-
import { type TClaimTypeClassificationEntry, type TConclusionSelectionOutput, type
|
|
1
|
+
import { type TClaimTypeClassificationEntry, type TConclusionSelectionOutput, type TInferenceRelation } from "./schemas.js";
|
|
2
2
|
import type { TStage } from "../../../../lib/pipelines/types.js";
|
|
3
3
|
import type { TLlmStageOptionsOverride } from "../types.js";
|
|
4
4
|
export declare const CONCLUSION_SELECTION_MODEL = "gpt-5.5";
|
|
5
5
|
export declare const CONCLUSION_SELECTION_REASONING: "minimal" | "low" | "medium" | "high";
|
|
6
6
|
export declare const CONCLUSION_SELECTION_NO_CONCLUSION_FAILURE_CODE = "NO_SINGLE_CONCLUSION";
|
|
7
|
-
export declare const CONCLUSION_SELECTION_SYSTEM_PROMPT = "You select the conclusion claim of an argument from the canonical claim set and the relation graph.\n\nYou receive:\n- the per-claim type map (normal / citation / axiomatic)\n- the
|
|
7
|
+
export declare const CONCLUSION_SELECTION_SYSTEM_PROMPT = "You select the conclusion claim of an argument from the canonical claim set and the relation graph.\n\nYou receive:\n- the per-claim type map (normal / citation / axiomatic)\n- the inference relation graph from `relation-extraction` (each relation's antecedents jointly imply its consequent)\n\nEmit:\n- `conclusionCandidates` \u2014 an array of canonical claim miniIds ordered by DECREASING confidence: the first element is your single best pick for the conclusion. Return exactly one when the conclusion is clear; return several (best first) only when multiple claims are genuinely plausible conclusions. Return an empty array ONLY when the input has no argument structure at all.\n- `rationale` \u2014 a one-sentence explanation of your ordering and best pick (or, for an empty array, why no claim is a conclusion)\n\n## Selection rules\n\n1. The conclusion is the claim that no other claim is meant to support but is itself the terminus of one or more support edges. In a clean argument it's the \"therefore X\" claim \u2014 list it first.\n2. When several distinct claims are each terminal and plausibly the point, include them all, ordered best first. Do not abstain just because more than one is plausible.\n3. Citation-typed and axiomatic-typed claims are never conclusions \u2014 never include them as candidates; they are always sources of support.\n4. If no claim is supported by any relation (a single-statement input), return an empty array; there is no argument to select a conclusion from.\n\nAlways name your best candidate first rather than abstaining. Only an input with no argument structure yields an empty array.";
|
|
8
8
|
/** Internal default knobs for the conclusion-selection stage. */
|
|
9
9
|
export declare const CONCLUSION_SELECTION_STAGE_DEFAULTS: TLlmStageOptionsOverride;
|
|
10
10
|
/**
|
|
@@ -24,7 +24,7 @@ export declare const CONCLUSION_SELECTION_STAGE_DEFAULTS: TLlmStageOptionsOverri
|
|
|
24
24
|
* slot — keeping the resolved `conclusionMiniId` contract uniform
|
|
25
25
|
* across pipelines.
|
|
26
26
|
*/
|
|
27
|
-
export declare function selectFallbackConclusion(classifications: readonly TClaimTypeClassificationEntry[], relations: readonly
|
|
27
|
+
export declare function selectFallbackConclusion(classifications: readonly TClaimTypeClassificationEntry[], relations: readonly TInferenceRelation[]): string | null;
|
|
28
28
|
/**
|
|
29
29
|
* Build the conclusion-selection stage with optional caller overrides.
|
|
30
30
|
* The inner `llmStage` asks the model for a confidence-ranked
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"conclusion-selection.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/conclusion-selection.ts"],"names":[],"mappings":"AAgBA,OAAO,EAIH,KAAK,6BAA6B,EAGlC,KAAK,0BAA0B,EAC/B,KAAK,
|
|
1
|
+
{"version":3,"file":"conclusion-selection.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/conclusion-selection.ts"],"names":[],"mappings":"AAgBA,OAAO,EAIH,KAAK,6BAA6B,EAGlC,KAAK,0BAA0B,EAC/B,KAAK,kBAAkB,EAE1B,MAAM,cAAc,CAAA;AAErB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAA;AAE3D,eAAO,MAAM,0BAA0B,YAAY,CAAA;AACnD,eAAO,MAAM,8BAA8B,EACrC,SAAS,GACT,KAAK,GACL,QAAQ,GACR,MAAiB,CAAA;AAEvB,eAAO,MAAM,+CAA+C,yBAClC,CAAA;AAE1B,eAAO,MAAM,kCAAkC,smDAiB+E,CAAA;AA8B9H,iEAAiE;AACjE,eAAO,MAAM,mCAAmC,EAAE,wBAGjD,CAAA;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,wBAAwB,CACpC,eAAe,EAAE,SAAS,6BAA6B,EAAE,EACzD,SAAS,EAAE,SAAS,kBAAkB,EAAE,GACzC,MAAM,GAAG,IAAI,CA4Cf;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,8BAA8B,CAC1C,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,0BAA0B,CAAC,CAqEpC;AAED,iDAAiD;AACjD,eAAO,MAAM,wBAAwB,EAAE,MAAM,CAAC,0BAA0B,CACpC,CAAA"}
|
|
@@ -22,7 +22,7 @@ export const CONCLUSION_SELECTION_SYSTEM_PROMPT = `You select the conclusion cla
|
|
|
22
22
|
|
|
23
23
|
You receive:
|
|
24
24
|
- the per-claim type map (normal / citation / axiomatic)
|
|
25
|
-
- the
|
|
25
|
+
- the inference relation graph from \`relation-extraction\` (each relation's antecedents jointly imply its consequent)
|
|
26
26
|
|
|
27
27
|
Emit:
|
|
28
28
|
- \`conclusionCandidates\` — an array of canonical claim miniIds ordered by DECREASING confidence: the first element is your single best pick for the conclusion. Return exactly one when the conclusion is clear; return several (best first) only when multiple claims are genuinely plausible conclusions. Return an empty array ONLY when the input has no argument structure at all.
|
|
@@ -46,7 +46,7 @@ function buildPrompt(ctx) {
|
|
|
46
46
|
.join("\n");
|
|
47
47
|
const relationLines = relations.length > 0
|
|
48
48
|
? relations
|
|
49
|
-
.map((r) => ` [${r.relationId}]
|
|
49
|
+
.map((r) => ` [${r.relationId}] antecedents=[${r.antecedents.join(",")}] consequent=${r.consequent}`)
|
|
50
50
|
.join("\n")
|
|
51
51
|
: " (no relations)";
|
|
52
52
|
const markedSystem = `<!-- stage-id: ${STAGE_IDS.conclusionSelection} -->\n${CONCLUSION_SELECTION_SYSTEM_PROMPT}`;
|
|
@@ -90,9 +90,9 @@ export function selectFallbackConclusion(classifications, relations) {
|
|
|
90
90
|
const sourceMiniIds = new Set();
|
|
91
91
|
const inDegree = new Map();
|
|
92
92
|
for (const relation of relations) {
|
|
93
|
-
for (const
|
|
94
|
-
sourceMiniIds.add(
|
|
95
|
-
inDegree.set(relation.
|
|
93
|
+
for (const antecedent of relation.antecedents)
|
|
94
|
+
sourceMiniIds.add(antecedent);
|
|
95
|
+
inDegree.set(relation.consequent, (inDegree.get(relation.consequent) ?? 0) + 1);
|
|
96
96
|
}
|
|
97
97
|
const supportedNormals = [...inDegree.keys()].filter((miniId) => normalMiniIds.has(miniId));
|
|
98
98
|
const pureSinks = supportedNormals.filter((miniId) => !sourceMiniIds.has(miniId));
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"conclusion-selection.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/conclusion-selection.ts"],"names":[],"mappings":"AAAA,oEAAoE;AACpE,wEAAwE;AACxE,sEAAsE;AACtE,wEAAwE;AACxE,iEAAiE;AACjE,qEAAqE;AACrE,yEAAyE;AACzE,sEAAsE;AACtE,uDAAuD;AACvD,wEAAwE;AACxE,gEAAgE;AAChE,wEAAwE;AACxE,2CAA2C;AAC3C,EAAE;AACF,0EAA0E;AAE1E,OAAO,EACH,SAAS,EACT,kCAAkC,EAClC,+BAA+B,GAOlC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AAIrE,MAAM,CAAC,MAAM,0BAA0B,GAAG,SAAS,CAAA;AACnD,MAAM,CAAC,MAAM,8BAA8B,GAI5B,QAAQ,CAAA;AAEvB,MAAM,CAAC,MAAM,+CAA+C,GACxD,sBAAsB,CAAA;AAE1B,MAAM,CAAC,MAAM,kCAAkC,GAAG;;;;;;;;;;;;;;;;;8HAiB4E,CAAA;AAE9H,SAAS,WAAW,CAAC,GAAkB;IACnC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,eAAe,GAAG,YAAY,EAAE,eAAe,IAAI,EAAE,CAAA;IAC3D,MAAM,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAC5B,SAAS,CAAC,kBAAkB,CAC/B,CAAA;IACD,MAAM,SAAS,GAAG,gBAAgB,EAAE,SAAS,IAAI,EAAE,CAAA;IAEnD,MAAM,SAAS,GAAG,eAAe;SAC5B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,MAAM,UAAU,KAAK,CAAC,IAAI,EAAE,CAAC;SACxD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,aAAa,GACf,SAAS,CAAC,MAAM,GAAG,CAAC;QAChB,CAAC,CAAC,SAAS;aACJ,GAAG,CACA,CAAC,CAAC,EAAE,EAAE,CACF,MAAM,CAAC,CAAC,UAAU,
|
|
1
|
+
{"version":3,"file":"conclusion-selection.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/conclusion-selection.ts"],"names":[],"mappings":"AAAA,oEAAoE;AACpE,wEAAwE;AACxE,sEAAsE;AACtE,wEAAwE;AACxE,iEAAiE;AACjE,qEAAqE;AACrE,yEAAyE;AACzE,sEAAsE;AACtE,uDAAuD;AACvD,wEAAwE;AACxE,gEAAgE;AAChE,wEAAwE;AACxE,2CAA2C;AAC3C,EAAE;AACF,0EAA0E;AAE1E,OAAO,EACH,SAAS,EACT,kCAAkC,EAClC,+BAA+B,GAOlC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AAIrE,MAAM,CAAC,MAAM,0BAA0B,GAAG,SAAS,CAAA;AACnD,MAAM,CAAC,MAAM,8BAA8B,GAI5B,QAAQ,CAAA;AAEvB,MAAM,CAAC,MAAM,+CAA+C,GACxD,sBAAsB,CAAA;AAE1B,MAAM,CAAC,MAAM,kCAAkC,GAAG;;;;;;;;;;;;;;;;;8HAiB4E,CAAA;AAE9H,SAAS,WAAW,CAAC,GAAkB;IACnC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,eAAe,GAAG,YAAY,EAAE,eAAe,IAAI,EAAE,CAAA;IAC3D,MAAM,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAC5B,SAAS,CAAC,kBAAkB,CAC/B,CAAA;IACD,MAAM,SAAS,GAAG,gBAAgB,EAAE,SAAS,IAAI,EAAE,CAAA;IAEnD,MAAM,SAAS,GAAG,eAAe;SAC5B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,MAAM,UAAU,KAAK,CAAC,IAAI,EAAE,CAAC;SACxD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,aAAa,GACf,SAAS,CAAC,MAAM,GAAG,CAAC;QAChB,CAAC,CAAC,SAAS;aACJ,GAAG,CACA,CAAC,CAAC,EAAE,EAAE,CACF,MAAM,CAAC,CAAC,UAAU,kBAAkB,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,UAAU,EAAE,CAChG;aACA,IAAI,CAAC,IAAI,CAAC;QACjB,CAAC,CAAC,kBAAkB,CAAA;IAE5B,MAAM,YAAY,GAAG,kBAAkB,SAAS,CAAC,mBAAmB,SAAS,kCAAkC,EAAE,CAAA;IACjH,MAAM,IAAI,GAAG,qBAAqB,SAAS,mBAAmB,aAAa,mGAAmG,CAAA;IAC9K,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAA;AACzC,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,mCAAmC,GAA6B;IACzE,KAAK,EAAE,0BAA0B;IACjC,eAAe,EAAE,8BAA8B;CAClD,CAAA;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,wBAAwB,CACpC,eAAyD,EACzD,SAAwC;IAExC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAEvC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC/C,eAAe,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACrC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACnC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;IACL,CAAC,CAAC,CAAA;IACF,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,eAAe;SACV,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;SAC1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CACpC,CAAA;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAC/B,KAAK,MAAM,UAAU,IAAI,QAAQ,CAAC,WAAW;YACzC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACjC,QAAQ,CAAC,GAAG,CACR,QAAQ,CAAC,UAAU,EACnB,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAC/C,CAAA;IACL,CAAC;IAED,MAAM,gBAAgB,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAC5D,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAC5B,CAAA;IACD,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CACrC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CACzC,CAAA;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAA;IAChE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAElC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;QAChC,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,MAAM,GAAG,UAAU;YAAE,OAAO,MAAM,CAAA;QACtC,IAAI,MAAM,GAAG,UAAU;YAAE,OAAO,IAAI,CAAA;QACpC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAA;QACpE,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAA;QAClE,OAAO,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAA;IAC5C,CAAC,CAAC,CAAA;AACN,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,8BAA8B,CAC1C,OAAkC;IAElC,MAAM,UAAU,GAAG,QAAQ,CAAgC;QACvD,EAAE,EAAE,SAAS,CAAC,mBAAmB;QACjC,SAAS,EAAE;YACP,SAAS,CAAC,uBAAuB;YACjC,SAAS,CAAC,kBAAkB;SAC/B;QACD,YAAY,EAAE,kCAAkC;QAChD,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,0BAA0B;QACnD,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,eAAe,EACX,OAAO,EAAE,eAAe,IAAI,8BAA8B;QAC9D,KAAK,EAAE,OAAO,EAAE,KAAK;QACrB,WAAW;KACd,CAAC,CAAA;IACF,OAAO;QACH,EAAE,EAAE,UAAU,CAAC,EAAE;QACjB,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,YAAY,EAAE,+BAA+B;QAC7C,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;YACf,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC3C,MAAM,eAAe,GACjB,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,uBAAuB,CACpC,EAAE,eAAe,IAAI,EAAE,CAAA;YAC5B,MAAM,SAAS,GACX,GAAG,CAAC,GAAG,CAA4B,SAAS,CAAC,kBAAkB,CAAC;gBAC5D,EAAE,SAAS,IAAI,EAAE,CAAA;YAEzB,yDAAyD;YACzD,6DAA6D;YAC7D,4DAA4D;YAC5D,4CAA4C;YAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,eAAe;iBACV,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;iBAC1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CACpC,CAAA;YACD,MAAM,SAAS,GACX,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAC3C,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAC5B,IAAI,IAAI,CAAA;YACb,MAAM,gBAAgB,GAClB,SAAS;gBACT,wBAAwB,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;YACxD,MAAM,iBAAiB,GACnB,SAAS,KAAK,IAAI,IAAI,gBAAgB,KAAK,IAAI,CAAA;YAEnD,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;gBAC5B,GAAG,CAAC,UAAU,CAAC;oBACX,IAAI,EAAE,+CAA+C;oBACrD,OAAO,EACH,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;wBAC1B,CAAC,CAAC,SAAS,CAAC,SAAS;wBACrB,CAAC,CAAC,yCAAyC;oBACnD,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE;iBAC9C,CAAC,CAAA;YACN,CAAC;YAED,OAAO;gBACH,gBAAgB;gBAChB,oBAAoB,EAAE,SAAS,CAAC,oBAAoB;gBACpD,SAAS,EAAE,iBAAiB;oBACxB,CAAC,CAAC,iBAAiB,gBAAgB,iEAAiE;oBACpG,CAAC,CAAC,SAAS,CAAC,SAAS;aAC5B,CAAA;QACL,CAAC;KACJ,CAAA;AACL,CAAC;AAED,iDAAiD;AACjD,MAAM,CAAC,MAAM,wBAAwB,GACjC,8BAA8B,EAAE,CAAA"}
|
|
@@ -1,27 +1,82 @@
|
|
|
1
|
-
import { type TConclusionSelectionOutput, type TFormulaCompilationOutput, type
|
|
1
|
+
import { type TClaimTypeClassificationEntry, type TConclusionSelectionOutput, type TFormulaCompilationOutput, type TInferenceRelation, type TVariableAssignmentOutput } from "./schemas.js";
|
|
2
2
|
import type { TStage } from "../../../../lib/pipelines/types.js";
|
|
3
3
|
export declare const FORMULA_COMPILATION_FAILURE_CODES: {
|
|
4
|
-
readonly
|
|
5
|
-
readonly
|
|
4
|
+
readonly unresolvedAntecedent: "FORMULA_COMPILATION_ANTECEDENT_UNRESOLVED";
|
|
5
|
+
readonly unresolvedConsequent: "FORMULA_COMPILATION_CONSEQUENT_UNRESOLVED";
|
|
6
6
|
readonly unresolvedConclusion: "FORMULA_COMPILATION_CONCLUSION_UNRESOLVED";
|
|
7
|
-
readonly
|
|
7
|
+
readonly emptyAntecedents: "FORMULA_COMPILATION_ANTECEDENTS_EMPTY";
|
|
8
8
|
};
|
|
9
|
+
export declare const RELATION_PLACEMENT_FAILURE_CODES: {
|
|
10
|
+
readonly droppedTypedConsequent: "RELATION_PLACEMENT_DROPPED_TYPED_CONSEQUENT";
|
|
11
|
+
readonly droppedUnresolvedClaim: "RELATION_PLACEMENT_DROPPED_UNRESOLVED_CLAIM";
|
|
12
|
+
readonly droppedEmptyAntecedents: "RELATION_PLACEMENT_DROPPED_EMPTY_ANTECEDENTS";
|
|
13
|
+
};
|
|
14
|
+
type TAddFailure = (failure: {
|
|
15
|
+
code: string;
|
|
16
|
+
message: string;
|
|
17
|
+
severity: "warning" | "error";
|
|
18
|
+
context?: Record<string, unknown>;
|
|
19
|
+
}) => void;
|
|
20
|
+
/**
|
|
21
|
+
* Resolve each claim's effective type into a `miniId → type` map,
|
|
22
|
+
* preferring the `claim-type-classification` entry and falling back to the
|
|
23
|
+
* canonicalizer's drafted `type`. This is the SAME resolution
|
|
24
|
+
* `finalizeResponseV2` uses, so the sort and finalize never disagree on
|
|
25
|
+
* whether a claim is citation/axiomatic — a disagreement is exactly what
|
|
26
|
+
* would let a citation slip into a freeform premise.
|
|
27
|
+
*/
|
|
28
|
+
export declare function resolveClaimTypes(input: {
|
|
29
|
+
classifications: TClaimTypeClassificationEntry[];
|
|
30
|
+
canonicalClaims: {
|
|
31
|
+
miniId: string;
|
|
32
|
+
type: TClaimTypeClassificationEntry["type"];
|
|
33
|
+
}[];
|
|
34
|
+
}): Map<string, TClaimTypeClassificationEntry["type"]>;
|
|
35
|
+
/**
|
|
36
|
+
* A freeform relation after the citation/axiomatic sort: only normal
|
|
37
|
+
* antecedents remain.
|
|
38
|
+
*/
|
|
39
|
+
export type TFreeformRelation = {
|
|
40
|
+
relationId: string;
|
|
41
|
+
antecedents: string[];
|
|
42
|
+
consequent: string;
|
|
43
|
+
};
|
|
44
|
+
export type TSortInferenceRelationsResult = {
|
|
45
|
+
freeformRelations: TFreeformRelation[];
|
|
46
|
+
/** consequent claim miniId → its citation/axiomatic supporting claim miniIds. */
|
|
47
|
+
derivationBacking: Map<string, string[]>;
|
|
48
|
+
};
|
|
49
|
+
/**
|
|
50
|
+
* Deterministically sort inference relations into freeform premises and
|
|
51
|
+
* derivation backing. For each relation:
|
|
52
|
+
* - drop (warn) if the consequent is citation/axiomatic — a typed claim
|
|
53
|
+
* cannot be the consequent of an implication;
|
|
54
|
+
* - dedupe antecedents and drop a self-referential antecedent;
|
|
55
|
+
* - drop (warn) the whole relation if any antecedent's type can't be
|
|
56
|
+
* resolved — never silently treat an unresolved id as `normal`;
|
|
57
|
+
* - route citation/axiomatic antecedents into `derivationBacking`;
|
|
58
|
+
* - keep the normal antecedents as the freeform implication; if none
|
|
59
|
+
* remain, the relation is fully captured by the backing and yields no
|
|
60
|
+
* freeform premise.
|
|
61
|
+
*/
|
|
62
|
+
export declare function sortInferenceRelations(input: {
|
|
63
|
+
relations: TInferenceRelation[];
|
|
64
|
+
typeByClaimMiniId: Map<string, TClaimTypeClassificationEntry["type"]>;
|
|
65
|
+
addFailure?: TAddFailure;
|
|
66
|
+
}): TSortInferenceRelationsResult;
|
|
9
67
|
export type TCompileFormulasInput = {
|
|
10
|
-
|
|
11
|
-
relations: TRelationExtractionOutput["relations"];
|
|
68
|
+
freeformRelations: TFreeformRelation[];
|
|
12
69
|
conclusion: TConclusionSelectionOutput | undefined;
|
|
13
70
|
variables: TVariableAssignmentOutput;
|
|
14
71
|
generateId: () => string;
|
|
15
|
-
addFailure?:
|
|
16
|
-
code: string;
|
|
17
|
-
message: string;
|
|
18
|
-
severity: "warning" | "error";
|
|
19
|
-
context?: Record<string, unknown>;
|
|
20
|
-
}) => void;
|
|
72
|
+
addFailure?: TAddFailure;
|
|
21
73
|
};
|
|
22
74
|
/**
|
|
23
|
-
*
|
|
75
|
+
* Compile freeform relations into premise formulas, and mint the
|
|
76
|
+
* conclusion premise. Pure helper exposed for direct testing. The stage's
|
|
77
|
+
* `derivationBacking` is added by the stage wrapper, not here.
|
|
24
78
|
*/
|
|
25
|
-
export declare function compileFormulas(input: TCompileFormulasInput): TFormulaCompilationOutput
|
|
79
|
+
export declare function compileFormulas(input: TCompileFormulasInput): Omit<TFormulaCompilationOutput, "derivationBacking">;
|
|
26
80
|
export declare const formulaCompilationStage: TStage<TFormulaCompilationOutput>;
|
|
81
|
+
export {};
|
|
27
82
|
//# sourceMappingURL=formula-compilation.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"formula-compilation.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/formula-compilation.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"formula-compilation.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/formula-compilation.ts"],"names":[],"mappings":"AA2BA,OAAO,EAIH,KAAK,6BAA6B,EAElC,KAAK,0BAA0B,EAC/B,KAAK,yBAAyB,EAC9B,KAAK,kBAAkB,EAEvB,KAAK,yBAAyB,EACjC,MAAM,cAAc,CAAA;AAErB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAE/E,eAAO,MAAM,iCAAiC;;;;;CAKpC,CAAA;AASV,eAAO,MAAM,gCAAgC;;;;CAInC,CAAA;AAEV,KAAK,WAAW,GAAG,CAAC,OAAO,EAAE;IACzB,IAAI,EAAE,MAAM,CAAA;IACZ,OAAO,EAAE,MAAM,CAAA;IACf,QAAQ,EAAE,SAAS,GAAG,OAAO,CAAA;IAC7B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACpC,KAAK,IAAI,CAAA;AAEV;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE;IACrC,eAAe,EAAE,6BAA6B,EAAE,CAAA;IAChD,eAAe,EAAE;QACb,MAAM,EAAE,MAAM,CAAA;QACd,IAAI,EAAE,6BAA6B,CAAC,MAAM,CAAC,CAAA;KAC9C,EAAE,CAAA;CACN,GAAG,GAAG,CAAC,MAAM,EAAE,6BAA6B,CAAC,MAAM,CAAC,CAAC,CASrD;AAED;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC5B,UAAU,EAAE,MAAM,CAAA;IAClB,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,UAAU,EAAE,MAAM,CAAA;CACrB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG;IACxC,iBAAiB,EAAE,iBAAiB,EAAE,CAAA;IACtC,iFAAiF;IACjF,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;CAC3C,CAAA;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE;IAC1C,SAAS,EAAE,kBAAkB,EAAE,CAAA;IAC/B,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,6BAA6B,CAAC,MAAM,CAAC,CAAC,CAAA;IACrE,UAAU,CAAC,EAAE,WAAW,CAAA;CAC3B,GAAG,6BAA6B,CA+FhC;AAED,MAAM,MAAM,qBAAqB,GAAG;IAChC,iBAAiB,EAAE,iBAAiB,EAAE,CAAA;IACtC,UAAU,EAAE,0BAA0B,GAAG,SAAS,CAAA;IAClD,SAAS,EAAE,yBAAyB,CAAA;IACpC,UAAU,EAAE,MAAM,MAAM,CAAA;IACxB,UAAU,CAAC,EAAE,WAAW,CAAA;CAC3B,CAAA;AAYD;;;;GAIG;AACH,wBAAgB,eAAe,CAC3B,KAAK,EAAE,qBAAqB,GAC7B,IAAI,CAAC,yBAAyB,EAAE,mBAAmB,CAAC,CAyFtD;AAED,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,yBAAyB,CAuDhE,CAAA"}
|