social-graph-ranker
通过加权社交图谱排名发现熟人引荐机会、进行桥接评分,并分析 X 和 LinkedIn 上的网络缺口。适用于需要可复用图谱排名引擎本身,而非叠加其上的更广泛外联或人脉维护流程。
译文已校对查看英文原文
Weighted social-graph ranking for warm intro discovery, bridge scoring, and network gap analysis across X and LinkedIn. Use when the user wants the reusable graph-ranking engine itself, not the broader outreach or network-maintenance workflow layered on top of it.
适用对象:对象待分类。自动收录 · 待核查。
原作者说明节选
从固定版本的 SKILL.md 提取,保留原文语言。以下内容属于作者说明,本站尚未验证安装、兼容或运行结果。
查看英文原文
原文涵盖的主题
- Social Graph Ranker
- When To Use This Standalone
- Inputs
- Core Model
- Scoring Signals
- Workflow
- Output Shape
- Related Skills
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 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 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 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)
这里只展示节选,请以完整原文和当前要求为准。
- 来源仓库
- affaan-m/ECC
- 源文件
- skills/social-graph-ranker/SKILL.md
- 固定版本
- d2ef2680594f9a17526a6e1a2e18b3d242c5d17b
来源与内容状态
本条为自动发现的元数据,尚未完成人工文档核查;适用性与运行结果待核查。
原作者:affaan-m/ECC · 原作者仓库元数据。文档核查:未核查。最近来源检查:2026-11-09T16:01:00.553Z。
分类由名称、说明与路径规则生成,分类不代表已核实适配。
许可与权利归属
MIT。第三方内容及版权归原作者,使用条件以原文为准。
许可原文 ↗本站没有因同步、复制或用户自报成功而将资源标为运行验证通过。
限制与注意事项
- 元数据收录不代表本站已经安装、适配、实测或进行安全审查。