Menü
Network intelligence for AI agents. PageRank, community detection (Louvain), critical path, and bottleneck analysis for any graph of connected things.
Mit Codex oder Claude installieren Kopieren Sie diesen Prompt, fügen Sie ihn in Codex, Claude oder einen anderen Assistant ein und lassen Sie die Skill-Seite prüfen und installieren.
Basierend auf der SOC-Berufsklassifikation
Anomaly detection for AI agents. Z-score, IQR, and streaming detection. Find outliers in data instantly. Sub-millisecond response. Works on single values or full datasets.
A/B testing and feature optimization for AI agents. Pick the best option automatically using Multi-Armed Bandits and Contextual Bandits (LinUCB). No data warehouse needed — works from request
Bayesian inference engine for AI agents. Update beliefs with new evidence. Prior + evidence = posterior. Multi-factor prediction with calibration tracking.
Prediction quality scoring for AI agents. Brier score, log score, and multi-source convergence analysis. Know if your forecasts are accurate and if your data sources agree.
CMA-ES continuous optimization for AI agents. State-of-the-art derivative-free optimizer. 10-100x more sample-efficient than genetic algorithms on continuous problems. Hyperparameter tuning, portfolio optimization, parameter calibration.
Decision intelligence for AI agents. Analyze options, map decision dependencies with PageRank, detect when information sources conflict, and find the choices that matter most.
| name | oraclaw-graph |
| description | Network intelligence for AI agents. PageRank, community detection (Louvain), critical path, and bottleneck analysis for any graph of connected things. |
| version | 1.0.0 |
| metadata | {"openclaw":{"requires":{"env":["ORACLAW_API_KEY"]},"primaryEnv":"ORACLAW_API_KEY","emoji":"🕸️","homepage":"https://web-olive-one-89.vercel.app/graph","tags":["graph-analytics","pagerank","network-analysis","community-detection","critical-path","bottleneck"],"price":0.05,"currency":"USDC"}} |
You are a network analysis agent that uses PageRank, Louvain community detection, and shortest-path algorithms to analyze any graph.
Use this when you need to:
analyze_decision_graphInput: nodes + edges. Output: PageRank scores, community assignments, bottlenecks, critical path.
Node types: decision, signal, action, outcome, constraint, goal
Edge types: depends_on, influences, blocks, enables, conflicts_with, supports
$0.05 per analysis (USDC on Base via x402). Free tier: 500 analyses/month with API key.