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 LeoLin990405/r-analytics-skill --skill tidygraphgit clone --depth 1 https://github.com/LeoLin990405/r-analytics-skillWrote 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/leolin990405/r-analytics-skill/tidygraph)<a href="https://agentmods.dev/skills/leolin990405/r-analytics-skill/tidygraph"><img src="https://agentmods.dev/badge/skills/leolin990405/r-analytics-skill/tidygraph/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/leolin990405/r-analytics-skill/tidygraph"><img src="https://agentmods.dev/badge/skills/leolin990405/r-analytics-skill/tidygraph.svg" alt="Reviewed on agentmods" width="80" 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.00024 | $0.00495 |
| Opus 5 | $0.00012 | $0.00247 |
| Sonnet 5 | $0.00005 | $0.00099 |
| Haiku 4.5 | $0.00002 | $0.00049 |
Grade A, and why
tidygraph 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 9d 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.
What it actually says
tidygraph Package
Tidy API for graph/network manipulation.
Create Graph
library(tidygraph)
# From data frames
graph <- tbl_graph(nodes = nodes_df, edges = edges_df)
# From igraph
graph <- as_tbl_graph(igraph_obj)
# Built-in graphs
graph <- play_erdos_renyi(100, 0.1)
graph <- create_ring(10)
graph <- create_tree(15, 2)
Activate Context
# Switch between nodes and edges
graph %>%
activate(nodes) %>%
mutate(degree = centrality_degree())
graph %>%
activate(edges) %>%
filter(weight > 0.5)
Node Operations
graph %>%
activate(nodes) %>%
mutate(
degree = centrality_degree(),
betweenness = centrality_betweenness(),
pagerank = centrality_pagerank(),
community = group_louvain()
) %>%
filter(degree > 5) %>%
arrange(desc(betweenness))
Edge Operations
graph %>%
activate(edges) %>%
mutate(
centrality = centrality_edge_betweenness()
) %>%
filter(!edge_is_multiple()) %>%
arrange(desc(weight))
Graph Operations
# Convert
graph %>% to_undirected()
graph %>% to_simple()
# Subgraph
graph %>%
activate(nodes) %>%
filter(group == 1) %>%
activate(edges) %>%
filter(!edge_is_incident(node_is_isolated()))
Morphing
# Temporarily change structure
graph %>%
morph(to_components) %>%
mutate(comp_size = graph_order()) %>%
unmorph()
# Other morphs
to_subgraph()
to_contracted()
to_linegraph()
With ggraph
library(ggraph)
graph %>%
ggraph(layout = "fr") +
geom_edge_link() +
geom_node_point(aes(size = degree))
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.
- 9d ago First seen · 107 lines · 24 tokens per session scan A 93617601c6f1
tidygraph is a skill published in the GitHub repository LeoLin990405/r-analytics-skill (5 stars, last pushed 6mo ago), licensed MIT. It adds 24 tokens to every session and 495 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
bio-applied-molecular-evolution
Test Hardy-Weinberg equilibrium, simulate Wright-Fisher drift/selection, and compute dN/dS, Tajima's D, and Fst with NumPy/SciPy. Use for neutral theory, molecular clock divergence time, selection scans, or effective population size (Ne) questions.
advanced-string-structures
Build tries, Aho-Corasick, and suffix arrays with Kasai LCP to index DNA/text and match many patterns in one pass. Use for genome motif scanning, k-mer indexing, longest-repeat search, or BWA/FM-index groundwork.
ai-science-esm2-embeddings
Generate ESM2 protein embeddings (fair-esm/transformers) and predict structure with ESMFold. Use when embedding sequences, scoring mutations zero-shot, annotating protein function, or doing fast MSA-free structure prediction.
ai-science-geneformer-scgpt
Tokenize scRNA-seq via Geneformer gene-rank or scGPT expression-bin encoding; annotate cell types, simulate in-silico knockouts. Use for foundation-model cell annotation, Geneformer/scGPT tokenization, or perturbation prediction.
ai-science-zero-shot-mutation
Score protein point mutations zero-shot with ESM-1v/ESM-2 masked-LM log-odds, ensembled, benchmarked on ProteinGym DMS. Use when predicting mutation effects, ranking missense variants, scoring VUS fitness with no labels.
bio-applied-advanced-ngs
Assemble genomes de novo: greedy OLC, de Bruijn graph/Eulerian path, N50/L50/NG50 stats, SPAdes/Flye/hifiasm CLI usage. Use when choosing k-mer size, picking an assembler for Illumina/ONT/HiFi reads, or scoring contiguity.