affaan-m/ecc

social-graph-ranker

Weighted social-graph ranking for warm intro discovery, bridge scoring, and network gap analysis across X and LinkedIn.

查看源码

使用方法

  1. 复制安装命令,在自己的智能体环境安装前先检查源码包。
  2. 从原始文档核对所需工具、凭据和支持的宿主。
  3. 说明输入材料与期望交付物,并对照来源检查输出。
npx skills add https://github.com/affaan-m/ecc --skill social-graph-ranker

开始前需了解

  • 安装不包含模型订阅、API 额度或访问文件的权限。
  • 仓库星数和安装量反映活跃情况,不等于独立质量或安全测试。
仓库原始内容

按源仓库内容呈现,保留标题、案例、代码、表格、链接以及原文引用的演示图片。

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-intelligence or connections-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 set
  • M = your current mutuals / direct connections
  • d(m, t) = shortest hop distance from mutual m to target t
  • w(t) = target weight from signal scoring

Base bridge score:

text
B(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)

Where:

  • λ is the decay factor, usually 0.5
  • a direct path contributes full value
  • each extra hop halves the contribution

Second-order expansion:

text
B_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))

Where:

  • N(m) \\ M is the set of people the mutual knows that you do not
  • α discounts second-order reach, usually 0.3

Response-adjusted final ranking:

text
R(m) = B_ext(m) · (1 + β · engagement(m))

Where:

  • engagement(m) is normalized responsiveness or relationship strength
  • β is the engagement bonus, usually 0.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

  1. Build the weighted target set.
  2. Pull the user's graph from X, LinkedIn, or both.
  3. Compute direct bridge scores.
  4. Expand second-order candidates for the highest-value mutuals.
  5. Rank by R(m).
  6. Return:
  • best warm intro asks
  • conditional bridge paths
  • graph gaps where no warm path exists

Output Shape

text
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-intelligence uses this ranking model inside the broader target-discovery and outreach pipeline
  • connections-optimizer uses the same bridge logic when deciding who to keep, prune, or add
  • brand-voice should run before drafting any intro request or direct outreach
  • x-api provides X graph access and optional execution paths

按任务相关推荐

来自同一仓库

更多 Skills

全部 Skills
affaan-m
社区

agentic-os

Build persistent multi-agent operating systems on Claude Code. Covers kernel architecture, specialist agents, slash commands, file-based memory, scheduled automation, and state management without external databases. Use when building a persistent multi-agent system on Claude Code with its own memory, commands, and scheduling.

安装量
4
GitHub Stars
28.6万
最近更新
10月20日
affaan-m
社区

autonomous-loops

Patterns and architectures for autonomous Claude Code loops — from simple sequential pipelines to RFC-driven multi-agent DAG systems. Retained for compatibility only: when new autonomous loop guidance is needed, use continuous-agent-loop instead.

安装量
4
GitHub Stars
28.6万
最近更新
10月20日
affaan-m
社区

coding-standards

Baseline cross-project coding conventions for naming, readability, immutability, and code-quality review. Use detailed frontend or backend skills for framework-specific patterns. Use when reviewing code quality or naming with no framework-specific skill that applies.

安装量
4
GitHub Stars
28.6万
最近更新
10月20日
affaan-m
社区

configure-ecc

Run the conversational ECC setup wizard inside the current harness: inventory the install, collect scope (user/project/local) and hook mode (off/minimal/standard/strict) in Claude Code, use Codex's native plugin lifecycle, or install the project surface under ./.kimi-code, then preview, apply, and verify. Use when installing, updating, reconfiguring, or repairing an ECC installation, changing hook profiles, or moving ECC between install scopes.

安装量
4
GitHub Stars
28.6万
最近更新
10月20日