본문으로 건너뛰기
cccskills
무료GitHub에 공개

dag-capability-ranker

Ranks eligible skill candidates with explicit retrieval evidence, capability coverage, and uncertainty. NOT for discovery, authorization, or execution planning.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

설치 방법 보기

포함된 파일(2)

  • SKILL.md5.6 KB
  • references/authority-filtered-hybrid-ranking.md4.9 KB

SKILL.md(원문)

설치하기 전에 에이전트에게 전달되는 지시 내용을 확인할 수 있습니다.

DAG capability ranker

Rank a supplied candidate set for a stated task. A rank is a comparative recommendation, never a probability that a skill will succeed and never permission to run it. Preserve the query, catalog snapshot, policy version, and explanation so a later reviewer can reproduce the order.

1. Establish eligibility before retrieval

Write the required capabilities, prohibited effects, corpus/disclosure scope, tool authority, and evaluation target. Remove candidates that cannot satisfy a hard constraint before retrieval or fusion. If no candidate remains, abstain and name the unmet capability; do not loosen a safety, disclosure, or effect constraint because the ranker found a nearby wording match.

When text or code retrieval is needed, use a local policy-selected hybrid retriever. Apply repository/harbor/account, retention, and redaction filters first. Dense results may only be compared when their immutable spaceId matches the query's model, preprocessing, pooling, dimensions, normalization, metric, precision, and quantization recipe. A local policy label records a choice; it does not establish a source guarantee.

flowchart LR
  Q[Task contract and negative constraints] --> F[Authority and disclosure filter]
  F --> E{Eligible candidates?}
  E -->|none| A[Abstain with missing capability]
  E -->|yes| R[Lexical and compatible dense retrieval]
  R --> H[Rank fusion]
  H --> C[Capability and effect review]
  C --> V{All hard constraints still met?}
  V -->|no| F
  V -->|yes| O[Ranked evidence packet]

2. Fuse evidence, then inspect capability coverage

RRF can combine independent ranked lists without treating their scores as commensurate probabilities:

RRF(d) = sum_i 1 / (k + rank_i(d)).

Record the lists, omitted candidates, k, and ties. Cormack, Clarke, and Buettcher describe RRF as an IR fusion method; it does not prove an agent's competence, authorization, or outcome probability. Bruch, Gai, and Ingber report that fusion behavior is benchmark-dependent, so do not claim RRF is universally best. For each fused candidate, inspect required capability evidence and prohibited-effect evidence separately; a high retrieval rank cannot repair a missing requirement.

flowchart TB
  L[Lexical rank] --> F[RRF with recorded k]
  D[Dense rank: same spaceId] --> F
  P[Provenance or dependency rank] --> F
  F --> X[Required capabilities]
  X --> N[Negative constraints and effect boundary]
  N --> R[Ordered candidates plus gaps]

3. Evaluate without invented universal cutoffs

Evaluate candidate recall, capability-check precision, abstentions, and downstream task outcome on a representative labeled set or reviewed cases. Split by task family, policy, catalog revision, and effect class where those factors change the decision. Historical run data can be evidence only when its outcome predicate, cohort, missingness, and time window are recorded. Cold-start candidates should be marked as having limited evidence, not automatically penalized by a fabricated count threshold.

Worked positive case

The task requires static TypeScript review and forbids live requests. After authority filtering, X ranks (lexical 1, dense 6) and Y ranks (lexical 4, dense 1). With the illustrative local choice k=60, RRF puts Y first. The capability review finds Y permits a live probe and lacks an offline procedure, so Y is excluded and the eligible-set ranking is recomputed. X is recommended with the retrieval ranks and the reason it satisfies the effect constraint.

Worked negative case

Candidate Z has the best semantic rank but embeds a different spaceId from the query. Do not normalize or compare its vector score. Retain lexical evidence only under a policy-permitted, explicitly degraded contract. A requested hybrid contract remains unmet: report the incompatible dense evidence and either use an authorized re-embedding migration or abstain.

4. Output contract and limits

Return: task contract; policy and catalog snapshots; applied filters; retrieval lists and compatible spaceId; fusion parameters; rank order; capability/effect evidence; gaps; abstentions; and evaluation status. Read authority-filtered hybrid ranking for the source notes. Cite Cormack et al., 2009 for RRF and Bruch et al., 2022 for method sensitivity. These sources address retrieval experiments, not authorization or agent performance.

Do not use this skill for semantic discovery alone, an unstructured catalog browse, execution scheduling, or a release decision. Use dag-semantic-matcher for candidate discovery, dag-skill-registry for catalog evidence, dag-graph-builder for planning, and dag-pattern-learner for outcome-history analysis.

Before recommending, inspect the operational preference worksheet and failure checks. They preserve reliability, latency and resource trade-offs separately from retrieval relevance.

리뷰

아직 리뷰가 없습니다. 사용해 본 소감을 남겨 주세요.

댓글

로그인 없이 쓸 수 있습니다. 사용 후기, 질문, 작동하지 않은 환경 등을 편하게 남겨 주세요.

아직 댓글이 없습니다. 첫 댓글을 남겨 보세요.

보내면 바로 공개됩니다. 이메일 주소나 전화번호 같은 개인 정보는 쓰지 마세요. URL은 2개까지입니다.

0 / 1,000자

이 양식은 reCAPTCHA로 보호되며 Google 개인정보처리방침 및 서비스 약관이 적용됩니다.

같은 저장소의 스킬

Expert in 2000s-era music visualization (Milkdrop, AVS, Geiss) and modern WebGL implementations. Specializes in Butterchurn integration, Web Audio API AnalyserNode FFT data, GLSL shaders for audio-reactive visuals, and psychedelic generative art. Activate on "Milkdrop", "music visualization", "WebGL visualizer", "Butterchurn", "audio reactive", "FFT visualization", "spectrum analyzer". NOT for simple bar charts/waveforms (use basic canvas), video editing, or non-audio visuals.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

Expert legal research agent for finding and scraping expungement data state by state. Knows authoritative sources, URL patterns, Firecrawl configuration, and 2026 legal landscape.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

Expert in 3D computer vision labeling tools, workflows, and AI-assisted annotation for LiDAR, point clouds, and sensor fusion. Covers SAM4D/Point-SAM, human-in-the-loop architectures, and vertical-specific training strategies. Activate on '3D labeling', 'point cloud annotation', 'LiDAR labeling', 'SAM 3D', 'SAM4D', 'sensor fusion annotation', '3D bounding box', 'semantic segmentation point cloud'. NOT for 2D image labeling (use clip-aware-embeddings), general ML training (use ml-engineer), video annotation without 3D (use computer-vision-pipeline), or VLM prompt engineering (use prompt-engineer).

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

Apply crisis decision-making research to agent routing, uncertainty triage, and coordination failure analysis in time-pressured systems. Use when diagnosing handoff failures, analytical paralysis, or expert judgment under incomplete information. NOT for routine coding, simple CRUD design, or static single-agent tasks with complete information.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

Use for insight, reframing, contradiction, impasse, and anomaly-driven problem solving when execution effort no longer helps. NOT for routine optimization, error correction, or well-specified tasks with known solution paths.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

Apply cognitive task analysis to expert work that depends on perceptual cues, branching judgment, and recurring monitoring loops. Use when decomposing expert capability into agent structure, simulation design, or validation interviews. NOT for ordinary step-by-step SOP capture or simple pipelines with no tacit cue layer.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

curiositech/port-daddy32026년 10월 19일 업데이트

curiositech의 스킬 모두 보기

이 스킬의 문제 신고