cognitive-core 0.2.5 → 0.3.1

package/dist/memory/seeds/meta-playbook-seeds.js

@@ -0,0 +1,560 @@
+const RECORDED_AT = new Date('2026-06-22T00:00:00.000Z');
+/** Second seed batch: maintenance-surface guidance (efficacy, lifecycle, defrag). */
+const RECORDED_AT_MAINTENANCE = new Date('2026-07-01T00:00:00.000Z');
+/** Domains every analysis task queries with (`template.domain`). */
+const ANALYSIS_DOMAINS = [
+    'playbook-extraction',
+    'playbook-conditioning',
+    'trajectory-analysis',
+    'meta-learning',
+];
+export const META_PLAYBOOK_SEEDS = [
+    // ───────────────────────────────────────────────────────────────────────
+    // 1. WHAT to extract — differential, behaviour-changing lessons only.
+    //    Source: ReasoningBank (arXiv:2509.25140), ExpeL (arXiv:2308.10144).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-differential-distillation',
+        name: 'differential-distillation',
+        confidence: 0.85,
+        complexity: 'moderate',
+        estimatedEffort: 2,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'distilling reusable guidance from a batch of completed trajectories',
+                'deciding whether a candidate lesson is worth storing as a playbook',
+            ],
+            triggers: [
+                'extract playbooks from agent trajectories',
+                'trajectory contains both successful and failed runs of similar tasks',
+            ],
+            antiPatterns: [
+                'Do not store guidance that a competent frontier model would already follow without it.',
+                'Do not summarise the task format — a restatement of the prompt is not a lesson.',
+                'Do not inject raw failed trajectories as exemplars; distil failures into guardrails instead.',
+                'Do not hard-code the answer\u2019s CONTENT (exact gold numbers/ids/field values). A playbook that carries one task\u2019s answer is memorization and will not transfer to a held-out task in the same family.',
+            ],
+        },
+        guidance: {
+            strategy: 'Store only the differential: the non-obvious lesson that would change what the next agent does. Distil successes into reusable strategies (why it worked, when it applies) and failures into preventive guardrails — never as imitation examples. When a verifier oracle (expected output / produced-vs-expected diff) is available, prioritise capturing the family-level OUTPUT CONTRACT it reveals over process hygiene.',
+            tactics: [
+                'Apply the counterfactual test: "would a strong model already do this without the memory?" If yes, discard the candidate.',
+                'Pair each success lesson with the concrete mistake it prevents, drawn from an observed failure or near-miss.',
+                'Distil the answer\u2019s SHAPE, strip the answer\u2019s CONTENT: KEEP the transferable contract (numeric int/float typing, sort keys, JSON/CSV schema shape, "changed"-field semantics, rounding, units); DROP the run-specific values (exact numbers, object ids, one-off field names).',
+                'Cap the yield: a few high-signal items beat many generic ones — prefer ≤3 lessons per trajectory family.',
+            ],
+            steps: [
+                'Name the mistake a fresh agent would make without this memory.',
+                'Write the correction as an action-oriented, generalizable recipe.',
+                'Convert each observed failure into an anti-pattern, not an exemplar.',
+                'Reject any candidate whose lesson holds without having seen these trajectories.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Each stored lesson names a specific behaviour change and the condition that triggers it',
+                'Generic task summaries are rejected or narrowed into decision rules',
+            ],
+            failureIndicators: [
+                'Stored playbooks restate the task or describe a generic workflow',
+                'Failures are stored as exemplars rather than guardrails',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'ReasoningBank (arXiv:2509.25140); ExpeL (arXiv:2308.10144)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 2. HOW to consolidate a batch — parallel independent analysts, merge by
+    //    prevalence. Source: Trace2Skill (arXiv:2603.25158).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-prevalence-weighted-consolidation',
+        name: 'prevalence-weighted-consolidation',
+        confidence: 0.85,
+        complexity: 'complex',
+        estimatedEffort: 3,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'consolidating lessons across many trajectories in one extraction batch',
+                'merging overlapping candidate playbooks into a single library entry',
+            ],
+            triggers: [
+                'batch extraction over a pool of trajectories from the same task family',
+                'multiple candidate lessons describe the same underlying behaviour',
+            ],
+            antiPatterns: [
+                'Do not edit a skill sequentially trajectory-by-trajectory — that overfits to trajectory-local quirks.',
+                'Do not promote a one-off observation to a top-level rule.',
+                "Do not let one analyst see another analyst's output before merge — independence is what makes recurrence meaningful.",
+            ],
+        },
+        guidance: {
+            strategy: 'Analyse trajectories independently in parallel (one analyst per trajectory, no cross-visibility), then consolidate by prevalence: a fix that recurs across many independent analyses is a systematic task property and should be promoted; a one-off is noise and should be demoted to an on-demand reference, not the main playbook.',
+            tactics: [
+                'Treat recurrence across independent analyses as the primary evidence of a systematic property.',
+                'Map support count (N analyses / total) onto playbook confidence — high support → promote, low support → demote to a references tier.',
+                'Merge hierarchically: dedup, resolve conflicts by stronger justification, preserve unique high-support insights.',
+                'Carry a support count alongside each consolidated lesson so later curation can re-weight it.',
+            ],
+            steps: [
+                'Generate an independent lesson set from each trajectory without sharing context.',
+                'Group candidate lessons by the behaviour they describe.',
+                'Count independent support per group; promote high-support groups, demote singletons.',
+                'Emit one consolidated playbook per promoted group, annotated with its support count.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Promoted playbooks are supported by multiple independent trajectories',
+                'One-off observations are demoted to references rather than top-level rules',
+            ],
+            failureIndicators: [
+                'A single trajectory drives a high-confidence library-wide rule',
+                'Near-duplicate playbooks proliferate instead of merging',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'Trace2Skill (arXiv:2603.25158)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 3. HOW to trust a failure lesson — reproduce-and-fix before believing it.
+    //    Source: Trace2Skill error-analyst (arXiv:2603.25158); SkillWeaver Hone
+    //    (arXiv:2504.07079).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-verification-gated-failure-analysis',
+        name: 'verification-gated-failure-analysis',
+        confidence: 0.85,
+        complexity: 'complex',
+        estimatedEffort: 3,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'diagnosing why a trajectory failed before turning the cause into an anti-pattern',
+                'extracting guardrails from failed or partially-failed runs',
+            ],
+            triggers: [
+                'trajectory failed and the root cause is being attributed',
+                'a candidate anti-pattern is being added from a single failure',
+            ],
+            antiPatterns: [
+                'Do not trust a single-pass root-cause guess — diagnosed causes are frequently wrong.',
+                'Do not store an anti-pattern whose causal claim was never reproduced.',
+            ],
+        },
+        guidance: {
+            strategy: 'Before promoting a diagnosed failure cause into a guardrail, validate it: inspect the real artifacts (logs, produced files, verifier output), propose a minimal fix, and confirm the fix changes the outcome. If the cause cannot be causally verified, drop the candidate rather than storing a plausible-but-wrong lesson.',
+            tactics: [
+                'Read the actual artifacts the run produced — do not infer the failure from the prompt alone.',
+                'State the root cause as a falsifiable claim, then test it with the smallest possible change.',
+                'Keep only diagnoses that survive verification; route the rest to a "needs-evidence" holding area, never the live bank.',
+                'Prefer a verified guardrail over many unverified ones (verification roughly quadruples diagnosis precision in the literature).',
+            ],
+            steps: [
+                'Reconstruct what actually happened from logs/files/verifier output.',
+                'Hypothesise the minimal root cause.',
+                'Apply the minimal corrective change and re-check the outcome.',
+                'Promote the guardrail only if the change flips or improves the result.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Stored anti-patterns reference a verified, reproduced cause',
+                'Unverifiable failure diagnoses are dropped, not stored',
+            ],
+            failureIndicators: [
+                'Anti-patterns assert a cause that was never reproduced',
+                'A false-positive diagnosis becomes a binding guardrail',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'Trace2Skill error-analyst (arXiv:2603.25158); SkillWeaver Hone (arXiv:2504.07079)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 4. WHAT SHAPE to emit — conditioned guidance that survives injection.
+    //    Source: cognitive-core's own G3 audit (F1 fix) + ACE (arXiv:2510.04618).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-conditioned-guidance-contract',
+        name: 'conditioned-guidance-contract',
+        confidence: 0.9,
+        complexity: 'moderate',
+        estimatedEffort: 2,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'writing the final shape of an extracted playbook',
+                'ensuring extracted guidance does not cause negative transfer when injected',
+            ],
+            triggers: [
+                'a playbook is about to be emitted from an extraction run',
+                "guidance will be injected into a downstream agent's context",
+            ],
+            antiPatterns: [
+                'Do not emit a strategy without explicit apply-when AND do-not-apply conditions.',
+                'Do not rely on the injection layer to add conditions — if they are not in the playbook, they are lost.',
+                'Do not present an unconditioned lesson as universally applicable.',
+            ],
+        },
+        guidance: {
+            strategy: 'Every emitted playbook must carry its own conditions and guardrails, because guidance applied unconditionally is the direct cause of negative transfer on novel tasks. Make applicability (when to apply), anti-patterns (when NOT to apply), and — whenever the task has a strict verifier — the OUTPUT CONTRACT first-class fields, not afterthoughts. On verifier-gated task families the output contract (numeric typing, sort keys, JSON/CSV schema shape, which field-deltas count as "changed", rounding, units) is the highest-value thing to capture: it is what actually gates success, and process hygiene never encodes it.',
+            tactics: [
+                'Fill applicability.triggers with concrete signals, and applicability.antiPatterns with the cases that must reject the playbook.',
+                'When a verifier is strict, make the output contract a REQUIRED capture: state the shape rules as verifier-checkable success indicators (types, ordering, schema) — shape only, never the gold values.',
+                'Phrase guidance so a downstream agent can self-assess fit and decline when it does not match.',
+                'Keep conditions and the output contract attached to the lesson so they survive truncation at the injection layer.',
+            ],
+            steps: [
+                'Write the lesson.',
+                'Add explicit "apply when" triggers and "do NOT apply when" anti-patterns.',
+                'If the family is verifier-gated, add the output-contract success indicators (shape, not values).',
+                'Reject the playbook if it cannot state when it would be wrong to use, or (for a verifier-gated family) omits the output contract.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Every emitted playbook has non-empty triggers and anti-patterns',
+                'Each playbook states at least one condition under which it must not be applied',
+                'Verifier-gated playbooks carry an output contract (shape rules) and no hard-coded gold values',
+            ],
+            failureIndicators: [
+                'Playbooks ship with empty anti-patterns or universal applicability',
+                'Downstream agents over-apply guidance on tasks it was not meant for',
+                'A verifier-gated playbook omits the output contract or hard-codes the answer values',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'cognitive-core G3 audit (F1: surface applicability + antiPatterns at injection); ACE (arXiv:2510.04618)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 5. HOW to update without collapse — incremental deltas + counters.
+    //    Source: ACE (arXiv:2510.04618); SkillComposer Merge (arXiv:2606.06079).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-delta-merge-with-counters',
+        name: 'delta-merge-with-counters',
+        confidence: 0.85,
+        complexity: 'complex',
+        estimatedEffort: 3,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'updating an existing playbook library with newly extracted lessons',
+                'preventing the playbook library from degrading as it grows',
+            ],
+            triggers: [
+                'a new lesson overlaps an existing library entry',
+                'the library is accumulating near-duplicate or contradictory entries',
+            ],
+            antiPatterns: [
+                'Do not rewrite an entire playbook to incorporate one new lesson (context collapse / brevity bias).',
+                'Do not append-only — unbounded growth pollutes retrieval.',
+                'Do not delete an entry that still carries net-helpful evidence.',
+            ],
+        },
+        guidance: {
+            strategy: 'Evolve the library by small, itemized deltas rather than wholesale rewrites. Track a helpful and a harmful counter per item, merge overlapping items by deterministic rule (not free-form regeneration), dedup by semantic similarity, and prune items whose harmful evidence dominates. This is the anti-context-collapse discipline that lets a library compound instead of degrade.',
+            tactics: [
+                'Express each update as add / update-counter / merge / prune — never "regenerate the whole entry".',
+                'On overlap, update the existing item (bump counters, append a scoped refinement) instead of forking a new one.',
+                'Maintain per-item helpful/harmful counts and let them drive promotion, demotion, and pruning.',
+                'Run a contradiction sweep: when two items conflict, reconcile by evidence rather than keeping both.',
+            ],
+            steps: [
+                'Match each new lesson against existing entries by semantic similarity.',
+                'If it overlaps, merge as a delta and update counters; if novel, add it.',
+                'Recompute helpful/harmful balance for touched items.',
+                'Prune items whose harmful count dominates and dedup the rest.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Updates appear as incremental deltas with updated counters, not rewrites',
+                'Library size stays bounded while coverage grows; duplicates are merged',
+            ],
+            failureIndicators: [
+                'Entries are regenerated wholesale and lose prior detail',
+                'Near-duplicate or contradictory entries accumulate unbounded',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'ACE (arXiv:2510.04618); SkillComposer Merge operation (arXiv:2606.06079)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 6. HOW to refine existing playbooks safely — validation-gated edits.
+    //    Source: SkillOpt (arXiv:2605.23904); SkillFlow patch protocol
+    //    (arXiv:2604.17308).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-validation-gated-refinement',
+        name: 'validation-gated-refinement',
+        confidence: 0.85,
+        complexity: 'complex',
+        estimatedEffort: 3,
+        applicability: {
+            domains: ANALYSIS_DOMAINS,
+            situations: [
+                'refining or rewording an existing playbook based on new outcomes',
+                'optimising guidance text against held-out task performance',
+            ],
+            triggers: [
+                'an existing playbook is being revised after observed use',
+                'a maintenance/refinement pass is proposing edits to stored guidance',
+            ],
+            antiPatterns: [
+                'Do not accept an edit that has not been shown to improve held-out performance.',
+                'Do not make broad rewrites when a minimal edit suffices.',
+                'Do not re-propose an edit that was already rejected.',
+            ],
+        },
+        guidance: {
+            strategy: 'Treat playbook refinement like gated optimisation: propose bounded add/delete/replace edits ("textual gradients"), and accept an edit only when it strictly improves a held-out validation signal. Prefer minimal edits over rewrites, keep a buffer of rejected edits so they are not retried, and apply changes as small patches to the existing entry.',
+            tactics: [
+                'Frame each refinement as a bounded edit (add / delete / replace), not a free rewrite.',
+                'Gate acceptance on a held-out improvement — reject neutral or regressive edits.',
+                'Prefer the smallest edit that captures the lesson (minimal-edit bias).',
+                'Record rejected edits to avoid re-proposing them next pass.',
+            ],
+            steps: [
+                'Score the current playbook on a held-out signal.',
+                'Propose a minimal bounded edit.',
+                'Re-score with the edit applied.',
+                'Keep the edit only on strict improvement; otherwise buffer it as rejected.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Accepted edits are minimal and tied to a measured held-out improvement',
+                'Rejected edits are buffered and not retried',
+            ],
+            failureIndicators: [
+                'Edits are accepted without any improvement signal',
+                'Refinement passes churn entries with broad rewrites',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT,
+        },
+        publishMetadata: {
+            derivedFrom: 'SkillOpt (arXiv:2605.23904); SkillFlow minimal-edit patch protocol (arXiv:2604.17308)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 7. HOW to attribute playbook efficacy — counterfactual evidence, and
+    //    seeds are not sacred. Guides the efficacy-audit / decay-detection
+    //    maintenance agents (domain: meta-learning).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-counterfactual-efficacy-attribution',
+        name: 'counterfactual-efficacy-attribution',
+        confidence: 0.85,
+        complexity: 'complex',
+        estimatedEffort: 3,
+        applicability: {
+            domains: ['meta-learning'],
+            situations: [
+                'auditing whether a playbook actually improves outcomes when injected',
+                'deciding whether a decaying playbook should be demoted, refined, or retired',
+            ],
+            triggers: [
+                'playbook efficacy audit over usage annotations',
+                'decay detection flagged playbooks with declining success contribution',
+            ],
+            antiPatterns: [
+                'Do not treat injection-presence as causation — a playbook injected into a successful run may have contributed nothing.',
+                'Do not exempt curated/seed playbooks from demotion; provenance is not evidence of efficacy.',
+                'Do not demote on a handful of outcomes when the playbook was injected into tasks outside its stated applicability.',
+            ],
+        },
+        guidance: {
+            strategy: 'Attribute efficacy counterfactually: compare guided success against the unguided baseline for the same task family, and weight evidence by whether the task actually matched the playbook\u2019s applicability. Curated seeds compete on identical terms as extracted playbooks \u2014 a seed that does not earn its keep is demoted like any other entry.',
+            tactics: [
+                'Compare success WITH the playbook injected vs. the unguided success rate on similar tasks — the delta is the signal, not the raw success rate.',
+                'Discount outcomes where the playbook was injected off-applicability; those measure retrieval error, not playbook quality.',
+                'Check provenance last, not first: origin (curated / extracted / imported) never overrides observed evidence.',
+                'Prefer a refinement recommendation (narrow the applicability, fix a stale tactic) over retirement when the failure pattern is conditional.',
+            ],
+            steps: [
+                'Establish the unguided baseline for the task family.',
+                'Partition the playbook\u2019s usage annotations into in-applicability and off-applicability.',
+                'Compute the guided-vs-unguided delta on the in-applicability partition.',
+                'Recommend: keep (positive delta), refine (conditional failures), or demote/retire (negative delta with sufficient evidence).',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Audit verdicts cite a guided-vs-unguided delta, not raw success counts',
+                'Curated seeds appear among demotions when their evidence is negative',
+            ],
+            failureIndicators: [
+                'A playbook is kept solely because it is curated or frequently injected',
+                'Demotions are issued from off-applicability failures',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT_MAINTENANCE,
+        },
+        publishMetadata: {
+            derivedFrom: 'cognitive-core efficacy toolkit + DESIGN-meta-learning-validation.md (unguided-baseline attribution)',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 8. HOW to manage the library lifecycle — gradual, reversible, evidence-
+    //    proportional. Guides the lifecycle-review maintenance agent
+    //    (domain: meta-learning).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-graduated-lifecycle-management',
+        name: 'graduated-lifecycle-management',
+        confidence: 0.85,
+        complexity: 'moderate',
+        estimatedEffort: 2,
+        applicability: {
+            domains: ['meta-learning'],
+            situations: [
+                'reviewing the whole playbook library for promotions, demotions, and retirements',
+                'keeping library size bounded without destroying not-yet-proven entries',
+            ],
+            triggers: [
+                'periodic playbook lifecycle review',
+                'library growth or tier rebalancing decisions',
+            ],
+            antiPatterns: [
+                'Do not retire an entry that simply has not been retrieved yet — low evidence is not negative evidence.',
+                'Do not hard-delete when a demotion or archive preserves recoverable value.',
+                'Do not promote on a short winning streak; require evidence proportional to the tier.',
+            ],
+        },
+        guidance: {
+            strategy: 'Move entries along a graduated ladder (promote \u2194 demote \u2192 archive \u2192 retire) with evidence requirements proportional to the move\u2019s cost. Irreversible actions demand the most evidence; absence of evidence keeps an entry parked, not executed. Distinguish "unproven" (protect) from "disproven" (demote).',
+            tactics: [
+                'Require more evidence for retirement than demotion, and more for demotion than for leaving an entry in place.',
+                'Protect the cold-start tail: entries with < N retrievals are unproven, not failing — leave them retrievable.',
+                'Prefer merging near-duplicate entries over retiring one of them; consolidation preserves both evidence trails.',
+                'Time-scope verdicts: an entry that decayed after an environment change may need re-validation, not retirement.',
+            ],
+            steps: [
+                'Bucket entries: proven-positive, proven-negative, unproven, redundant.',
+                'Promote proven-positive, demote/retire proven-negative per evidence thresholds.',
+                'Merge redundant entries; leave unproven entries in place.',
+                'Record each verdict with the evidence that justified it.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Every retirement cites sufficient negative evidence',
+                'Unproven entries survive reviews until they accumulate real usage',
+            ],
+            failureIndicators: [
+                'Entries deleted for inactivity alone',
+                'Library churns — entries retired then re-extracted from the same lesson',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT_MAINTENANCE,
+        },
+        publishMetadata: {
+            derivedFrom: 'ACE incremental-delta discipline (arXiv:2510.04618); cognitive-core playbook-lifecycle-review template',
+        },
+    },
+    // ───────────────────────────────────────────────────────────────────────
+    // 9. HOW to defrag the knowledge bank — conservative merges that preserve
+    //    provenance and contradictions. Guides the knowledge-defrag agent
+    //    (domain: knowledge-defrag).
+    // ───────────────────────────────────────────────────────────────────────
+    {
+        id: 'meta-playbook-seed-provenance-preserving-defrag',
+        name: 'provenance-preserving-defrag',
+        confidence: 0.85,
+        complexity: 'moderate',
+        estimatedEffort: 2,
+        applicability: {
+            domains: ['knowledge-defrag'],
+            situations: [
+                'deduplicating and consolidating knowledge notes that cover overlapping facts',
+                'resolving apparent contradictions between stored observations',
+            ],
+            triggers: [
+                'knowledge defrag maintenance pass',
+                'multiple notes describe the same entity or observation',
+            ],
+            antiPatterns: [
+                'Do not merge notes whose claims merely co-occur — merge only true duplicates of the same fact.',
+                'Do not silently drop the losing side of a contradiction; contradictions are signal about a changing environment.',
+                'Do not rewrite merged content so heavily that source attribution is lost.',
+            ],
+        },
+        guidance: {
+            strategy: 'Defrag conservatively: merge only clear duplicates, keep provenance (source, timestamp, confidence) attached through every merge, and treat contradictions as first-class content to surface — either time-scoped ("was X until Y") or flagged for verification — never as noise to delete.',
+            tactics: [
+                'Merge criterion: same fact about the same entity, not merely related facts — when unsure, link instead of merging.',
+                'Carry the union of sources and the max-recency timestamp into the merged note.',
+                'On contradiction, prefer time-scoping (older fact superseded at T) over deletion; keep the supersession chain.',
+                'Bound each pass: a defrag that touches a large fraction of the bank in one sweep is a red flag for over-merging.',
+            ],
+            steps: [
+                'Cluster candidate duplicates by entity + claim similarity.',
+                'Within each cluster, separate true duplicates from related-but-distinct claims.',
+                'Merge duplicates with provenance union; link related claims.',
+                'Convert contradictions into time-scoped supersessions or verification flags.',
+            ],
+        },
+        verification: {
+            successIndicators: [
+                'Merged notes retain all source attributions and the supersession history',
+                'Contradictions surface as time-scoped facts or verification flags',
+            ],
+            failureIndicators: [
+                'Distinct claims collapsed into one lossy note',
+                'A contradiction resolved by silently deleting one side',
+            ],
+        },
+        provenance: {
+            origin: 'curated',
+            curatedBy: 'seed:meta-learning-research',
+            recordedAt: RECORDED_AT_MAINTENANCE,
+        },
+        publishMetadata: {
+            derivedFrom: 'cognitive-core KnowledgeDefragmenter + CoherenceChecker design (contradiction detection)',
+        },
+    },
+];
+//# sourceMappingURL=meta-playbook-seeds.js.map

package/dist/memory/seeds/meta-playbook-seeds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta-playbook-seeds.js","sourceRoot":"","sources":["../../../src/memory/seeds/meta-playbook-seeds.ts"],"names":[],"mappings":"AA2BA,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,0BAA0B,CAAC,CAAC;AACzD,qFAAqF;AACrF,MAAM,uBAAuB,GAAG,IAAI,IAAI,CAAC,0BAA0B,CAAC,CAAC;AAErE,oEAAoE;AACpE,MAAM,gBAAgB,GAAG;IACvB,qBAAqB;IACrB,uBAAuB;IACvB,qBAAqB;IACrB,eAAe;CAChB,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAuB;IACrD,0EAA0E;IAC1E,sEAAsE;IACtE,yEAAyE;IACzE,0EAA0E;IAC1E;QACE,EAAE,EAAE,8CAA8C;QAClD,IAAI,EAAE,2BAA2B;QACjC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,UAAU;QACtB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,qEAAqE;gBACrE,oEAAoE;aACrE;YACD,QAAQ,EAAE;gBACR,2CAA2C;gBAC3C,sEAAsE;aACvE;YACD,YAAY,EAAE;gBACZ,wFAAwF;gBACxF,iFAAiF;gBACjF,8FAA8F;gBAC9F,+MAA+M;aAChN;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,6ZAA6Z;YAC/Z,OAAO,EAAE;gBACP,0HAA0H;gBAC1H,8GAA8G;gBAC9G,0RAA0R;gBAC1R,0GAA0G;aAC3G;YACD,KAAK,EAAE;gBACL,gEAAgE;gBAChE,mEAAmE;gBACnE,sEAAsE;gBACtE,iFAAiF;aAClF;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,yFAAyF;gBACzF,qEAAqE;aACtE;YACD,iBAAiB,EAAE;gBACjB,kEAAkE;gBAClE,yDAAyD;aAC1D;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EAAE,4DAA4D;SAC1E;KACF;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,yDAAyD;IACzD,0EAA0E;IAC1E;QACE,EAAE,EAAE,sDAAsD;QAC1D,IAAI,EAAE,mCAAmC;QACzC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,SAAS;QACrB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,wEAAwE;gBACxE,qEAAqE;aACtE;YACD,QAAQ,EAAE;gBACR,wEAAwE;gBACxE,mEAAmE;aACpE;YACD,YAAY,EAAE;gBACZ,uGAAuG;gBACvG,2DAA2D;gBAC3D,sHAAsH;aACvH;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,uUAAuU;YACzU,OAAO,EAAE;gBACP,gGAAgG;gBAChG,sIAAsI;gBACtI,kHAAkH;gBAClH,8FAA8F;aAC/F;YACD,KAAK,EAAE;gBACL,kFAAkF;gBAClF,yDAAyD;gBACzD,sFAAsF;gBACtF,sFAAsF;aACvF;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,uEAAuE;gBACvE,4EAA4E;aAC7E;YACD,iBAAiB,EAAE;gBACjB,gEAAgE;gBAChE,yDAAyD;aAC1D;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EAAE,gCAAgC;SAC9C;KACF;IAED,0EAA0E;IAC1E,4EAA4E;IAC5E,4EAA4E;IAC5E,yBAAyB;IACzB,0EAA0E;IAC1E;QACE,EAAE,EAAE,wDAAwD;QAC5D,IAAI,EAAE,qCAAqC;QAC3C,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,SAAS;QACrB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,kFAAkF;gBAClF,4DAA4D;aAC7D;YACD,QAAQ,EAAE;gBACR,0DAA0D;gBAC1D,+DAA+D;aAChE;YACD,YAAY,EAAE;gBACZ,sFAAsF;gBACtF,uEAAuE;aACxE;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,8TAA8T;YAChU,OAAO,EAAE;gBACP,8FAA8F;gBAC9F,8FAA8F;gBAC9F,wHAAwH;gBACxH,gIAAgI;aACjI;YACD,KAAK,EAAE;gBACL,qEAAqE;gBACrE,qCAAqC;gBACrC,+DAA+D;gBAC/D,wEAAwE;aACzE;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,6DAA6D;gBAC7D,wDAAwD;aACzD;YACD,iBAAiB,EAAE;gBACjB,wDAAwD;gBACxD,wDAAwD;aACzD;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EACT,mFAAmF;SACtF;KACF;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,8EAA8E;IAC9E,0EAA0E;IAC1E;QACE,EAAE,EAAE,kDAAkD;QACtD,IAAI,EAAE,+BAA+B;QACrC,UAAU,EAAE,GAAG;QACf,UAAU,EAAE,UAAU;QACtB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,kDAAkD;gBAClD,4EAA4E;aAC7E;YACD,QAAQ,EAAE;gBACR,0DAA0D;gBAC1D,6DAA6D;aAC9D;YACD,YAAY,EAAE;gBACZ,iFAAiF;gBACjF,wGAAwG;gBACxG,mEAAmE;aACpE;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,ymBAAymB;YAC3mB,OAAO,EAAE;gBACP,iIAAiI;gBACjI,uMAAuM;gBACvM,+FAA+F;gBAC/F,mHAAmH;aACpH;YACD,KAAK,EAAE;gBACL,mBAAmB;gBACnB,2EAA2E;gBAC3E,kGAAkG;gBAClG,mIAAmI;aACpI;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,iEAAiE;gBACjE,gFAAgF;gBAChF,+FAA+F;aAChG;YACD,iBAAiB,EAAE;gBACjB,oEAAoE;gBACpE,qEAAqE;gBACrE,qFAAqF;aACtF;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EACT,yGAAyG;SAC5G;KACF;IAED,0EAA0E;IAC1E,qEAAqE;IACrE,6EAA6E;IAC7E,0EAA0E;IAC1E;QACE,EAAE,EAAE,8CAA8C;QAClD,IAAI,EAAE,2BAA2B;QACjC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,SAAS;QACrB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,oEAAoE;gBACpE,4DAA4D;aAC7D;YACD,QAAQ,EAAE;gBACR,iDAAiD;gBACjD,qEAAqE;aACtE;YACD,YAAY,EAAE;gBACZ,oGAAoG;gBACpG,2DAA2D;gBAC3D,iEAAiE;aAClE;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,wXAAwX;YAC1X,OAAO,EAAE;gBACP,mGAAmG;gBACnG,gHAAgH;gBAChH,+FAA+F;gBAC/F,qGAAqG;aACtG;YACD,KAAK,EAAE;gBACL,wEAAwE;gBACxE,yEAAyE;gBACzE,sDAAsD;gBACtD,+DAA+D;aAChE;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,0EAA0E;gBAC1E,wEAAwE;aACzE;YACD,iBAAiB,EAAE;gBACjB,yDAAyD;gBACzD,8DAA8D;aAC/D;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EAAE,0EAA0E;SACxF;KACF;IAED,0EAA0E;IAC1E,uEAAuE;IACvE,mEAAmE;IACnE,yBAAyB;IACzB,0EAA0E;IAC1E;QACE,EAAE,EAAE,gDAAgD;QACpD,IAAI,EAAE,6BAA6B;QACnC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,SAAS;QACrB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,gBAAgB;YACzB,UAAU,EAAE;gBACV,kEAAkE;gBAClE,4DAA4D;aAC7D;YACD,QAAQ,EAAE;gBACR,0DAA0D;gBAC1D,qEAAqE;aACtE;YACD,YAAY,EAAE;gBACZ,gFAAgF;gBAChF,0DAA0D;gBAC1D,sDAAsD;aACvD;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,2VAA2V;YAC7V,OAAO,EAAE;gBACP,uFAAuF;gBACvF,iFAAiF;gBACjF,wEAAwE;gBACxE,6DAA6D;aAC9D;YACD,KAAK,EAAE;gBACL,kDAAkD;gBAClD,iCAAiC;gBACjC,iCAAiC;gBACjC,4EAA4E;aAC7E;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,wEAAwE;gBACxE,6CAA6C;aAC9C;YACD,iBAAiB,EAAE;gBACjB,mDAAmD;gBACnD,qDAAqD;aACtD;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,WAAW;SACxB;QACD,eAAe,EAAE;YACf,WAAW,EACT,uFAAuF;SAC1F;KACF;IAED,0EAA0E;IAC1E,uEAAuE;IACvE,uEAAuE;IACvE,iDAAiD;IACjD,0EAA0E;IAC1E;QACE,EAAE,EAAE,wDAAwD;QAC5D,IAAI,EAAE,qCAAqC;QAC3C,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,SAAS;QACrB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,CAAC,eAAe,CAAC;YAC1B,UAAU,EAAE;gBACV,sEAAsE;gBACtE,6EAA6E;aAC9E;YACD,QAAQ,EAAE;gBACR,gDAAgD;gBAChD,uEAAuE;aACxE;YACD,YAAY,EAAE;gBACZ,wHAAwH;gBACxH,6FAA6F;gBAC7F,oHAAoH;aACrH;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,4VAA4V;YAC9V,OAAO,EAAE;gBACP,gJAAgJ;gBAChJ,2HAA2H;gBAC3H,8GAA8G;gBAC9G,4IAA4I;aAC7I;YACD,KAAK,EAAE;gBACL,sDAAsD;gBACtD,8FAA8F;gBAC9F,yEAAyE;gBACzE,8HAA8H;aAC/H;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,wEAAwE;gBACxE,sEAAsE;aACvE;YACD,iBAAiB,EAAE;gBACjB,wEAAwE;gBACxE,sDAAsD;aACvD;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,uBAAuB;SACpC;QACD,eAAe,EAAE;YACf,WAAW,EACT,sGAAsG;SACzG;KACF;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,iEAAiE;IACjE,8BAA8B;IAC9B,0EAA0E;IAC1E;QACE,EAAE,EAAE,mDAAmD;QACvD,IAAI,EAAE,gCAAgC;QACtC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,UAAU;QACtB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,CAAC,eAAe,CAAC;YAC1B,UAAU,EAAE;gBACV,iFAAiF;gBACjF,wEAAwE;aACzE;YACD,QAAQ,EAAE;gBACR,oCAAoC;gBACpC,8CAA8C;aAC/C;YACD,YAAY,EAAE;gBACZ,wGAAwG;gBACxG,4EAA4E;gBAC5E,sFAAsF;aACvF;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,iUAAiU;YACnU,OAAO,EAAE;gBACP,+GAA+G;gBAC/G,8GAA8G;gBAC9G,gHAAgH;gBAChH,gHAAgH;aACjH;YACD,KAAK,EAAE;gBACL,wEAAwE;gBACxE,iFAAiF;gBACjF,2DAA2D;gBAC3D,0DAA0D;aAC3D;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,qDAAqD;gBACrD,mEAAmE;aACpE;YACD,iBAAiB,EAAE;gBACjB,sCAAsC;gBACtC,yEAAyE;aAC1E;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,uBAAuB;SACpC;QACD,eAAe,EAAE;YACf,WAAW,EACT,wGAAwG;SAC3G;KACF;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,sEAAsE;IACtE,iCAAiC;IACjC,0EAA0E;IAC1E;QACE,EAAE,EAAE,iDAAiD;QACrD,IAAI,EAAE,8BAA8B;QACpC,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,UAAU;QACtB,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE;YACb,OAAO,EAAE,CAAC,kBAAkB,CAAC;YAC7B,UAAU,EAAE;gBACV,8EAA8E;gBAC9E,+DAA+D;aAChE;YACD,QAAQ,EAAE;gBACR,mCAAmC;gBACnC,wDAAwD;aACzD;YACD,YAAY,EAAE;gBACZ,gGAAgG;gBAChG,kHAAkH;gBAClH,2EAA2E;aAC5E;SACF;QACD,QAAQ,EAAE;YACR,QAAQ,EACN,6RAA6R;YAC/R,OAAO,EAAE;gBACP,oHAAoH;gBACpH,gFAAgF;gBAChF,gHAAgH;gBAChH,kHAAkH;aACnH;YACD,KAAK,EAAE;gBACL,4DAA4D;gBAC5D,iFAAiF;gBACjF,8DAA8D;gBAC9D,8EAA8E;aAC/E;SACF;QACD,YAAY,EAAE;YACZ,iBAAiB,EAAE;gBACjB,0EAA0E;gBAC1E,mEAAmE;aACpE;YACD,iBAAiB,EAAE;gBACjB,+CAA+C;gBAC/C,wDAAwD;aACzD;SACF;QACD,UAAU,EAAE;YACV,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,6BAA6B;YACxC,UAAU,EAAE,uBAAuB;SACpC;QACD,eAAe,EAAE;YACf,WAAW,EACT,0FAA0F;SAC7F;KACF;CACF,CAAC"}

package/dist/memory/seeds/meta-strategy-seeds.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Seed routing priors for MetaMemory.
+ *
+ * On a cold store the router's meta-adjustment path (`TaskRouter` →
+ * `MetaLearner.adjustRouting` → `MetaMemory.getRoutingAdjustments`) is inert:
+ * strategies only exist after `generateMetaStrategies()` has accumulated ≥5
+ * observations per pattern. These committed priors give the router sensible
+ * behavior from the first task, and then co-evolve with real evidence —
+ * `recordStrategyApplication` EMA-updates each strategy's `successRate`, and
+ * IDs/names are stable so `generateMetaStrategies()` never duplicates them.
+ *
+ * Matching contract (see `MetaMemory.getRoutingAdjustments` +
+ * `TaskRouter.extractTaskCharacteristics` / `summarizeMemoryState`):
+ * `condition.taskCharacteristics` entries must be substrings of extracted
+ * characteristics ('bug fix', 'multi-file change', 'complex task', …) and
+ * `condition.memoryState` entries substrings of the summarized memory state
+ * ('no similar experiences', 'high confidence playbook', …). Keep
+ * `routingBias` values ≤ 0.1: they nudge confidence, never flip the strategy
+ * (a flip requires bias > 0.3), so learned evidence stays in control.
+ */
+import type { MetaStrategy } from '../../types/meta.js';
+export declare const META_STRATEGY_SEEDS: MetaStrategy[];
+//# sourceMappingURL=meta-strategy-seeds.d.ts.map

package/dist/memory/seeds/meta-strategy-seeds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta-strategy-seeds.d.ts","sourceRoot":"","sources":["../../../src/memory/seeds/meta-strategy-seeds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAqBxD,eAAO,MAAM,mBAAmB,EAAE,YAAY,EA2E7C,CAAC"}