@gobing-ai/knowledge-kit 0.0.28 → 0.0.30

package/plugins/generations/dailynews-gen/src/script-builder.ts

@@ -313,11 +313,13 @@ export function buildNewsVoiceScript(docs: Doc[], options?: ScriptBuilderOptions
     const dateStr = formatBroadcastDate(broadcastDate, language);
 
     if (docs.length === 0) {
-        const title = options?.title || (isZh ? '今日AI科技漫谈（暂无更新）' : 'AI Daily Briefing (No Updates)');
+        const title = options?.title || (isZh ? 'AI 乱炖（暂无更新）' : 'AI 乱炖 (No Updates)');
         const segments: VoiceScriptSegment[] = isZh
             ? [
                   {
-                      text: `大家好，今天是${dateStr}。欢迎收听由${voiceProfile}为您带来的今日AI科技漫谈。今天科技圈暂无最新的精选动态。`,
+                      // Task 0189 R1/R4: honest no-content episode — the copy names the show
+                      // (咸话咸说) and the column (AI 乱炖), and never claims a news digest happened.
+                      text: `大家好，今天是${dateStr}。欢迎收听「咸话咸说」的「AI 乱炖」栏目，我是${voiceProfile}。今天没有足够扎实的可聊内容。`,
                       gap_ms: 400,
                       emotion: 'calm',
                   },
@@ -329,7 +331,7 @@ export function buildNewsVoiceScript(docs: Doc[], options?: ScriptBuilderOptions
               ]
             : [
                   {
-                      text: `Hello and welcome. Today is ${dateStr}. This is ${voiceProfile} with your AI Daily Briefing. There are no new featured stories today.`,
+                      text: `Hello and welcome. Today is ${dateStr}. This is ${voiceProfile} with AI 乱炖, our chat about AI tools, papers, and hands-on practice. There is nothing solid enough to share today.`,
                       gap_ms: 400,
                       emotion: 'calm',
                   },
@@ -352,9 +354,7 @@ export function buildNewsVoiceScript(docs: Doc[], options?: ScriptBuilderOptions
         });
     }
 
-    const title =
-        options?.title ||
-        (isZh ? `今日AI科技漫谈（共${docs.length}条）` : `AI Daily Briefing (${docs.length} stories)`);
+    const title = options?.title || (isZh ? `AI 乱炖（共${docs.length}条）` : `AI 乱炖 (${docs.length} stories)`);
     const segments: VoiceScriptSegment[] = [];
 
     let hostName =
@@ -382,9 +382,10 @@ export function buildNewsVoiceScript(docs: Doc[], options?: ScriptBuilderOptions
         ? scriptPlan
             ? // F613: fixed greeting stays builder-owned; the plan only fills the slot between
               // greeting and first story (the template tail 从「今天科技圈有几条…正题。」 is replaced).
-              `大家好，今天是${dateStr}，欢迎收听由${hostName}为您带来的今日AI科技漫谈。${scriptPlan.intro}`
-            : `大家好，今天是${dateStr}，欢迎收听由${hostName}为您带来的今日AI科技漫谈。今天科技圈有几条非常有看点的大消息，我精选了${countText}最值得关注的重点动态来和大家聊一聊${titlesSummary ? `，包括${titlesSummary}` : ''}。话不多说，我们马上进入今天的正题。`
-        : `Hello and welcome. Today is ${dateStr}. This is ${hostName} with your AI Daily Briefing. In today's episode, we have ${countText} fascinating stories from the AI world. Let's dive straight in.`;
+              // Task 0189 R1: the greeting names the show (咸话咸说) and the column (AI 乱炖).
+              `大家好，今天是${dateStr}，欢迎收听「咸话咸说」的「AI 乱炖」栏目，我是${hostName}。${scriptPlan.intro}`
+            : `大家好，今天是${dateStr}，欢迎收听「咸话咸说」的「AI 乱炖」栏目，我是${hostName}。今天我从 AI 工具、论文和实践中整理了${countText}值得聊的内容${titlesSummary ? `，包括${titlesSummary}` : ''}，咱们一条条来聊。`
+        : `Hello and welcome. Today is ${dateStr}. This is ${hostName} with AI 乱炖, where we talk about AI tools, papers, and hands-on practice. In today's episode, we have ${countText} stories. Let's dive straight in.`;
 
     segments.push({
         text: normalizeBroadcastText(introText, isZh),
@@ -449,11 +450,13 @@ export function buildNewsVoiceScript(docs: Doc[], options?: ScriptBuilderOptions
 
     // 3. Outro segment: Warm, conversational wrap-up. F613: the plan outro replaces the template
     // wrap-up head; the fixed sign-off stays builder-owned.
+    // Task 0189 R1: the AI-voice disclosure is part of the builder-owned sign-off (not the plan),
+    // so it is spoken in every episode — Apple Podcasts guideline 1.11 requires it in the content.
     const outroText = isZh
         ? scriptPlan
-            ? `${scriptPlan.outro}感谢您的收听，我是${hostName}，祝您拥有充实高效的一天，我们下期节目不见不散！`
-            : `好了，以上就是今天AI科技漫谈的全部内容。不知道今天这几条消息有没有给您带来一些新的启发？感谢您的收听，我是${hostName}，祝您拥有充实高效的一天，我们下期节目不见不散！`
-        : `That wraps up today's AI Daily Briefing. I hope today's highlights gave you some useful takeaways. Thank you for listening. This is ${hostName}, wishing you a productive and wonderful day. Until next time!`;
+            ? `${scriptPlan.outro}本期音频为 AI 合成配音。感谢您的收听，我是${hostName}，祝您拥有充实高效的一天，我们下期节目不见不散！`
+            : `好了，本期AI乱炖就聊到这里。希望今天这些工具、论文和实践的经验对您有启发。本期音频为 AI 合成配音。感谢您的收听，我是${hostName}，祝您拥有充实高效的一天，我们下期节目不见不散！`
+        : `That wraps up this episode of AI 乱炖. I hope today's takeaways were useful. The audio in this episode is AI-synthesized. Thank you for listening. This is ${hostName}, wishing you a productive and wonderful day. Until next time!`;
 
     segments.push({
         text: normalizeBroadcastText(outroText, isZh),

package/plugins/generations/dailynews-gen/src/script-plan.ts

@@ -12,6 +12,12 @@ export interface ScriptPlan {
     intro: string;
     outro: string;
     items: { id: string; lead: string; insight: string }[];
+    /**
+     * Docs deliberately not spoken (topic-boundary exclusions, task 0189). An id here is
+     * exempt from `missing-item`; listing an id in both `items` and `excluded` is a
+     * `conflict-id` error, and an unknown id is `unknown-id` like any plan item.
+     */
+    excluded?: { id: string; reason: string }[];
 }
 
 /**
@@ -41,11 +47,17 @@ const ScriptPlanItemSchema = z.object({
     insight: z.string().min(1),
 });
 
+const ScriptPlanExclusionSchema = z.object({
+    id: z.string().min(1),
+    reason: z.string().min(1),
+});
+
 const ScriptPlanSchema = z.object({
     version: z.literal(1),
     intro: z.string().min(1),
     outro: z.string().min(1),
     items: z.array(ScriptPlanItemSchema),
+    excluded: z.array(ScriptPlanExclusionSchema).optional(),
 });
 
 const StyleContractSchema = z.object({
@@ -86,8 +98,9 @@ export function parseStyleContract(markdown: string): StyleContract {
  * one warn line names every violation, so a rejected plan is diagnosable in one read:
  *
  * - `schema`: wrong shape or version (`itemId: episode`)
- * - `unknown-id`: a plan item id that is not a doc
- * - `missing-item`: a doc with no plan item
+ * - `unknown-id`: a plan item (or exclusion) id that is not a doc
+ * - `missing-item`: a doc with no plan item and no exclusion
+ * - `conflict-id`: an id listed in both `items` and `excluded`
  * - `cap:<field>`: a field over its cap (`intro`/`outro` report `itemId: episode`)
  * - `banned:<phrase>`: a field containing a banned phrase
  * - `duplicate-insight`: the same insight text on two items in one episode
@@ -107,8 +120,13 @@ export function validateScriptPlan(plan: unknown, docs: Doc[], style: StyleContr
         if (!docIds.has(item.id)) errors.push({ itemId: item.id, rule: 'unknown-id' });
     }
     const plannedIds = new Set(valid.items.map((item) => item.id));
+    const excludedIds = new Set((valid.excluded ?? []).map((ex) => ex.id));
+    for (const ex of valid.excluded ?? []) {
+        if (!docIds.has(ex.id)) errors.push({ itemId: ex.id, rule: 'unknown-id' });
+        if (plannedIds.has(ex.id)) errors.push({ itemId: ex.id, rule: 'conflict-id' });
+    }
     for (const doc of docs) {
-        if (!plannedIds.has(doc.id)) errors.push({ itemId: doc.id, rule: 'missing-item' });
+        if (!plannedIds.has(doc.id) && !excludedIds.has(doc.id)) errors.push({ itemId: doc.id, rule: 'missing-item' });
     }
 
     if (valid.intro.length > style.caps.intro) errors.push({ itemId: 'episode', rule: 'cap:intro' });

package/plugins/generations/episode-plan-gen/dist/index.js

@@ -22430,7 +22430,8 @@ var DEFAULT_FILTER_CONFIG = {
   minQuality: 2,
   minImportance: 3,
   minUrgency: 2,
-  minImpact: 1
+  minImpact: 1,
+  minEpisodeItems: 8
 };
 function parseFilterThreshold(raw, name, fallback) {
   if (raw === undefined || raw.trim() === "")
@@ -22443,6 +22444,17 @@ function parseFilterThreshold(raw, name, fallback) {
     throw new Error(`${name}=${parsed} is outside 0\u20135 (fail loud, no clamping)`);
   return parsed;
 }
+function parseFloorCount(raw, name, fallback) {
+  if (raw === undefined || raw.trim() === "")
+    return fallback;
+  const value = raw.trim();
+  if (!/^\d+$/.test(value))
+    throw new Error(`${name}='${raw}' is not a positive integer (fail loud, no clamping)`);
+  const parsed = Number.parseInt(value, 10);
+  if (parsed < 1)
+    throw new Error(`${name}=${parsed} must be >= 1 (a 0 floor disables the gate \u2014 drop the env instead)`);
+  return parsed;
+}
 function parseFilterCategories(raw) {
   if (raw === undefined || raw.trim() === "")
     return [...DEFAULT_FILTER_CONFIG.categories];
@@ -22460,7 +22472,8 @@ function filterConfigFromEnv(env2 = process.env) {
     minQuality: parseFilterThreshold(env2.QC_MIN_QUALITY, "QC_MIN_QUALITY", DEFAULT_FILTER_CONFIG.minQuality),
     minImportance: parseFilterThreshold(env2.QC_MIN_IMPORTANCE, "QC_MIN_IMPORTANCE", DEFAULT_FILTER_CONFIG.minImportance),
     minUrgency: parseFilterThreshold(env2.QC_MIN_URGENCY, "QC_MIN_URGENCY", DEFAULT_FILTER_CONFIG.minUrgency),
-    minImpact: parseFilterThreshold(env2.QC_MIN_IMPACT, "QC_MIN_IMPACT", DEFAULT_FILTER_CONFIG.minImpact)
+    minImpact: parseFilterThreshold(env2.QC_MIN_IMPACT, "QC_MIN_IMPACT", DEFAULT_FILTER_CONFIG.minImpact),
+    minEpisodeItems: parseFloorCount(env2.QC_MIN_EPISODE_ITEMS, "QC_MIN_EPISODE_ITEMS", DEFAULT_FILTER_CONFIG.minEpisodeItems)
   };
 }
 function requireAnnotation(doc2) {
@@ -22505,6 +22518,39 @@ function filterAnnotated(docs, config3) {
   }
   return { kept, rejected };
 }
+function importanceOf(doc2) {
+  const scores = asRecord(asRecord(doc2.metadata).scores);
+  return typeof scores.importance === "number" ? scores.importance : 0;
+}
+function planScoreOf(doc2) {
+  const value = asRecord(doc2.metadata).planScore;
+  return typeof value === "number" ? value : 0;
+}
+function backfillToFloor(kept, rejected, config3) {
+  if (kept.length >= config3.minEpisodeItems)
+    return { kept, rejected, admitted: [] };
+  const eligible = rejected.map((entry, index) => ({ entry, index })).filter(({ entry }) => entry.reasons.length > 0 && entry.reasons.every((r) => r.startsWith("importance:")));
+  eligible.sort((a, b) => {
+    const byImportance = importanceOf(b.entry.doc) - importanceOf(a.entry.doc);
+    if (byImportance !== 0)
+      return byImportance;
+    const byPlanScore = planScoreOf(b.entry.doc) - planScoreOf(a.entry.doc);
+    if (byPlanScore !== 0)
+      return byPlanScore;
+    return a.index - b.index;
+  });
+  const taken = eligible.slice(0, config3.minEpisodeItems - kept.length);
+  const takenIds = new Set(taken.map(({ entry }) => entry.doc.id));
+  const admitted = taken.map(({ entry }) => ({
+    ...entry.doc,
+    metadata: { ...asRecord(entry.doc.metadata), backfilled: true }
+  }));
+  return {
+    kept: [...kept, ...admitted],
+    rejected: rejected.filter((entry) => !takenIds.has(entry.doc.id)),
+    admitted
+  };
+}
 function rejectedOutPath(outputPath) {
   return outputPath.endsWith(".json") ? `${outputPath.slice(0, -".json".length)}.rejected.json` : `${outputPath}.rejected.json`;
 }
@@ -22530,9 +22576,13 @@ async function processFilterIO(inputPath, outputPath) {
   const config3 = filterConfigFromEnv();
   const docs = DocListSchema.parse(await readJsonFile(inputPath));
   const { kept, rejected } = filterAnnotated(docs, config3);
-  const content = planContent(kept, resolvePlanDate());
+  const filled = backfillToFloor(kept, rejected, config3);
+  if (filled.admitted.length > 0) {
+    echoError(`episode floor backfill: admitted ${filled.admitted.length} importance-only reject(s) to reach ${config3.minEpisodeItems} items (${filled.admitted.map((d) => d.id).join(", ")})`);
+  }
+  const content = planContent(filled.kept, resolvePlanDate());
   await atomicWrite(outputPath, content);
-  await atomicWrite(rejectedOutPath(outputPath), { rejected, config: config3, total: docs.length });
+  await atomicWrite(rejectedOutPath(outputPath), { rejected: filled.rejected, config: config3, total: docs.length });
   return content;
 }
 async function main2() {
@@ -22581,5 +22631,6 @@ export {
   docsToContent,
   cleanBody,
   classifyCategory,
+  backfillToFloor,
   DEFAULT_FILTER_CONFIG
 };

package/plugins/generations/episode-plan-gen/src/index.ts

@@ -635,6 +635,8 @@ export interface FilterConfig {
     minImportance: number;
     minUrgency: number;
     minImpact: number;
+    /** Episode floor: when fewer docs survive, importance-only rejects backfill up to this count. */
+    minEpisodeItems: number;
 }
 
 /** A doc the filter dropped, with every failed check (`category:not-in-allowlist`, `quality:2<3`, …). */
@@ -659,6 +661,13 @@ export const DEFAULT_FILTER_CONFIG: FilterConfig = {
     minImportance: 3,
     minUrgency: 2,
     minImpact: 1,
+    // 20261002 dogfood: a weak, policy-heavy day collapsed the episode to 2 spoken items
+    // (~5 min audio) because importance (source-tier base) is the first dimension a tail-source
+    // day fails. Backfill admits importance-only rejects — quality/urgency/impact/category
+    // minimums stay hard — so a thin news day deepens instead of shipping a stub. Floor is 8,
+    // not 6: the prompt-layer 选题边界 (script-write) drops policy items AFTER this gate (today
+    // 2 of 5), so the floor compensates upstream to land ~4-6 spoken items on a thin day.
+    minEpisodeItems: 8,
 };
 
 /** One QC_MIN_* threshold: an integer 0–5 or absent (→ fallback); anything else fails loud — never clamped. */
@@ -671,6 +680,17 @@ function parseFilterThreshold(raw: string | undefined, name: string, fallback: n
     return parsed;
 }
 
+/** QC_MIN_EPISODE_ITEMS: a positive integer count or absent (→ fallback); anything else fails loud. */
+function parseFloorCount(raw: string | undefined, name: string, fallback: number): number {
+    if (raw === undefined || raw.trim() === '') return fallback;
+    const value = raw.trim();
+    if (!/^\d+$/.test(value)) throw new Error(`${name}='${raw}' is not a positive integer (fail loud, no clamping)`);
+    const parsed = Number.parseInt(value, 10);
+    if (parsed < 1)
+        throw new Error(`${name}=${parsed} must be >= 1 (a 0 floor disables the gate — drop the env instead)`);
+    return parsed;
+}
+
 /** QC_CATEGORIES: a comma list of MECE categories; unknown entries fail loud (no silent drops). */
 function parseFilterCategories(raw: string | undefined): Category[] {
     if (raw === undefined || raw.trim() === '') return [...DEFAULT_FILTER_CONFIG.categories];
@@ -697,6 +717,11 @@ export function filterConfigFromEnv(env: Record<string, string | undefined> = pr
         ),
         minUrgency: parseFilterThreshold(env.QC_MIN_URGENCY, 'QC_MIN_URGENCY', DEFAULT_FILTER_CONFIG.minUrgency),
         minImpact: parseFilterThreshold(env.QC_MIN_IMPACT, 'QC_MIN_IMPACT', DEFAULT_FILTER_CONFIG.minImpact),
+        minEpisodeItems: parseFloorCount(
+            env.QC_MIN_EPISODE_ITEMS,
+            'QC_MIN_EPISODE_ITEMS',
+            DEFAULT_FILTER_CONFIG.minEpisodeItems,
+        ),
     };
 }
 
@@ -749,6 +774,53 @@ export function filterAnnotated(docs: Doc[], config: FilterConfig): { kept: Doc[
     return { kept, rejected };
 }
 
+function importanceOf(doc: Doc): number {
+    const scores = asRecord(asRecord(doc.metadata).scores);
+    return typeof scores.importance === 'number' ? scores.importance : 0;
+}
+
+function planScoreOf(doc: Doc): number {
+    const value = asRecord(doc.metadata).planScore;
+    return typeof value === 'number' ? value : 0;
+}
+
+/**
+ * Episode floor (20261002): when the strict filter leaves fewer than `minEpisodeItems` docs,
+ * backfill from rejects that failed ONLY the importance minimum — importance is the source-tier
+ * base (tail sources carry 2), so on a thin day it is the softest dimension, while quality/
+ * urgency/impact/category stay hard gates. Admission order: importance desc, planScore desc,
+ * plan order. Admitted docs are stamped `metadata.backfilled: true` and leave the rejected
+ * audit (they are spoken, not dropped). Pure: input docs are never mutated.
+ */
+export function backfillToFloor(
+    kept: Doc[],
+    rejected: RejectedDoc[],
+    config: FilterConfig,
+): { kept: Doc[]; rejected: RejectedDoc[]; admitted: Doc[] } {
+    if (kept.length >= config.minEpisodeItems) return { kept, rejected, admitted: [] };
+    const eligible = rejected
+        .map((entry, index) => ({ entry, index }))
+        .filter(({ entry }) => entry.reasons.length > 0 && entry.reasons.every((r) => r.startsWith('importance:')));
+    eligible.sort((a, b) => {
+        const byImportance = importanceOf(b.entry.doc) - importanceOf(a.entry.doc);
+        if (byImportance !== 0) return byImportance;
+        const byPlanScore = planScoreOf(b.entry.doc) - planScoreOf(a.entry.doc);
+        if (byPlanScore !== 0) return byPlanScore;
+        return a.index - b.index;
+    });
+    const taken = eligible.slice(0, config.minEpisodeItems - kept.length);
+    const takenIds = new Set(taken.map(({ entry }) => entry.doc.id));
+    const admitted = taken.map(({ entry }) => ({
+        ...entry.doc,
+        metadata: { ...asRecord(entry.doc.metadata), backfilled: true },
+    }));
+    return {
+        kept: [...kept, ...admitted],
+        rejected: rejected.filter((entry) => !takenIds.has(entry.doc.id)),
+        admitted,
+    };
+}
+
 /** Sibling rejected-audit path: `<out>.json` → `<out>.rejected.json` (candidates.json → candidates.rejected.json). */
 export function rejectedOutPath(outputPath: string): string {
     return outputPath.endsWith('.json')
@@ -792,9 +864,15 @@ async function processFilterIO(inputPath: string, outputPath: string): Promise<C
     const config = filterConfigFromEnv();
     const docs = DocListSchema.parse(await readJsonFile(inputPath));
     const { kept, rejected } = filterAnnotated(docs, config);
-    const content = planContent(kept, resolvePlanDate());
+    const filled = backfillToFloor(kept, rejected, config);
+    if (filled.admitted.length > 0) {
+        echoError(
+            `episode floor backfill: admitted ${filled.admitted.length} importance-only reject(s) to reach ${config.minEpisodeItems} items (${filled.admitted.map((d) => d.id).join(', ')})`,
+        );
+    }
+    const content = planContent(filled.kept, resolvePlanDate());
     await atomicWrite(outputPath, content);
-    await atomicWrite(rejectedOutPath(outputPath), { rejected, config, total: docs.length });
+    await atomicWrite(rejectedOutPath(outputPath), { rejected: filled.rejected, config, total: docs.length });
     return content;
 }
 

package/plugins/generations/image-gen/assets/fonts/OFL.txt

@@ -0,0 +1,92 @@
+This Font Software is licensed under the SIL Open Font License,
+Version 1.1.
+
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font
+creation efforts of academic and linguistic communities, and to
+provide a free and open framework in which fonts may be shared and
+improved in partnership with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply to
+any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software
+components as distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to,
+deleting, or substituting -- in part or in whole -- any of the
+components of the Original Version, by changing formats or by porting
+the Font Software to a new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed,
+modify, redistribute, and sell modified and unmodified copies of the
+Font Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components, in
+Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the
+corresponding Copyright Holder. This restriction only applies to the
+primary font name as presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created using
+the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.

package/plugins/generations/image-gen/assets/fonts/SOURCE.md

@@ -0,0 +1,15 @@
+# Noto Sans SC — provenance
+
+Shipped static SubsetOTF/SC fonts used by the `compose` text-card composer (task 0180, ADR-028).
+Output is reproducible on every install because these bytes ship with the plugin — no runtime
+download and no system-font lookup.
+
+- **Upstream:** https://github.com/notofonts/noto-cjk (Noto Sans CJK SC, static SubsetOTF)
+- **Version:** tag `Sans2.004` (https://github.com/notofonts/noto-cjk/releases/tag/Sans2.004)
+- **Licence:** SIL Open Font License 1.1 (`OFL.txt`, from the repo root `LICENSE` at the same tag)
+
+| File | Upstream path at `Sans2.004` | SHA-256 |
+| --- | --- | --- |
+| `NotoSansSC-Regular.otf` | `Sans/SubsetOTF/SC/NotoSansSC-Regular.otf` | `faa6c9df652116dde789d351359f3d7e5d2285a2b2a1f04a2d7244df706d5ea9` |
+| `NotoSansSC-Bold.otf` | `Sans/SubsetOTF/SC/NotoSansSC-Bold.otf` | `c6cb5a93abaa9edc8ee7463b7ebb7f42d618d40e6ed2f7a5371c97b0b64767c0` |
+| `OFL.txt` | `LICENSE` | `6a73f9541c2de74158c0e7cf6b0a58ef774f5a780bf191f2d7ec9cc53efe2bf2` |