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.