Live survey304 models · 14 providers · 22,792 auditsAudited grill-with-docs · SAFE →What changedHow we verifyllms.txt

Agent skill · Audited from source

Call Graph Similarity Analysis Using Graph Edit Distance

skill · ECNU-ICALK/AutoSkillLicence not declaredAudited 14 Oct 2026 · source 04e912cff54b

★ 602pushed 157 days agoversion 0.1.0
✓SAFEGrade B · 89/100 · 14 Oct 2026 · 04e912c
602repo stars · whole ECNU-ICALK/AutoSkill

Is it safe? Yes — SAFE, grade B (89/100). We read this skill's source at commit 04e912cff54b and found no filesystem, network or shell access and no hard-coded secrets. What it does: Converts provided source code snippets into call graphs and calculates their similarity score using the Graph Edit Distance (GED) algorithm.

Ask an AI about this pageGChatGPTCClaudePPerplexityGeGeminiXGrok
More
Cite

Cite this page

ModelsAtlas. “Call Graph Similarity Analysis Using Graph Edit Distance (ECNU-ICALK/AutoSkill)”. Retrieved 14 Oct 2026. https://modelsatlas.com/skills/ecnu-icalk/call-graph-similarity-analysis-using-graph-edit-distance

Trust audit

Audit 0.4.1 · source read 14 Oct 2026

Trust score89/100✓SAFE B
0 critical0 high0 medium0 low0 info

SAFE means nothing in the source contradicts what the skill says it does. Grade B is shared by 16,667 of 17,602 audited skills.

What the source does

  • FilesystemNone observedNo reads or writes in the source
  • NetworkNone observedNo outbound calls in the source
  • ShellNone observedNo commands run in the source
  • DependenciesPinnedNothing floats
  • SecretsNone foundNo keys in source

Five audit layers

LayerWhat we checkResultFindings
L0 ProvenanceRepo owner, licence, archive status, activityPASS0
L1 Static sourceSecrets, path traversal, supply chain, hidden codeNA0
L2 InstructionsPrompt injection, authority framing, hidden directivesPASS0
L3 InventoryThe files and declarations match the sourcePASS0
L4 SandboxRun in isolation and watch behaviourSKIPPED why0

Gates applied: no behavioural pass.

Findings (0)

No findings at any severity. We re-audit when the source changes.

Audit 0.4.1 · source sha 04e912cff54b · 14 Oct 2026Report an issue or request a re-scan

Provenance

Who published it, and what the verdict is pinned to

What it tells the agent

Full source on GitHub ↗

Its description: Converts provided source code snippets into call graphs and calculates their similarity score using the Graph Edit Distance (GED) algorithm.

---
id: "42b54b29-c111-4e6f-a4c9-14e550efb69f"
name: "Call Graph Similarity Analysis using Graph Edit Distance"
description: "Converts provided source code snippets into call graphs and calculates their similarity score using the Graph Edit Distance (GED) algorithm."
version: "0.1.0"
tags:
  - "call graph"
  - "graph edit distance"
  - "source code"
  - "similarity"
  - "code analysis"
triggers:
  - "convert source code to call graphs and calculate similarity"
  - "apply graph edit distance to call graphs"
  - "measure similarity score of two source codes using graph edit distance"
---

# Call Graph Similarity Analysis using Graph Edit Distance

Converts provided source code snippets into call graphs and calculates their similarity score using the Graph Edit Distance (GED) algorithm.

## Prompt

# Role & Objective
You are a code analysis expert. Your task is to take two source code snippets, convert them into call graphs, and calculate the similarity score between these graphs using the Graph Edit Distance (GED) method.

# Operational Rules & Constraints
1. Parse the provided source code to identify functions and their calls.
2. Construct a directed call graph for each source code snippet.
3. Apply the Graph Edit Distance (GED) algorithm to measure the similarity between the two generated call graphs.
4. Report the calculated distance value, explaining that it represents the minimum number of edit operations (insertions, deletions, substitutions) required to transform one graph into the other.

# Anti-Patterns
Do not use Jaccard similarity or other coefficients unless explicitly requested. Do not analyze images directly if source code is provided.

## Triggers

- convert source code to call graphs and calculate similarity
- apply graph edit distance to call graphs
- measure similarity score of two source codes using graph edit distance

Excerpt, first 1,867 characters of SKILL.md, verbatim from the audited commit. It is text from someone else’s repository, quoted so you can judge it before your agent reads it.

Install

Pinned to the audited commit 04e912c

Download folder ↗
git clone https://github.com/ECNU-ICALK/AutoSkill
git -C AutoSkill checkout 04e912cff54b

The author documents no install command, so this uses the repository directly. Our verdict covers commit 04e912cff54b only.

Works in

The author has not said which agents this skill supports, and we have not tested it in any.

Audit history

Every audit, every source change

  1. ✓SAFE B 89 / 100

    first audit · source 04e912cff54b

Similar skills

Questions about Call Graph Similarity Analysis Using Graph Edit Distance

What does the Call Graph Similarity Analysis Using Graph Edit Distance skill do?
AutoSkill: Experience-Driven Lifelong Learning via Skill Self-Evolution
Is Call Graph Similarity Analysis Using Graph Edit Distance safe to install?
The audit found nothing in the source that contradicts what it says it does, and graded it B (89/100). Grade A is held back for packages that have also passed a sandboxed behavioural run, which is why a clean skill reads B.
What can Call Graph Similarity Analysis Using Graph Edit Distance access on my machine?
The audit observed no filesystem, network or shell use at all in its source.
How current is this page?
The grade is for one exact copy of the source (04e912cff54b), read on 2026-10-14. The repository is watched, and a new audit runs when it changes — this is the first audit.

Sources

Spotted something wrong? Report a correction · Methodology

Keep going in your AI

Opens with this page as the source. We add nothing else to the prompt.