quipu_project
Project a knowledge graph and run graph algorithms like PageRank, community detection, stats, components, or shortest paths, optionally restricted by node type or predicate.
Instructions
Project the knowledge graph and run a graph algorithm over it: stats (node/edge counts), in_degree (most-referenced entities), pagerank/ppr (global or personalized PageRank from seed entities), components (weakly-connected components), louvain (modularity community detection), or shortest_path. Optionally restrict the projection to a node type or predicate. Read-only by default; louvain with persist:true writes quipu:memberOfCommunity facts (superseding any prior derivation).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | Target entity IRI for shortest_path | |
| from | No | Source entity IRI for shortest_path | |
| type | No | Restrict the projection to nodes of this rdf:type IRI | |
| graph | No | Project ONE named graph's own facts instead of ROOT (quipu-tz5) — cheap against a small derived layer even when the episode log is large | |
| limit | No | Max results for in_degree/pagerank (default: 20) | |
| seeds | No | Seed entity IRIs (or raw term IDs) for personalized PageRank; non-empty switches pagerank to PPR | |
| damping | No | PageRank damping factor (default: 0.85) | |
| persist | No | louvain only: persist quipu:memberOfCommunity facts (emergent clustering, NOT an access boundary), bitemporally superseding any prior derivation (default: false) | |
| algorithm | No | Algorithm to run (default: stats) | |
| max_iters | No | PageRank max iterations (default: 100) | |
| predicate | No | Restrict the projection to edges with this predicate IRI | |
| timestamp | No | Timestamp used for persisted community assignments. | |
| tolerance | No | PageRank convergence tolerance (default: 1e-6) |