[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AVVXS9SVCA20BDYMVBKG19":3,"skill-same:01M7AVVXS9SVCA20BDYMVBKG19":65},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":14,"repositoryHtmlUrl":27,"repositoryHomepageUrl":6,"ownerHtmlUrl":28,"ownerBlogUrl":6,"ownerDescription":29,"updatedAt":30,"install":31,"resources":44},"01M7AVVXS9SVCA20BDYMVBKG19","knowledge-graph-pipeline",null,"Ingest curated tabular datasets into governed Neo4j labeled property graphs and relational recursive SQL hierarchies using ontological engineering standards. Do not use for ad-hoc unstructured document search or raw key-value caches.","SpectreDeath\u002FBrain-Harness","SpectreDeath","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F207463416?v=4","01M7AVGR1D4X8ADT47APKGVH2Z","JL","01M7AVGR2HSGD23BA5DBTJJTVN",0,"MIT","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: knowledge-graph-pipeline\ndescription: Ingest curated tabular datasets into governed Neo4j labeled property graphs and relational recursive SQL hierarchies using ontological engineering standards. Do not use for ad-hoc unstructured document search or raw key-value caches.\n---\n\n# Knowledge Graph Pipeline: Curated Data to Governed Graph Traversal\n\n`knowledge-graph-pipeline` is an authoritative composite meta-skill that orchestrates the discovery, ontological modeling, ingestion, and dual-engine querying of interconnected structured datasets into enterprise graph architectures.\n\nIt coordinates four specialized capabilities:\n1. **Curated Structured Data Discovery** ([`structured-data-scout`](..\u002Fstructured-data-scout\u002FSKILL.md))\n2. **Ontological Engineering & Formal Modeling** ([`ontological-engineering-coach`](..\u002Fontological-engineering-coach\u002FSKILL.md))\n3. **Neo4j Labeled Property Graph Architecture** ([`neo4j-knowledge-graph-architect`](..\u002Fneo4j-knowledge-graph-architect\u002FSKILL.md))\n4. **Relational Recursive SQL Graph Traversal** ([`sql-recursive-graph-traversal`](..\u002Fsql-recursive-graph-traversal\u002FSKILL.md))\n\nSee [CARD.md](CARD.md) for the companion summary card, 5-stage progression matrix, and invariants checklist.\nConsult `\u002Fontological-engineering-coach` for Gruber criteria, `\u002Fneo4j-knowledge-graph-architect` for Cypher UNWIND batching, and [graph-patterns.md](references\u002Fgraph-patterns.md) for graph design patterns.\n\n---\n\n## The 5-Stage Knowledge Graph Progression\n\n```\n[1. Curated Data Discovery] ──► [2. Ontological Modeling] ──► [3. Backward LPG Design]\n                                                                        │\n                                                                        ▼\n[5. Dual-Engine Traversal] ◄── [4. Idempotent Batch Ingestion] ◄────────┘\n```\n\n---\n\n## 1. Curated Data Discovery & Scouting\n\nSource, clean, and validate tabular datasets from reputable repositories before graph modeling:\n\n1. **Dataset Identification & Acquisition**:\n   - Query curated repositories (UCI Machine Learning, Kaggle, OpenData, HuggingFace Datasets) without unstructured web scraping.\n2. **Schema & Null-Field Profiling (Rule 33)**:\n   - Profile data types, foreign key integrity, missingness, and cardinality distributions.\n   - Enforce explicit null-value fallback handling (`dict.get(key) or []`).\n3. **Data Quality Gating**:\n   - Verify accuracy, completeness, consistency, timeliness, validity, and uniqueness.\n\n> **Completion criterion**: Cleaned dataset schema profiled with entity candidate keys and cardinality ratios documented.\n\n---\n\n## 2. Ontological Engineering & Gruber Modeling\n\nFormalize concepts, taxonomic hierarchies, and semantic relationships using formal engineering principles:\n\n1. **Apply Gruber's 5 Ontological Criteria**:\n   - **Clarity**: Unambiguous definitions independent of computational context.\n   - **Coherence**: Logical consistency with zero contradictory inferences.\n   - **Extendibility**: Monotonic expansion without revising existing axioms.\n   - **Minimal Encoding Bias**: Conceptual modeling free of database-specific representation quirks.\n   - **Minimal Ontological Commitment**: Constraining only what is strictly necessary.\n2. **Taxonomy & Axiom Definition**:\n   - Formalize `is-a` taxonomies, `part-of` mereologies, and domain\u002Frange constraints.\n\n> **Completion criterion**: Ontological schema formalized meeting all five Gruber design criteria.\n\n---\n\n## 3. Backward LPG Schema Design\n\nDesign the Neo4j Labeled Property Graph (LPG) schema working backward from downstream query patterns:\n\n1. **Query-Driven Schema Modeling**:\n   - Derive node labels, relationship types, and directional arrows from essential business questions.\n2. **Node vs Property Allocation**:\n   - Model entities with distinct lifecycles as Nodes; model scalar attributes as Properties.\n3. **Constraint & Index Declarations**:\n   - Define uniqueness constraints (`IS UNIQUE`) and existence constraints (`IS NOT NULL`) to guarantee data integrity.\n\n> **Completion criterion**: Backward-designed LPG schema with uniqueness constraints and traversal paths documented.\n\n---\n\n## 4. Idempotent Batch Ingestion\n\nIngest large tabular payloads into Neo4j using memory-efficient transactional batching:\n\n1. **Cypher UNWIND Batching**:\n   - Structure ingestion queries using `UNWIND $batch AS row` to bound transaction memory.\n2. **Idempotent MERGE Semantics**:\n   - Use `MERGE (n:Entity {id: row.id}) ON CREATE SET ... ON MATCH SET ...` to guarantee safe re-execution.\n3. **Transaction Slicing & Error Visibility (Rule 32)**:\n   - Chunk large datasets into 1,000 to 5,000 item slices; log all batch exceptions loudly without silent swallowing.\n\n> **Completion criterion**: Idempotent batch ingestion script executed with 100% records loaded and zero duplicate nodes.\n\n---\n\n## 5. Dual-Engine Traversal & Recursive SQL\n\nExecute complex graph pathfinding across both dedicated graph databases and relational SQL engines:\n\n1. **Neo4j Native Path Traversal**:\n   - Execute variable-length relationship expansions (`()-[:DEPENDS_ON*1..5]->()`) and shortest-path algorithms.\n2. **Relational Recursive Common Table Expressions (CTEs)**:\n   - Execute BFS shortest-path, hierarchy walking, and cycle detection inside relational SQL engines without graph infrastructure.\n3. **Cycle Safety Invariant**:\n   - Include cycle-prevention arrays (`ARRAY[id]` or string path trackers) in all recursive CTE queries to prevent infinite loops.\n\n> **Completion criterion**: Traversal queries successfully executed across both Cypher and Recursive SQL with cycle protection.\n\n---\n\n## The Three Foundational Pillars\n\n### 1. The Visual Brief Pillar\nEvery knowledge graph cycle renders an interactive HTML visual brief in `%TEMP%` displaying the ontological entity hierarchy, LPG schema diagrams, and traversal query benchmarks.\n\n### 2. The Mandatory Checkpoint Pillar\nThe agent must never execute destructive schema migrations or large batch drops without first presenting `implementation_plan.md` with `RequestFeedback: true` and awaiting explicit user confirmation.\n\n### 3. Explicit Anti-Patterns\nRigid architectural boundaries prevent schema bloat, unbounded recursive loops, and silent ingestion failures.\n\n---\n\n## Anti-Patterns\n\n- **Forward Schema Guessing** — Designing complex graph schemas speculatively before identifying downstream traversal queries.\n- **Unbounded Recursive CTE Loops** — Writing recursive SQL hierarchy queries without explicit depth bounds or cycle detection arrays.\n- **Non-Idempotent Ingestion** — Using bare `CREATE` statements in batch ingestion instead of `MERGE` with uniqueness constraints.\n- **Bare Catch Ingestion Swallowing** — Catching batch ingestion exceptions with bare `except Exception: continue` without logging (Rule 32).\n- **Property Bloating Entities** — Flattening interconnected domain entities into massive string properties on a single node.\n- **Missing Negative Boundaries** — Scaffolding graph skills without explicit `Do not use for...` constraints in frontmatter descriptions.\n","# Knowledge Graph Pipeline: Curated Data to Governed Graph Traversal\n\n`knowledge-graph-pipeline` is an authoritative composite meta-skill that orchestrates the discovery, ontological modeling, ingestion, and dual-engine querying of interconnected structured datasets into enterprise graph architectures.\n\nIt coordinates four specialized capabilities:\n1. **Curated Structured Data Discovery** ([`structured-data-scout`](..\u002Fstructured-data-scout\u002FSKILL.md))\n2. **Ontological Engineering & Formal Modeling** ([`ontological-engineering-coach`](..\u002Fontological-engineering-coach\u002FSKILL.md))\n3. **Neo4j Labeled Property Graph Architecture** ([`neo4j-knowledge-graph-architect`](..\u002Fneo4j-knowledge-graph-architect\u002FSKILL.md))\n4. **Relational Recursive SQL Graph Traversal** ([`sql-recursive-graph-traversal`](..\u002Fsql-recursive-graph-traversal\u002FSKILL.md))\n\nSee [CARD.md](CARD.md) for the companion summary card, 5-stage progression matrix, and invariants checklist.\nConsult `\u002Fontological-engineering-coach` for Gruber criteria, `\u002Fneo4j-knowledge-graph-architect` for Cypher UNWIND batching, and [graph-patterns.md](references\u002Fgraph-patterns.md) for graph design patterns.\n\n---\n\n## The 5-Stage Knowledge Graph Progression\n\n```\n[1. Curated Data Discovery] ──► [2. Ontological Modeling] ──► [3. Backward LPG Design]\n                                                                        │\n                                                                        ▼\n[5. Dual-Engine Traversal] ◄── [4. Idempotent Batch Ingestion] ◄────────┘\n```\n\n---\n\n## 1. Curated Data Discovery & Scouting\n\nSource, clean, and validate tabular datasets from reputable repositories before graph modeling:\n\n1. **Dataset Identification & Acquisition**:\n   - Query curated repositories (UCI Machine Learning, Kaggle, OpenData, HuggingFace Datasets) without unstructured web scraping.\n2. **Schema & Null-Field Profiling (Rule 33)**:\n   - Profile data types, foreign key integrity, missingness, and cardinality distributions.\n   - Enforce explicit null-value fallback handling (`dict.get(key) or []`).\n3. **Data Quality Gating**:\n   - Verify accuracy, completeness, consistency, timeliness, validity, and uniqueness.\n\n> **Completion criterion**: Cleaned dataset schema profiled with entity candidate keys and cardinality ratios documented.\n\n---\n\n## 2. Ontological Engineering & Gruber Modeling\n\nFormalize concepts, taxonomic hierarchies, and semantic relationships using formal engineering principles:\n\n1. **Apply Gruber's 5 Ontological Criteria**:\n   - **Clarity**: Unambiguous definitions independent of computational context.\n   - **Coherence**: Logical consistency with zero contradictory inferences.\n   - **Extendibility**: Monotonic expansion without revising existing axioms.\n   - **Minimal Encoding Bias**: Conceptual modeling free of database-specific representation quirks.\n   - **Minimal Ontological Commitment**: Constraining only what is strictly necessary.\n2. **Taxonomy & Axiom Definition**:\n   - Formalize `is-a` taxonomies, `part-of` mereologies, and domain\u002Frange constraints.\n\n> **Completion criterion**: Ontological schema formalized meeting all five Gruber design criteria.\n\n---\n\n## 3. Backward LPG Schema Design\n\nDesign the Neo4j Labeled Property Graph (LPG) schema working backward from downstream query patterns:\n\n1. **Query-Driven Schema Modeling**:\n   - Derive node labels, relationship types, and directional arrows from essential business questions.\n2. **Node vs Property Allocation**:\n   - Model entities with distinct lifecycles as Nodes; model scalar attributes as Properties.\n3. **Constraint & Index Declarations**:\n   - Define uniqueness constraints (`IS UNIQUE`) and existence constraints (`IS NOT NULL`) to guarantee data integrity.\n\n> **Completion criterion**: Backward-designed LPG schema with uniqueness constraints and traversal paths documented.\n\n---\n\n## 4. Idempotent Batch Ingestion\n\nIngest large tabular payloads into Neo4j using memory-efficient transactional batching:\n\n1. **Cypher UNWIND Batching**:\n   - Structure ingestion queries using `UNWIND $batch AS row` to bound transaction memory.\n2. **Idempotent MERGE Semantics**:\n   - Use `MERGE (n:Entity {id: row.id}) ON CREATE SET ... ON MATCH SET ...` to guarantee safe re-execution.\n3. **Transaction Slicing & Error Visibility (Rule 32)**:\n   - Chunk large datasets into 1,000 to 5,000 item slices; log all batch exceptions loudly without silent swallowing.\n\n> **Completion criterion**: Idempotent batch ingestion script executed with 100% records loaded and zero duplicate nodes.\n\n---\n\n## 5. Dual-Engine Traversal & Recursive SQL\n\nExecute complex graph pathfinding across both dedicated graph databases and relational SQL engines:\n\n1. **Neo4j Native Path Traversal**:\n   - Execute variable-length relationship expansions (`()-[:DEPENDS_ON*1..5]->()`) and shortest-path algorithms.\n2. **Relational Recursive Common Table Expressions (CTEs)**:\n   - Execute BFS shortest-path, hierarchy walking, and cycle detection inside relational SQL engines without graph infrastructure.\n3. **Cycle Safety Invariant**:\n   - Include cycle-prevention arrays (`ARRAY[id]` or string path trackers) in all recursive CTE queries to prevent infinite loops.\n\n> **Completion criterion**: Traversal queries successfully executed across both Cypher and Recursive SQL with cycle protection.\n\n---\n\n## The Three Foundational Pillars\n\n### 1. The Visual Brief Pillar\nEvery knowledge graph cycle renders an interactive HTML visual brief in `%TEMP%` displaying the ontological entity hierarchy, LPG schema diagrams, and traversal query benchmarks.\n\n### 2. The Mandatory Checkpoint Pillar\nThe agent must never execute destructive schema migrations or large batch drops without first presenting `implementation_plan.md` with `RequestFeedback: true` and awaiting explicit user confirmation.\n\n### 3. Explicit Anti-Patterns\nRigid architectural boundaries prevent schema bloat, unbounded recursive loops, and silent ingestion failures.\n\n---\n\n## Anti-Patterns\n\n- **Forward Schema Guessing** — Designing complex graph schemas speculatively before identifying downstream traversal queries.\n- **Unbounded Recursive CTE Loops** — Writing recursive SQL hierarchy queries without explicit depth bounds or cycle detection arrays.\n- **Non-Idempotent Ingestion** — Using bare `CREATE` statements in batch ingestion instead of `MERGE` with uniqueness constraints.\n- **Bare Catch Ingestion Swallowing** — Catching batch ingestion exceptions with bare `except Exception: continue` without logging (Rule 32).\n- **Property Bloating Entities** — Flattening interconnected domain entities into massive string properties on a single node.\n- **Missing Negative Boundaries** — Scaffolding graph skills without explicit `Do not use for...` constraints in frontmatter descriptions.\n",{"name":5,"description":7},"main","eff3b00e36d1d233ad4a4389605c82fbfa0326d3",".agents\u002Fskills\u002Fknowledge-graph-pipeline","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness","https:\u002F\u002Fgithub.com\u002FSpectreDeath","I'm here to manage stress so I wouldn't expect earth shattering break throughs I'm just an enthusiast that likes making stuff. ","2026-11-15 05:32:58",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add SpectreDeath\u002FBrain-Harness --skill knowledge-graph-pipeline",{"tool":37,"command":38},"bunx","bunx skills add SpectreDeath\u002FBrain-Harness --skill knowledge-graph-pipeline",{"tool":40,"command":41},"pnpm","pnpm dlx skills add SpectreDeath\u002FBrain-Harness --skill knowledge-graph-pipeline","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002FSKILL.md",true,[45,51,55,59],{"path":46,"resourceType":47,"resourceTypeDesc":48,"sizeBytes":49,"sourceHtmlUrl":50},"CARD.md","REFERENCE","参考文档",3690,"https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002FCARD.md",{"path":52,"resourceType":47,"resourceTypeDesc":48,"sizeBytes":53,"sourceHtmlUrl":54},"config.default.yaml",673,"https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002Fconfig.default.yaml",{"path":56,"resourceType":47,"resourceTypeDesc":48,"sizeBytes":57,"sourceHtmlUrl":58},"references\u002Fgraph-patterns.md",1232,"https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002Freferences\u002Fgraph-patterns.md",{"path":60,"resourceType":61,"resourceTypeDesc":62,"sizeBytes":63,"sourceHtmlUrl":64},"scripts\u002Fgraph_pipeline_driver.py","SCRIPT","脚本",9204,"https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fknowledge-graph-pipeline\u002Fscripts\u002Fgraph_pipeline_driver.py",[66,73,80,87,94,101],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":19},"01M7E0W6FR68J2N9CXCZTAQJFX","ui-behavior-primitive-architect","Architect, audit, and verify zero-dependency headless UI behavior primitives, WebMCP agent bridges, WAI-ARIA\u002FSSR\u002FRTL tri-modal checks, and framework expert routing. Do not use for static CSS theme styling or backend database migrations.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fui-behavior-primitive-architect\u002FSKILL.md",[],[],{"skillNo":74,"name":75,"nameZh":6,"description":76,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":77,"categories":78,"keywords":79,"publishedAt":19},"01M7E0VZ7JQNW34G271DENFGYP","trustgraph-ontology-governor","Govern knowledge graphs, SHACL-AF triple policies, OntologyRAG subclass validation, PROV-O dual named graphs, and Laya entropy decision scoring. Do not use for relational SQL queries or generic web scraping.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Ftrustgraph-ontology-governor\u002FSKILL.md",[],[],{"skillNo":81,"name":82,"nameZh":6,"description":83,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":19},"01M7E0VQ6Z7R45Q8QAZ4MT39EK","shim-harness-governor","Govern universal CLI agent loops, 4-tier tool permissions, ancestor-symlink workspace sandboxes, deterministic-first command routing, collision-safe MCP namespacing, and layered skill loading. Do not use for static UI styling or external SQL analytics.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fshim-harness-governor\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":93,"publishedAt":19},"01M7E0VC18NMP1QBSRJ3TPQ7MB","graphiti-zep-memory-governor","Govern bi-temporal knowledge graphs with Graphiti future-edge clamping, MinHash\u002FLSH entity dedup, RRF\u002FMMR reranking, and Zep typed ontologies. Do not use for static SQL joins or generic web crawling.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fgraphiti-zep-memory-governor\u002FSKILL.md",[],[],{"skillNo":95,"name":96,"nameZh":6,"description":97,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":98,"categories":99,"keywords":100,"publishedAt":19},"01M7E0V12ABE1RW3ZRCST8VH5Z","agora-mcp-workbench-architect","Architect, audit, and orchestrate Agora Workbench MCP servers, loopback sidecars, unified state graphs, gateway\u002Fdispatcher connectors, and policy-enforced data lakes. Do not use for static frontend CSS styling or non-MCP desktop GUI automation.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fagora-mcp-workbench-architect\u002FSKILL.md",[],[],{"skillNo":102,"name":103,"nameZh":6,"description":104,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":105,"categories":106,"keywords":107,"publishedAt":19},"01M7BFYG6QT3484VC57TZ19V7P","skill-eval-assurance-runner","Evaluate and assure agent skills using small-N Wilson confidence intervals, unbiased pass^k reliability, deterministic trajectory graders, preflight boundary honesty, and sealed digest verification. Do not use for subjective prose review or unconstrained production deployment.","https:\u002F\u002Fgithub.com\u002FSpectreDeath\u002FBrain-Harness\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fskill-eval-assurance-runner\u002FSKILL.md",[],[]]