Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add cxcscmu/SkillLearnBench --skill greedy-matching-evaluationgit clone --depth 1 https://github.com/cxcscmu/SkillLearnBenchWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/cxcscmu/skilllearnbench/greedy-matching-evaluation)<a href="https://agentmods.dev/skills/cxcscmu/skilllearnbench/greedy-matching-evaluation"><img src="https://agentmods.dev/badge/skills/cxcscmu/skilllearnbench/greedy-matching-evaluation.svg" alt="Measured on agentmods" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00028 | $0.00591 |
| Opus 5 | $0.00014 | $0.00296 |
| Sonnet 5 | $0.00006 | $0.00118 |
| Haiku 4.5 | $0.00003 | $0.00059 |
Grade A, and why
greedy-matching-evaluation scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 3d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 63 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Greedy Matching for Clustering Evaluation
To evaluate clustering performance against ground truth (expert) points, we need to match predicted centroids to expert points.
Algorithm
- Compute all pairwise standard Euclidean distances between predicted centroids and expert points.
- Filter pairs with distance >
max_dist(e.g., 100 pixels). - Sort remaining pairs by distance (closest first).
- Iteratively pick the closest pair, ensuring each centroid and each expert point is matched at most once.
F1 Score Calculation
- True Positives (TP): Number of matched pairs.
- False Positives (FP): Number of unmatched predicted centroids.
- False Negatives (FN): Number of unmatched expert points.
Precision = TP / (TP + FP)Recall = TP / (TP + FN)F1 = 2 * (Precision * Recall) / (Precision + Recall)(Handle division by zero)
Python Implementation
import numpy as np
from scipy.spatial.distance import cdist
def evaluate_clustering(centroids, experts, max_dist=100):
if len(centroids) == 0:
return 0.0, np.nan
if len(experts) == 0:
return 0.0, np.nan
distances = cdist(centroids, experts, metric='euclidean')
# Greedy matching
indices = np.where(distances <= max_dist)
pairs = sorted(zip(indices[0], indices[1]), key=lambda x: distances[x[0], x[1]])
matched_centroids = set()
matched_experts = set()
match_distances = []
for c_idx, e_idx in pairs:
if c_idx not in matched_centroids and e_idx not in matched_experts:
matched_centroids.add(c_idx)
matched_experts.add(e_idx)
match_distances.append(distances[c_idx, e_idx])
tp = len(matched_centroids)
fp = len(centroids) - tp
fn = len(experts) - tp
precision = tp / (tp + fp) if (tp + fp) > 0 else 0
recall = tp / (tp + fn) if (tp + fn) > 0 else 0
f1 = 2 * precision * recall / (precision + recall) if (precision + recall) > 0 else 0
avg_delta = np.mean(match_distances) if len(match_distances) > 0 else np.nan
return f1, avg_delta
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 3d ago First seen · 63 lines · 28 tokens per session scan A b5925a171c01
greedy-matching-evaluation is a skill published in the GitHub repository cxcscmu/SkillLearnBench (83 stars, last pushed 1mo ago), licensed MIT. It adds 28 tokens to every session and 591 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-09-03.
Other skills, from other repositories
rdkit
Cheminformatics toolkit for fine-grained molecular control. SMILES/SDF parsing, descriptors (MW, LogP, TPSA), fingerprints, substructure search, 2D/3D generation, similarity, reactions. For standard workflows with simpler interface, use datamol (wrapper around RDKit). Use rdkit for advanced control, custom…
logistics-rules-to-optimization
Translate logistics and operations rules into optimization variables and constraints. Use when an operations problem describes vehicles, routes, depots, pickups, dropoffs, inventory, capacity, assignments, time windows, service targets, penalties, resource limits, or other business rules that need to become an…
mip-solver-and-solution-audit
Operational workflow for hard integer-programming optimization tasks: selecting an installed solver, preserving solver/incumbent certificates, extracting feasible schedules, recomputing metrics from final outputs, and writing consistent reports. Use when a task requires a MIP, solver status, objective value, bound…
lab-unit-harmonization
Comprehensive clinical laboratory data harmonization for multi-source healthcare analytics. Convert between US conventional and SI units, standardize numeric formats, and clean data quality issues. This skill should be used when you need to harmonize lab values from different sources, convert units for clinical…
routing-subtour-elimination
Subtour-elimination methods for TSP, VRP, pickup/dropoff routing, and routing MIPs with binary arc variables. Use when route-continuity constraints may permit disconnected cycles and the model needs MTZ constraints, flow-based connectivity constraints, DFJ subset cuts, or lazy/iterative subtour cuts.
seisbench-model-api
An overview of the core model API of SeisBench, a Python framework for training and applying machine learning algorithms to seismic data. It is useful for annotating waveforms using pretrained SOTA ML models, for tasks like phase picking, earthquake detection, waveform denoising and depth estimation. For any waveform…