Install
$ agentstack add skill-affaan-m-ecc-social-graph-ranker ✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.
Security review
✓ PassedNo issues found. Passed automated security review. · v0.1.0 How review works →
- ✓ Prompt-injection patterns
- ✓ Secret / credential exfiltration
- ✓ Dangerous shell & filesystem operations
- ✓ Untrusted network calls
- ✓ Known-malicious package signatures
What it can access
- ✓ Network access No
- ✓ Filesystem access No
- ✓ Shell / process execution No
- ✓ Environment & secrets No
- ✓ Dynamic code execution No
From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.
Verified badge
Passed review? Show it. Paste this badge into your README, it links to the public security report.
Reliability & compatibility
Declared compatibility
Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.
We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.
How agent discovery & health will work →About
Social Graph Ranker
Canonical weighted graph-ranking layer for network-aware outreach.
Use this when the user needs to:
- rank existing mutuals or connections by intro value
- map warm paths to a target list
- measure bridge value across first- and second-order connections
- decide which targets deserve warm intros versus direct cold outreach
- understand the graph math independently from
lead-intelligenceorconnections-optimizer
When To Use This Standalone
Choose this skill when the user primarily wants the ranking engine:
- "who in my network is best positioned to introduce me?"
- "rank my mutuals by who can get me to these people"
- "map my graph against this ICP"
- "show me the bridge math"
Do not use this by itself when the user really wants:
- full lead generation and outbound sequencing -> use
lead-intelligence - pruning, rebalancing, and growing the network -> use
connections-optimizer
Inputs
Collect or infer:
- target people, companies, or ICP definition
- the user's current graph on X, LinkedIn, or both
- weighting priorities such as role, industry, geography, and responsiveness
- traversal depth and decay tolerance
Core Model
Given:
T= weighted target setM= your current mutuals / direct connectionsd(m, t)= shortest hop distance from mutualmto targettw(t)= target weight from signal scoring
Base bridge score:
B(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)
Where:
λis the decay factor, usually0.5- a direct path contributes full value
- each extra hop halves the contribution
Second-order expansion:
B_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))
Where:
N(m) \\ Mis the set of people the mutual knows that you do notαdiscounts second-order reach, usually0.3
Response-adjusted final ranking:
R(m) = B_ext(m) · (1 + β · engagement(m))
Where:
engagement(m)is normalized responsiveness or relationship strengthβis the engagement bonus, usually0.2
Interpretation:
- Tier 1: high
R(m)and direct bridge paths -> warm intro asks - Tier 2: medium
R(m)and one-hop bridge paths -> conditional intro asks - Tier 3: low
R(m)or no viable bridge -> direct outreach or follow-gap fill
Scoring Signals
Weight targets before graph traversal with whatever matters for the current priority set:
- role or title alignment
- company or industry fit
- current activity and recency
- geographic relevance
- influence or reach
- likelihood of response
Weight mutuals after traversal with:
- number of weighted paths into the target set
- directness of those paths
- responsiveness or prior interaction history
- contextual fit for making the intro
Workflow
- Build the weighted target set.
- Pull the user's graph from X, LinkedIn, or both.
- Compute direct bridge scores.
- Expand second-order candidates for the highest-value mutuals.
- Rank by
R(m). - Return:
- best warm intro asks
- conditional bridge paths
- graph gaps where no warm path exists
Output Shape
SOCIAL GRAPH RANKING
====================
Priority Set:
Platforms:
Decay Model:
Top Bridges
- mutual / connection
base_score:
extended_score:
best_targets:
path_summary:
recommended_action:
Conditional Paths
- mutual / connection
reason:
extra hop cost:
No Warm Path
- target
recommendation: direct outreach / fill graph gap
Related Skills
lead-intelligenceuses this ranking model inside the broader target-discovery and outreach pipelineconnections-optimizeruses the same bridge logic when deciding who to keep, prune, or addbrand-voiceshould run before drafting any intro request or direct outreachx-apiprovides X graph access and optional execution paths
Source & license
This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.
- Author: affaan-m
- Source: affaan-m/ECC
- License: MIT
- Homepage: https://ecc.tools
Install and usage instructions live in the source repository linked above.
Reviews
No reviews yet, be the first.
Write a review
Versions
- v0.1.0 Imported from the upstream source.