بنقرة واحدة
gap-prioritization
Strategy for ranking unexplored combinations by novelty, feasibility, and potential impact.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
القائمة
Strategy for ranking unexplored combinations by novelty, feasibility, and potential impact.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
SOP for detecting and resolving concept aliases — merge duplicate pages, redirect edges.
SOP for creating a claim page in the vault — atomic proposition with type classification, source attribution, and initial confidence.
SOP for creating a new concept page with proper frontmatter, content, and initial edges.
SOP for flagging contradictions in the causal model — identify conflicting evidence or mechanism claims.
SOP for creating a dimension page — documents an axis of variation with its values and semantics.
SOP for creating multiple edges in a batch — efficient bulk relationship creation.
| name | gap-prioritization |
| description | Strategy for ranking unexplored combinations by novelty, feasibility, and potential impact. |
| execution | strategy |
| used-by | dimensional-analysis |
Rank the empty cells (unexplored combinations) by their potential value. Not all gaps are worth filling — prioritize by novelty, feasibility, and expected impact.
An empty cell is only an opportunity if it's feasible and valuable. Rank gaps by: (1) how novel the combination is, (2) how feasible it is to realize, (3) what impact it would have if successful.
| Metric | S | M | L |
|---|---|---|---|
| Gaps scored | 3 | 8 | 15 |
| Questions generated | 3 | 8 | 15 |
| Top priorities identified | 2 | 4 | 8 |
| Metric | Target | Current | Status |
|---------------------|--------|---------|--------|
| Gaps scored | X | 0 | ⬜ |
| Questions generated | X | 0 | ⬜ |
| Top priorities | X | 0 | ⬜ |
Cannot exit until 80% of budget met. Print state ledger before each iteration decision.