[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M73BS5EWAYWXYASQR05NND3S":3,"skill-same:01M73BS5EWAYWXYASQR05NND3S":47},{"skillNo":4,"name":5,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":28,"ownerHtmlUrl":29,"ownerBlogUrl":30,"ownerDescription":31,"updatedAt":32,"install":33,"resources":46},"01M73BS5EWAYWXYASQR05NND3S","graph-dependency-resolution",null,"Horonomos-laps\u002FYana-AI","Horonomos-laps","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F355299122?v=4","01M76B3QPXE88ET2SQPDPVATZT"," Horonomos-laps","01M72ZQRJPCYPSSWT4D00VJR2A",13,"Apache-2.0","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fgraph-dependency-resolution\u002FSKILL.md",[],[],"2026-11-11 15:11:14",false,"---\nname: graph-dependency-resolution\ndescription: Graph algorithms and dependency resolution for AI agent systems. DAG construction for action gate ordering, cycle detection in skill\u002Frule graphs, BFS\u002FDFS traversal, semver range resolution for version conflicts, topological sort for execution ordering, and PageRank-based rule importance scoring. Sources: dagrejs\u002Fgraphlib, trekhleb\u002Fjavascript-algorithms, npm\u002Fnode-semver, sindresorhus\u002Ftoposort, asv\u002Fpagerank.\norigin: yana-ai — synthesized from dagrejs\u002Fgraphlib, trekhleb\u002Fjavascript-algorithms, npm\u002Fnode-semver, sindresorhus\u002Ftoposort, asv\u002Fpagerank\nlicense: Apache-2.0\nversion: 1.0.0\ncompatibility: yana-ai >= 1.3.46\n---\n\n# \u002Fgraph-dependency-resolution\n\n## When to Use\n\n- \"Which rule\u002Fskill depends on which — what's the safe load order?\"\n- Cycle detection: skill A depends on B depends on A → deadlock\n- Semver range conflicts: two skills require different versions of the same package\n- Rank rules by reference frequency to find the most critical ones\n- Find shortest path between two gates (optimal middleware chain)\n\n## Do NOT use for\n\n- Linear ordered lists with no dependencies (just sort by priority number)\n- Single-hop lookups (use a Map)\n\n---\n\n## DAG: Directed Acyclic Graph (graphlib)\n\n```typescript\nimport { Graph, alg } from '@dagrejs\u002Fgraphlib'\n\n\u002F\u002F Build the YAMTAM gate dependency graph\nconst gateGraph = new Graph({ directed: true, multigraph: false, compound: false })\n\n\u002F\u002F Nodes = gates\u002Fskills\u002Frules\ngateGraph.setNode('L0', { label: 'audit-log',         tier: 0 })\ngateGraph.setNode('L1', { label: 'anti-evasion',       tier: 1 })\ngateGraph.setNode('L2', { label: 'shell-sanitize',     tier: 2 })\ngateGraph.setNode('L3', { label: 'network-egress',     tier: 3 })\ngateGraph.setNode('tool-exec', { label: 'execute',     tier: 4 })\n\n\u002F\u002F Edges = \"must run before\"\ngateGraph.setEdge('L0', 'L1')    \u002F\u002F audit-log must be set up before anti-evasion\ngateGraph.setEdge('L1', 'L2')\ngateGraph.setEdge('L2', 'L3')\ngateGraph.setEdge('L3', 'tool-exec')\n\n\u002F\u002F Cycle detection — returns [] if DAG is valid, lists cycle nodes if broken\nconst cycles = alg.findCycles(gateGraph)\nif (cycles.length > 0) {\n  throw new Error(`Dependency cycle detected: ${cycles.map(c => c.join('→')).join(', ')}`)\n}\n\n\u002F\u002F Sources = nodes with no incoming edges (entry points)\nconst entryPoints = gateGraph.sources()   \u002F\u002F ['L0']\n\u002F\u002F Sinks   = nodes with no outgoing edges (terminal nodes)\nconst terminals   = gateGraph.sinks()     \u002F\u002F ['tool-exec']\n\n\u002F\u002F Reachability: all nodes reachable from L0\nconst reachable = alg.dijkstra(gateGraph, 'L0')\n\u002F\u002F reachable['tool-exec'].distance === 4\n\n\u002F\u002F Rule: always call alg.findCycles() before executing a gate graph — cycles = deadlock\n\u002F\u002F Rule: use gateGraph.sources() to find valid entry points, never hard-code 'L0'\n```\n\n---\n\n## Cycle Detection + BFS\u002FDFS (javascript-algorithms)\n\n```typescript\n\u002F\u002F BFS — shortest path in unweighted graph (level by level)\nfunction bfs(graph: Map\u003Cstring, string[]>, start: string): Map\u003Cstring, number> {\n  const distances = new Map\u003Cstring, number>([[start, 0]])\n  const queue = [start]\n\n  while (queue.length) {\n    const node = queue.shift()!\n    const neighbors = graph.get(node) ?? []\n\n    for (const n of neighbors) {\n      if (!distances.has(n)) {\n        distances.set(n, distances.get(node)! + 1)\n        queue.push(n)\n      }\n    }\n  }\n  return distances  \u002F\u002F distances.get(target) = hop count from start\n}\n\n\u002F\u002F DFS — cycle detection via visited + recursion stack\nfunction hasCycle(graph: Map\u003Cstring, string[]>): boolean {\n  const visited     = new Set\u003Cstring>()\n  const inStack     = new Set\u003Cstring>()\n\n  function dfs(node: string): boolean {\n    visited.add(node)\n    inStack.add(node)\n\n    for (const neighbor of graph.get(node) ?? []) {\n      if (!visited.has(neighbor) && dfs(neighbor)) return true\n      if (inStack.has(neighbor)) return true  \u002F\u002F back edge = cycle\n    }\n\n    inStack.delete(node)\n    return false\n  }\n\n  for (const node of graph.keys()) {\n    if (!visited.has(node) && dfs(node)) return true\n  }\n  return false\n}\n\n\u002F\u002F Dijkstra — weighted shortest path (e.g., skill load latency as weight)\nfunction dijkstra(graph: Map\u003Cstring, Array\u003C{ to: string; weight: number }>>, start: string) {\n  const dist = new Map\u003Cstring, number>([[start, 0]])\n  const pq: Array\u003C{ node: string; d: number }> = [{ node: start, d: 0 }]\n\n  while (pq.length) {\n    pq.sort((a, b) => a.d - b.d)\n    const { node, d } = pq.shift()!\n    if (d > (dist.get(node) ?? Infinity)) continue\n\n    for (const { to, weight } of graph.get(node) ?? []) {\n      const newDist = d + weight\n      if (newDist \u003C (dist.get(to) ?? Infinity)) {\n        dist.set(to, newDist)\n        pq.push({ node: to, d: newDist })\n      }\n    }\n  }\n  return dist\n}\n\n\u002F\u002F Rule: BFS for \"minimum hops\" questions, Dijkstra for weighted latency paths\n\u002F\u002F Rule: DFS inStack set must be reset on backtrack — missing this = false cycle reports\n```\n\n---\n\n## Topological Sort: Execution Order (toposort)\n\n```typescript\nimport toposort from 'toposort'\n\n\u002F\u002F Sort skills\u002Fscripts so dependencies run first\n\u002F\u002F Edge [A, B] means: A must run BEFORE B\nconst edges: [string, string][] = [\n  ['validate-manifest',  'build-release'],\n  ['run-tests',          'build-release'],\n  ['lint',               'run-tests'],\n  ['typecheck',          'run-tests'],\n  ['install-deps',       'lint'],\n  ['install-deps',       'typecheck'],\n]\n\n\u002F\u002F toposort returns nodes in reverse dep order (last dep first)\nconst executionOrder = toposort(edges).reverse()\n\u002F\u002F ['install-deps', 'lint', 'typecheck', 'run-tests', 'validate-manifest', 'build-release']\n\n\u002F\u002F With explicit node list (for isolated nodes with no edges)\nconst allNodes = ['install-deps', 'lint', 'typecheck', 'run-tests', 'validate-manifest', 'build-release', 'notify']\nconst fullOrder = toposort.array(allNodes, edges).reverse()\n\n\u002F\u002F Rule: always .reverse() — toposort returns reverse topological order by default\n\u002F\u002F Rule: toposort throws 'Cyclic dependency' on cycle — catch it, report the chain\ntry {\n  toposort(edges)\n} catch (e) {\n  if ((e as Error).message.includes('Cyclic')) {\n    throw new Error(`Build order has circular dependency: ${(e as Error).message}`)\n  }\n}\n```\n\n---\n\n## Semver Range Resolution (node-semver)\n\n```typescript\nimport semver from 'semver'\n\n\u002F\u002F Check if a version satisfies a range\nsemver.satisfies('1.3.45', '>=1.3.0 \u003C2.0.0')  \u002F\u002F true\nsemver.satisfies('2.0.0',  '>=1.3.0 \u003C2.0.0')  \u002F\u002F false\n\n\u002F\u002F Find the best version from a list that satisfies a range\nconst versions = ['1.2.0', '1.3.0', '1.3.44', '2.0.0', '2.1.0']\nsemver.maxSatisfying(versions, '^1.3.0')   \u002F\u002F '1.3.44'\nsemver.minSatisfying(versions, '^2.0.0')   \u002F\u002F '2.0.0'\n\n\u002F\u002F Resolve conflicting ranges from multiple skills\nfunction resolveConflicts(\n  requirements: Array\u003C{ skill: string; range: string }>\n): string | null {\n  \u002F\u002F Find intersection: a version satisfying ALL ranges\n  const intersection = requirements\n    .map(r => semver.validRange(r.range))\n    .filter(Boolean) as string[]\n\n  \u002F\u002F Try known versions against all constraints\n  return semver.maxSatisfying(\n    versions,\n    intersection.join(' ')  \u002F\u002F semver treats space as AND in ranges\n  )\n}\n\n\u002F\u002F Parse and compare\nconst v = semver.parse('1.3.45-beta.1')!\n\u002F\u002F v.major=1, v.minor=3, v.patch=45, v.prerelease=['beta', 1]\n\n\u002F\u002F Coerce messy version strings (e.g., from package.json non-standard values)\nsemver.coerce('v2.3.4-rc1')?.version  \u002F\u002F '2.3.4'\n\n\u002F\u002F Rule: use semver.validRange() before storing user-supplied ranges — throws on invalid\n\u002F\u002F Rule: space-join = AND intersection; || = OR union — never mix accidentally\n```\n\n---\n\n## PageRank: Rule Importance Scoring\n\n```typescript\n\u002F\u002F Power iteration PageRank — find most-referenced rules\u002Fskills\n\u002F\u002F A rule with many inbound links from other rules = high importance\n\nfunction pageRank(\n  graph: Map\u003Cstring, string[]>,   \u002F\u002F node → outbound neighbors\n  damping   = 0.85,\n  iterations = 50,\n  tolerance  = 1e-6\n): Map\u003Cstring, number> {\n  const nodes = [...graph.keys()]\n  const N     = nodes.length\n  let ranks   = new Map(nodes.map(n => [n, 1 \u002F N]))\n\n  for (let i = 0; i \u003C iterations; i++) {\n    const next = new Map\u003Cstring, number>()\n    let delta = 0\n\n    for (const node of nodes) {\n      \u002F\u002F Sum contributions from all nodes pointing to this one\n      let sum = 0\n      for (const [src, targets] of graph) {\n        if (targets.includes(node)) {\n          sum += (ranks.get(src) ?? 0) \u002F targets.length\n        }\n      }\n      const newRank = (1 - damping) \u002F N + damping * sum\n      next.set(node, newRank)\n      delta += Math.abs(newRank - (ranks.get(node) ?? 0))\n    }\n\n    ranks = next\n    if (delta \u003C tolerance) break  \u002F\u002F converged\n  }\n\n  return new Map([...ranks.entries()].sort((a, b) => b[1] - a[1]))\n}\n\n\u002F\u002F Example: rank YAMTAM rules by cross-reference frequency\nconst ruleRefs = new Map([\n  ['00-meta-rule-enforcer', ['agent-middleware-law', 'verification']],\n  ['agent-middleware-law',  ['shell-sanitize-law', 'network-egress-law']],\n  ['shell-sanitize-law',    ['00-meta-rule-enforcer']],\n  ['network-egress-law',    ['00-meta-rule-enforcer', 'agent-middleware-law']],\n  ['verification',          []],\n])\n\nconst importance = pageRank(ruleRefs)\n\u002F\u002F '00-meta-rule-enforcer' ranks highest — most inbound links\n\u002F\u002F Use: prune rarely-referenced rules, highlight critical ones in docs\n\n\u002F\u002F Rule: damping=0.85 is Google's original value — do not change without reason\n\u002F\u002F Rule: convergence check (delta \u003C tolerance) prevents over-iteration on small graphs\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ No cycle check before executing dependency graph (deadlock on first cycle)\n❌ DFS without inStack set (can't distinguish visited from in-current-path)\n❌ toposort result not .reverse()'d (execution order is backwards)\n❌ semver.satisfies() on un-validated range string (throws on malformed range)\n❌ Space-joined semver ranges confused with OR union (space = AND, || = OR)\n❌ PageRank without convergence check (fixed iteration on large graphs = wrong)\n❌ graphlib.alg.findCycles() skipped before graph traversal (silent infinite loop)\n```\n","# \u002Fgraph-dependency-resolution\n\n## When to Use\n\n- \"Which rule\u002Fskill depends on which — what's the safe load order?\"\n- Cycle detection: skill A depends on B depends on A → deadlock\n- Semver range conflicts: two skills require different versions of the same package\n- Rank rules by reference frequency to find the most critical ones\n- Find shortest path between two gates (optimal middleware chain)\n\n## Do NOT use for\n\n- Linear ordered lists with no dependencies (just sort by priority number)\n- Single-hop lookups (use a Map)\n\n---\n\n## DAG: Directed Acyclic Graph (graphlib)\n\n```typescript\nimport { Graph, alg } from '@dagrejs\u002Fgraphlib'\n\n\u002F\u002F Build the YAMTAM gate dependency graph\nconst gateGraph = new Graph({ directed: true, multigraph: false, compound: false })\n\n\u002F\u002F Nodes = gates\u002Fskills\u002Frules\ngateGraph.setNode('L0', { label: 'audit-log',         tier: 0 })\ngateGraph.setNode('L1', { label: 'anti-evasion',       tier: 1 })\ngateGraph.setNode('L2', { label: 'shell-sanitize',     tier: 2 })\ngateGraph.setNode('L3', { label: 'network-egress',     tier: 3 })\ngateGraph.setNode('tool-exec', { label: 'execute',     tier: 4 })\n\n\u002F\u002F Edges = \"must run before\"\ngateGraph.setEdge('L0', 'L1')    \u002F\u002F audit-log must be set up before anti-evasion\ngateGraph.setEdge('L1', 'L2')\ngateGraph.setEdge('L2', 'L3')\ngateGraph.setEdge('L3', 'tool-exec')\n\n\u002F\u002F Cycle detection — returns [] if DAG is valid, lists cycle nodes if broken\nconst cycles = alg.findCycles(gateGraph)\nif (cycles.length > 0) {\n  throw new Error(`Dependency cycle detected: ${cycles.map(c => c.join('→')).join(', ')}`)\n}\n\n\u002F\u002F Sources = nodes with no incoming edges (entry points)\nconst entryPoints = gateGraph.sources()   \u002F\u002F ['L0']\n\u002F\u002F Sinks   = nodes with no outgoing edges (terminal nodes)\nconst terminals   = gateGraph.sinks()     \u002F\u002F ['tool-exec']\n\n\u002F\u002F Reachability: all nodes reachable from L0\nconst reachable = alg.dijkstra(gateGraph, 'L0')\n\u002F\u002F reachable['tool-exec'].distance === 4\n\n\u002F\u002F Rule: always call alg.findCycles() before executing a gate graph — cycles = deadlock\n\u002F\u002F Rule: use gateGraph.sources() to find valid entry points, never hard-code 'L0'\n```\n\n---\n\n## Cycle Detection + BFS\u002FDFS (javascript-algorithms)\n\n```typescript\n\u002F\u002F BFS — shortest path in unweighted graph (level by level)\nfunction bfs(graph: Map\u003Cstring, string[]>, start: string): Map\u003Cstring, number> {\n  const distances = new Map\u003Cstring, number>([[start, 0]])\n  const queue = [start]\n\n  while (queue.length) {\n    const node = queue.shift()!\n    const neighbors = graph.get(node) ?? []\n\n    for (const n of neighbors) {\n      if (!distances.has(n)) {\n        distances.set(n, distances.get(node)! + 1)\n        queue.push(n)\n      }\n    }\n  }\n  return distances  \u002F\u002F distances.get(target) = hop count from start\n}\n\n\u002F\u002F DFS — cycle detection via visited + recursion stack\nfunction hasCycle(graph: Map\u003Cstring, string[]>): boolean {\n  const visited     = new Set\u003Cstring>()\n  const inStack     = new Set\u003Cstring>()\n\n  function dfs(node: string): boolean {\n    visited.add(node)\n    inStack.add(node)\n\n    for (const neighbor of graph.get(node) ?? []) {\n      if (!visited.has(neighbor) && dfs(neighbor)) return true\n      if (inStack.has(neighbor)) return true  \u002F\u002F back edge = cycle\n    }\n\n    inStack.delete(node)\n    return false\n  }\n\n  for (const node of graph.keys()) {\n    if (!visited.has(node) && dfs(node)) return true\n  }\n  return false\n}\n\n\u002F\u002F Dijkstra — weighted shortest path (e.g., skill load latency as weight)\nfunction dijkstra(graph: Map\u003Cstring, Array\u003C{ to: string; weight: number }>>, start: string) {\n  const dist = new Map\u003Cstring, number>([[start, 0]])\n  const pq: Array\u003C{ node: string; d: number }> = [{ node: start, d: 0 }]\n\n  while (pq.length) {\n    pq.sort((a, b) => a.d - b.d)\n    const { node, d } = pq.shift()!\n    if (d > (dist.get(node) ?? Infinity)) continue\n\n    for (const { to, weight } of graph.get(node) ?? []) {\n      const newDist = d + weight\n      if (newDist \u003C (dist.get(to) ?? Infinity)) {\n        dist.set(to, newDist)\n        pq.push({ node: to, d: newDist })\n      }\n    }\n  }\n  return dist\n}\n\n\u002F\u002F Rule: BFS for \"minimum hops\" questions, Dijkstra for weighted latency paths\n\u002F\u002F Rule: DFS inStack set must be reset on backtrack — missing this = false cycle reports\n```\n\n---\n\n## Topological Sort: Execution Order (toposort)\n\n```typescript\nimport toposort from 'toposort'\n\n\u002F\u002F Sort skills\u002Fscripts so dependencies run first\n\u002F\u002F Edge [A, B] means: A must run BEFORE B\nconst edges: [string, string][] = [\n  ['validate-manifest',  'build-release'],\n  ['run-tests',          'build-release'],\n  ['lint',               'run-tests'],\n  ['typecheck',          'run-tests'],\n  ['install-deps',       'lint'],\n  ['install-deps',       'typecheck'],\n]\n\n\u002F\u002F toposort returns nodes in reverse dep order (last dep first)\nconst executionOrder = toposort(edges).reverse()\n\u002F\u002F ['install-deps', 'lint', 'typecheck', 'run-tests', 'validate-manifest', 'build-release']\n\n\u002F\u002F With explicit node list (for isolated nodes with no edges)\nconst allNodes = ['install-deps', 'lint', 'typecheck', 'run-tests', 'validate-manifest', 'build-release', 'notify']\nconst fullOrder = toposort.array(allNodes, edges).reverse()\n\n\u002F\u002F Rule: always .reverse() — toposort returns reverse topological order by default\n\u002F\u002F Rule: toposort throws 'Cyclic dependency' on cycle — catch it, report the chain\ntry {\n  toposort(edges)\n} catch (e) {\n  if ((e as Error).message.includes('Cyclic')) {\n    throw new Error(`Build order has circular dependency: ${(e as Error).message}`)\n  }\n}\n```\n\n---\n\n## Semver Range Resolution (node-semver)\n\n```typescript\nimport semver from 'semver'\n\n\u002F\u002F Check if a version satisfies a range\nsemver.satisfies('1.3.45', '>=1.3.0 \u003C2.0.0')  \u002F\u002F true\nsemver.satisfies('2.0.0',  '>=1.3.0 \u003C2.0.0')  \u002F\u002F false\n\n\u002F\u002F Find the best version from a list that satisfies a range\nconst versions = ['1.2.0', '1.3.0', '1.3.44', '2.0.0', '2.1.0']\nsemver.maxSatisfying(versions, '^1.3.0')   \u002F\u002F '1.3.44'\nsemver.minSatisfying(versions, '^2.0.0')   \u002F\u002F '2.0.0'\n\n\u002F\u002F Resolve conflicting ranges from multiple skills\nfunction resolveConflicts(\n  requirements: Array\u003C{ skill: string; range: string }>\n): string | null {\n  \u002F\u002F Find intersection: a version satisfying ALL ranges\n  const intersection = requirements\n    .map(r => semver.validRange(r.range))\n    .filter(Boolean) as string[]\n\n  \u002F\u002F Try known versions against all constraints\n  return semver.maxSatisfying(\n    versions,\n    intersection.join(' ')  \u002F\u002F semver treats space as AND in ranges\n  )\n}\n\n\u002F\u002F Parse and compare\nconst v = semver.parse('1.3.45-beta.1')!\n\u002F\u002F v.major=1, v.minor=3, v.patch=45, v.prerelease=['beta', 1]\n\n\u002F\u002F Coerce messy version strings (e.g., from package.json non-standard values)\nsemver.coerce('v2.3.4-rc1')?.version  \u002F\u002F '2.3.4'\n\n\u002F\u002F Rule: use semver.validRange() before storing user-supplied ranges — throws on invalid\n\u002F\u002F Rule: space-join = AND intersection; || = OR union — never mix accidentally\n```\n\n---\n\n## PageRank: Rule Importance Scoring\n\n```typescript\n\u002F\u002F Power iteration PageRank — find most-referenced rules\u002Fskills\n\u002F\u002F A rule with many inbound links from other rules = high importance\n\nfunction pageRank(\n  graph: Map\u003Cstring, string[]>,   \u002F\u002F node → outbound neighbors\n  damping   = 0.85,\n  iterations = 50,\n  tolerance  = 1e-6\n): Map\u003Cstring, number> {\n  const nodes = [...graph.keys()]\n  const N     = nodes.length\n  let ranks   = new Map(nodes.map(n => [n, 1 \u002F N]))\n\n  for (let i = 0; i \u003C iterations; i++) {\n    const next = new Map\u003Cstring, number>()\n    let delta = 0\n\n    for (const node of nodes) {\n      \u002F\u002F Sum contributions from all nodes pointing to this one\n      let sum = 0\n      for (const [src, targets] of graph) {\n        if (targets.includes(node)) {\n          sum += (ranks.get(src) ?? 0) \u002F targets.length\n        }\n      }\n      const newRank = (1 - damping) \u002F N + damping * sum\n      next.set(node, newRank)\n      delta += Math.abs(newRank - (ranks.get(node) ?? 0))\n    }\n\n    ranks = next\n    if (delta \u003C tolerance) break  \u002F\u002F converged\n  }\n\n  return new Map([...ranks.entries()].sort((a, b) => b[1] - a[1]))\n}\n\n\u002F\u002F Example: rank YAMTAM rules by cross-reference frequency\nconst ruleRefs = new Map([\n  ['00-meta-rule-enforcer', ['agent-middleware-law', 'verification']],\n  ['agent-middleware-law',  ['shell-sanitize-law', 'network-egress-law']],\n  ['shell-sanitize-law',    ['00-meta-rule-enforcer']],\n  ['network-egress-law',    ['00-meta-rule-enforcer', 'agent-middleware-law']],\n  ['verification',          []],\n])\n\nconst importance = pageRank(ruleRefs)\n\u002F\u002F '00-meta-rule-enforcer' ranks highest — most inbound links\n\u002F\u002F Use: prune rarely-referenced rules, highlight critical ones in docs\n\n\u002F\u002F Rule: damping=0.85 is Google's original value — do not change without reason\n\u002F\u002F Rule: convergence check (delta \u003C tolerance) prevents over-iteration on small graphs\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ No cycle check before executing dependency graph (deadlock on first cycle)\n❌ DFS without inStack set (can't distinguish visited from in-current-path)\n❌ toposort result not .reverse()'d (execution order is backwards)\n❌ semver.satisfies() on un-validated range string (throws on malformed range)\n❌ Space-joined semver ranges confused with OR union (space = AND, || = OR)\n❌ PageRank without convergence check (fixed iteration on large graphs = wrong)\n❌ graphlib.alg.findCycles() skipped before graph traversal (silent infinite loop)\n```\n",{},"main","481dcd7dd2e288b9d627a2bd017db70e64e6c6fa","core\u002Fskills\u002Fgraph-dependency-resolution",2,"https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI","https:\u002F\u002Fyana.vutam.link\u002F","https:\u002F\u002Fgithub.com\u002FHoronomos-laps","https:\u002F\u002Fyana.vutam.link","An open-source governed runtime & execution environment for multi-agent AI systems.","2026-11-14 13:24:09",{"source":7,"skillName":5,"commands":34,"prompt":44,"zipAvailable":45},[35,38,41],{"tool":36,"command":37},"npx","npx skills add Horonomos-laps\u002FYana-AI --skill graph-dependency-resolution",{"tool":39,"command":40},"bunx","bunx skills add Horonomos-laps\u002FYana-AI --skill graph-dependency-resolution",{"tool":42,"command":43},"pnpm","pnpm dlx skills add Horonomos-laps\u002FYana-AI --skill graph-dependency-resolution","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fgraph-dependency-resolution\u002FSKILL.md",true,[],[48,56,63,71,79,87],{"skillNo":49,"name":50,"nameZh":6,"description":51,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":52,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":18},"01M735GKET5YVYKAY62W2P5YXB","openai--sentry--sentry","Use when the user asks to inspect Sentry issues or events, summarize recent production errors, or pull basic Sentry health data via the Sentry API; perform read-only queries with the bundled script and require `SENTRY_AUTH_TOKEN`.","MIT","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fopenai--sentry--sentry\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":18},"01M73DCAP83T17HY7SMGK7MGFE","ito-basket-compare","Compare Itô prediction-market baskets against a user's knowledge base, portfolio notes, financial context, watchlist, or research thesis. Use for read-only basket comparison and gap analysis without investment advice or live trading.","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fito-basket-compare\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":67,"sourceHtmlUrl":68,"categories":69,"keywords":70,"publishedAt":18},"01M734CYEMZFDR3KH6SW0JP8TD","implementing-network-traffic-baselining","Build network traffic baselines from NetFlow\u002FIPFIX data using Python pandas for statistical analysis, z-score anomaly detection, and hourly\u002Fdaily traffic pattern profiling","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FSKILL.md",[],[],{"skillNo":72,"name":73,"nameZh":6,"description":74,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":75,"sourceHtmlUrl":76,"categories":77,"keywords":78,"publishedAt":18},"01M73ASZ6NJRJM44Z2P84NGQ3Q","detecting-evasion-techniques-in-endpoint-logs","Detects defense evasion techniques used by adversaries in endpoint logs including log tampering, timestomping, process injection, and security tool disabling. Use when investigating suspicious endpoint behavior, building detection rules for evasion tactics, or conducting threat hunting for stealthy adversary activity. Activates for requests involving evasion detection, defense evasion analysis, log tampering detection, or MITRE ATT&CK TA0005.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FSKILL.md",[],[],{"skillNo":80,"name":81,"nameZh":6,"description":82,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":83,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M734AFNXD06Z78QRK0VKGT7Q","implementing-microsegmentation-with-guardicore","Implementing microsegmentation using Akamai Guardicore Segmentation to map application dependencies, create granular network policies, visualize east-west traffic flows, and enforce least-privilege communication between workloads across data centers and cloud.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":90,"categories":91,"keywords":92,"publishedAt":18},"01M736TK27QMCXK0DVCH25SJN5","ramdisk-tmpfs-patterns","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Framdisk-tmpfs-patterns\u002FSKILL.md",[],[]]