[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M70H7SMDDSX01M5WKNCFDEV2":3,"skill-same:01M70H7SMDDSX01M5WKNCFDEV2":73},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":23,"publishedAt":44,"linkOnly":45,"markdownContent":46,"markdownBody":47,"frontMatter":48,"refName":51,"commitSha":52,"skillDirectory":53,"forksCount":54,"repositoryHtmlUrl":55,"repositoryHomepageUrl":6,"ownerHtmlUrl":56,"ownerBlogUrl":6,"ownerDescription":57,"updatedAt":58,"install":59,"resources":72},"01M70H7SMDDSX01M5WKNCFDEV2","social-graph-ranker",null,"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.","mdnaimul22\u002Fhuman-skills","mdnaimul22","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F64520358?v=4","01M70FH95MH2H796Q01TYSFZ03","Naimul","01M70FH96798CQR4YHA13F17GA",3,"MIT","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Faffaan-m_ECC\u002Fsocial-graph-ranker\u002FSKILL.md",[18],{"categoryNo":19,"categoryName":20,"taxonomyType":21,"taxonomyTypeDesc":22},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43],"graph","social graph ranker","social","when","workflow","for","top","ranking","gap analysis","across","scoring","reusable","use","bridge","linkedin","intro","engine","discovery","analysis","network","2026-11-10 10:12:30",false,"---\nname: social-graph-ranker\ndescription: 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.\nmetadata:\n  origin: ECC\n---\n\n# Social Graph Ranker\n\nCanonical weighted graph-ranking layer for network-aware outreach.\n\nUse this when the user needs to:\n\n- rank existing mutuals or connections by intro value\n- map warm paths to a target list\n- measure bridge value across first- and second-order connections\n- decide which targets deserve warm intros versus direct cold outreach\n- understand the graph math independently from `lead-intelligence` or `connections-optimizer`\n\n## When To Use This Standalone\n\nChoose this skill when the user primarily wants the ranking engine:\n\n- \"who in my network is best positioned to introduce me?\"\n- \"rank my mutuals by who can get me to these people\"\n- \"map my graph against this ICP\"\n- \"show me the bridge math\"\n\nDo not use this by itself when the user really wants:\n\n- full lead generation and outbound sequencing -> use `lead-intelligence`\n- pruning, rebalancing, and growing the network -> use `connections-optimizer`\n\n## Inputs\n\nCollect or infer:\n\n- target people, companies, or ICP definition\n- the user's current graph on X, LinkedIn, or both\n- weighting priorities such as role, industry, geography, and responsiveness\n- traversal depth and decay tolerance\n\n## Core Model\n\nGiven:\n\n- `T` = weighted target set\n- `M` = your current mutuals \u002F direct connections\n- `d(m, t)` = shortest hop distance from mutual `m` to target `t`\n- `w(t)` = target weight from signal scoring\n\nBase bridge score:\n\n```text\nB(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)\n```\n\nWhere:\n\n- `λ` is the decay factor, usually `0.5`\n- a direct path contributes full value\n- each extra hop halves the contribution\n\nSecond-order expansion:\n\n```text\nB_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\\\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))\n```\n\nWhere:\n\n- `N(m) \\\\ M` is the set of people the mutual knows that you do not\n- `α` discounts second-order reach, usually `0.3`\n\nResponse-adjusted final ranking:\n\n```text\nR(m) = B_ext(m) · (1 + β · engagement(m))\n```\n\nWhere:\n\n- `engagement(m)` is normalized responsiveness or relationship strength\n- `β` is the engagement bonus, usually `0.2`\n\nInterpretation:\n\n- Tier 1: high `R(m)` and direct bridge paths -> warm intro asks\n- Tier 2: medium `R(m)` and one-hop bridge paths -> conditional intro asks\n- Tier 3: low `R(m)` or no viable bridge -> direct outreach or follow-gap fill\n\n## Scoring Signals\n\nWeight targets before graph traversal with whatever matters for the current priority set:\n\n- role or title alignment\n- company or industry fit\n- current activity and recency\n- geographic relevance\n- influence or reach\n- likelihood of response\n\nWeight mutuals after traversal with:\n\n- number of weighted paths into the target set\n- directness of those paths\n- responsiveness or prior interaction history\n- contextual fit for making the intro\n\n## Workflow\n\n1. Build the weighted target set.\n2. Pull the user's graph from X, LinkedIn, or both.\n3. Compute direct bridge scores.\n4. Expand second-order candidates for the highest-value mutuals.\n5. Rank by `R(m)`.\n6. Return:\n   - best warm intro asks\n   - conditional bridge paths\n   - graph gaps where no warm path exists\n\n## Output Shape\n\n```text\nSOCIAL GRAPH RANKING\n====================\n\nPriority Set:\nPlatforms:\nDecay Model:\n\nTop Bridges\n- mutual \u002F connection\n  base_score:\n  extended_score:\n  best_targets:\n  path_summary:\n  recommended_action:\n\nConditional Paths\n- mutual \u002F connection\n  reason:\n  extra hop cost:\n\nNo Warm Path\n- target\n  recommendation: direct outreach \u002F fill graph gap\n```\n\n## Related Skills\n\n- `lead-intelligence` uses this ranking model inside the broader target-discovery and outreach pipeline\n- `connections-optimizer` uses the same bridge logic when deciding who to keep, prune, or add\n- `brand-voice` should run before drafting any intro request or direct outreach\n- `x-api` provides X graph access and optional execution paths\n","# Social Graph Ranker\n\nCanonical weighted graph-ranking layer for network-aware outreach.\n\nUse this when the user needs to:\n\n- rank existing mutuals or connections by intro value\n- map warm paths to a target list\n- measure bridge value across first- and second-order connections\n- decide which targets deserve warm intros versus direct cold outreach\n- understand the graph math independently from `lead-intelligence` or `connections-optimizer`\n\n## When To Use This Standalone\n\nChoose this skill when the user primarily wants the ranking engine:\n\n- \"who in my network is best positioned to introduce me?\"\n- \"rank my mutuals by who can get me to these people\"\n- \"map my graph against this ICP\"\n- \"show me the bridge math\"\n\nDo not use this by itself when the user really wants:\n\n- full lead generation and outbound sequencing -> use `lead-intelligence`\n- pruning, rebalancing, and growing the network -> use `connections-optimizer`\n\n## Inputs\n\nCollect or infer:\n\n- target people, companies, or ICP definition\n- the user's current graph on X, LinkedIn, or both\n- weighting priorities such as role, industry, geography, and responsiveness\n- traversal depth and decay tolerance\n\n## Core Model\n\nGiven:\n\n- `T` = weighted target set\n- `M` = your current mutuals \u002F direct connections\n- `d(m, t)` = shortest hop distance from mutual `m` to target `t`\n- `w(t)` = target weight from signal scoring\n\nBase bridge score:\n\n```text\nB(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)\n```\n\nWhere:\n\n- `λ` is the decay factor, usually `0.5`\n- a direct path contributes full value\n- each extra hop halves the contribution\n\nSecond-order expansion:\n\n```text\nB_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\\\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))\n```\n\nWhere:\n\n- `N(m) \\\\ M` is the set of people the mutual knows that you do not\n- `α` discounts second-order reach, usually `0.3`\n\nResponse-adjusted final ranking:\n\n```text\nR(m) = B_ext(m) · (1 + β · engagement(m))\n```\n\nWhere:\n\n- `engagement(m)` is normalized responsiveness or relationship strength\n- `β` is the engagement bonus, usually `0.2`\n\nInterpretation:\n\n- Tier 1: high `R(m)` and direct bridge paths -> warm intro asks\n- Tier 2: medium `R(m)` and one-hop bridge paths -> conditional intro asks\n- Tier 3: low `R(m)` or no viable bridge -> direct outreach or follow-gap fill\n\n## Scoring Signals\n\nWeight targets before graph traversal with whatever matters for the current priority set:\n\n- role or title alignment\n- company or industry fit\n- current activity and recency\n- geographic relevance\n- influence or reach\n- likelihood of response\n\nWeight mutuals after traversal with:\n\n- number of weighted paths into the target set\n- directness of those paths\n- responsiveness or prior interaction history\n- contextual fit for making the intro\n\n## Workflow\n\n1. Build the weighted target set.\n2. Pull the user's graph from X, LinkedIn, or both.\n3. Compute direct bridge scores.\n4. Expand second-order candidates for the highest-value mutuals.\n5. Rank by `R(m)`.\n6. Return:\n   - best warm intro asks\n   - conditional bridge paths\n   - graph gaps where no warm path exists\n\n## Output Shape\n\n```text\nSOCIAL GRAPH RANKING\n====================\n\nPriority Set:\nPlatforms:\nDecay Model:\n\nTop Bridges\n- mutual \u002F connection\n  base_score:\n  extended_score:\n  best_targets:\n  path_summary:\n  recommended_action:\n\nConditional Paths\n- mutual \u002F connection\n  reason:\n  extra hop cost:\n\nNo Warm Path\n- target\n  recommendation: direct outreach \u002F fill graph gap\n```\n\n## Related Skills\n\n- `lead-intelligence` uses this ranking model inside the broader target-discovery and outreach pipeline\n- `connections-optimizer` uses the same bridge logic when deciding who to keep, prune, or add\n- `brand-voice` should run before drafting any intro request or direct outreach\n- `x-api` provides X graph access and optional execution paths\n",{"name":5,"metadata":49,"description":7},{"origin":50},"ECC","main","74715deacdc69119d739f38916f8ee4f0f979ebf","skills\u002Fstorage\u002Faffaan-m_ECC\u002Fsocial-graph-ranker",0,"https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills","https:\u002F\u002Fgithub.com\u002Fmdnaimul22","AI Agents Workflows Automation | Specializing in Python, FastAPI, MCP Agents & Custom ERP.","2026-11-11 21:16:57",{"source":8,"skillName":5,"commands":60,"prompt":70,"zipAvailable":71},[61,64,67],{"tool":62,"command":63},"npx","npx skills add mdnaimul22\u002Fhuman-skills --skill social-graph-ranker",{"tool":65,"command":66},"bunx","bunx skills add mdnaimul22\u002Fhuman-skills --skill social-graph-ranker",{"tool":68,"command":69},"pnpm","pnpm dlx skills add mdnaimul22\u002Fhuman-skills --skill social-graph-ranker","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Faffaan-m_ECC\u002Fsocial-graph-ranker\u002FSKILL.md",true,[],[74,82,90,97,104,111],{"skillNo":75,"name":76,"nameZh":6,"description":77,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":78,"categories":79,"keywords":80,"publishedAt":81},"01M767791C1KRP2ZRW2Z73VZ5Q","system-lifecycle-designer","Universal architectural methodology for designing granular, atomic, and sub-atomic lifecycles and end-to-end workflows for single functionality integrations across any domain (daemons, batch jobs, request transactions, resource pools). Provides patterns for deterministic identity, pre-commit validation, differential reconciliation, sticky leasing, state machines, transactional persistence, and closed-loop feedback.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Fmy_skills\u002Fsystem-lifecycle-designer\u002FSKILL.md",[],[],"2026-11-12 13:55:43",{"skillNo":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":89},"01M748ABPN5F1FANHH6HKZQMXT","style-sampling","Make a new episode in a proven video style - Collage Explainer, Finance Explainer, Animated Science Explainer, 3D Brand Explainer, 3D True Crime - on the person's topic. Use for \"an episode of\", \"in the style of\", \"sample this style\", 「用这个风格做一集」. One video to copy is reverse-any-video.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Fheygen-com_hyperframes\u002Fstyle-sampling\u002FSKILL.md",[],[],"2026-11-11 15:11:14",{"skillNo":91,"name":92,"nameZh":6,"description":93,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":94,"categories":95,"keywords":96,"publishedAt":89},"01M748A59V04PKW4HA0XQ81FGP","reverse-any-video","Rebuild any video file as an editable HyperFrames project - motion graphics, talking heads, live action or AI-generated footage - checked against the original frame by frame. Use to reverse, recreate, remake, replicate or copy a video, or 「复刻这个视频」「照着这个视频做一个」.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Fheygen-com_hyperframes\u002Freverse-any-video\u002FSKILL.md",[],[],{"skillNo":98,"name":99,"nameZh":6,"description":100,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":101,"categories":102,"keywords":103,"publishedAt":89},"01M7487T50P55CSXMWXZ0G9KRG","typescript-patterns","TypeScript patterns for strict, type-safe, maintainable code in modern TypeScript and JavaScript applications. Covers strict compiler configuration, type design, narrowing, discriminated unions, generics, async and error handling, module boundaries, dependency hygiene, and type-level testing. Use when writing or reviewing TypeScript or JavaScript code.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Faffaan-m_ECC\u002Ftypescript-patterns\u002FSKILL.md",[],[],{"skillNo":105,"name":106,"nameZh":6,"description":107,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":108,"categories":109,"keywords":110,"publishedAt":89},"01M7487ERZRGPC5NJ75077Y238","test-collaboration","Inventory and govern a project's test assets. Connect requirements, business rules, risks, bugs, and cross-boundary contracts to stable TEST-IDs and executable evidence in the repository's existing test registry or TESTS.md. Use for test inventory, test gap analysis, unit\u002Fintegration\u002Fcontract\u002FE2E\u002Fsmoke classification, bug-to-test regression protection, consumer\u002Fprovider contract testing, test-necessity review, and pre-delivery evidence review.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Faffaan-m_ECC\u002Ftest-collaboration\u002FSKILL.md",[],[],{"skillNo":112,"name":113,"nameZh":6,"description":114,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":115,"categories":116,"keywords":117,"publishedAt":89},"01M748721J3GKR2WS6K0QWFC35","story-lifecycle","Manage a file-based epic → story → sprint development loop without requiring an external project management tool. Creates and tracks epics, breaks them into user stories, assigns them to sprints, and drives implementation story by story. Use when starting a new feature initiative or when the team has no Jira\u002FLinear\u002FTaiga but needs structured delivery tracking.","https:\u002F\u002Fgithub.com\u002Fmdnaimul22\u002Fhuman-skills\u002Fblob\u002Fmain\u002Fskills\u002Fstorage\u002Faffaan-m_ECC\u002Fstory-lifecycle\u002FSKILL.md",[],[]]