ayeshakhalid192007-dev/graph-engineering-crash-course

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

An example Claude Code skill demonstrating this pattern.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Folds two surface names for the same backend system into one canonical entity, keeping every original mention individually retrievable, and refuses to merge pairs that only share spelling.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Consults a check that sits outside the loop system before finalizing any decision the frozen facts bear on, and refuses every attempt by a loop to rewrite a node marked frozen, regardless of how convergent the loop's own reasoning looks.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Detects when two loops have proposed conflicting writes to the same node and field at close to the same time, applies a stated priority rule to accept exactly one, and records the rejected write with the reason it lost.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Reviews a full set of the main loop's outputs together, from a wider vantage than any single one of them, looking specifically for cross-item patterns that a one-item-at-a-time loop is structurally unable to notice.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Trims a task-scoped candidate subgraph down to a hard node-count budget, keeping the anchor plus the highest-relevance nodes, dropping any edge that touches a dropped node, and recording the exact cutoff score used.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Turns a diff's touched functions and modules into graph nodes, reusing entities the graph already tracks, and links the change itself to each one with a modifies edge.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Scores candidate merge pairs on weighted signals and auto-merges only pairs clearing a stated threshold, routing the rest to a review queue with their score and signal breakdown attached.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Assembles a task-scoped bundle that keeps two contradicting claims visible side by side and tagged unresolved, rather than silently picking a winner before the worker or a human reviewer ever sees the disagreement.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Scans the fact graph for pairs of edges that cannot both hold true at once and flags each such pair, running as its own standing pass rather than as part of whatever task happens to be reading the graph.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Extracts factual assertions from a conversation transcript into provisional, unresolved claim nodes, flagging hedged language rather than smoothing it into stated fact.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Compares a watched loop's headline reading against an independently owned counter-metric reading for each period in a governance graph, and produces a governance edge for every period where the counter-metric crosses its recorded ceiling.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Extracts Service/Incident/Cause facts from an incident-report document against a fixed schema, rejecting anything the schema doesn't define.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Blocks a loop's proposed "done" signal for a task until the grounded checker's run log shows it actually ran against that exact task, returning a named block instead of a silent pass when the check is missing or mismatched.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Turns a proposed addition to a JSON-file graph into a minimal, reviewable diff, flagging any proposed edge that conflicts with a cross-reference already on file, and never writing directly to the shared graph file itself.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Builds the (change, touches, module) triple a "change does not touch module" claim implies, searches the populated graph's own edge list for that exact subject/predicate/object combination, and reports ACCEPT or REJECT naming the edge it relied on.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Expresses a multi-hop lineage question as a single variable-length path match against native graph storage, bounded by an explicit hop depth and an explicit relationship-type allowlist, instead of a recursive relational join that grows one level per hop.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Wraps every write to a shared graph edge in a transaction tied to the exact row version it was computed against, and retries a rejected write against the row's current state instead of dropping it or blindly reapplying stale values.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Attaches sourcedoc/extractionrunid/schemaversion receipts to every edge at write time, and refuses to write any edge missing one of the three.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Rechecks each past merge in the graph's history against evidence gathered since, reversing any merge new evidence directly contradicts and logging an explicit confirmation for every merge that still holds.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Loads schema.sql into a local SQLite file, then answers availability and provenance questions against the nodes/edges tables with real SQL instead of re-reading source material.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Corrects a wrong claim by adding a new node holding the correction and a supersedes edge back to the old node, which stays in the graph flagged stale rather than being edited or deleted.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Traverses a full graph and returns a bounded subgraph around one target node -- its depth-bounded dependencies plus any disputed claims attached to it -- while proving everything else was left out.

ayeshakhalid192007-dev/graph-engineering-crash-course

Skill Claude CodeCodex

Maps every schema version an extraction pipeline has used to the run IDs performed under it, assigning each run by date against each schema's introduction date, so schema drift is a logged fact rather than an invisible shift.