SkillTrace: Traversing a Query-Skill Graph for Composable LLM Agents
Large language model agents increasingly solve complex tasks by composing reusable skills from a library. To address this, the key challenge is not merely to retrieve individually relevant skills, but to identify a complete and executable skill composition. In this paper, we argue that this problem can be solved in a graph with three levels: compositional relations among skill queries, similarity between queries and candidates in the skill library, and the dependencies among the selected candida
Record details
Published: 3 August 2026
Source: arXiv cs.AI
Category: Research
Topics: Agents & autonomy
Retrieved: 4 August 2026
Related evidence
These records share source-supplied organisations, an exact publisher byline, automatic topics or regions. The reason is shown on every link; related does not mean supporting, agreeing with or verifying this record.
KC-Agent: A Dual-Process Cognitive Architecture for Efficient ML Model Improvement
arXiv cs.AI · 3 August 2026
Faster-WAM: Do World Action Models Need Deep Action Modules?
arXiv cs.AI · 3 August 2026
Can AI Agents Simulate A/B Test Outcomes? A Validation Framework for Agentic Experimentation
arXiv cs.AI · 3 August 2026
Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training
arXiv cs.AI · 3 August 2026
Trajectories That Segment Themselves: Agent-Declared Boundaries as a Training Unit
arXiv · 3 August 2026
Antares: Foundation Models for Agentic Vulnerability Localization
arXiv cs.AI · 3 August 2026
How to cite this record
ethics.ai (3 August 2026), “SkillTrace: Traversing a Query-Skill Graph for Composable LLM Agents,” evidence record 16102, https://ethics.ai/record/16102 (originally published by arXiv cs.AI).
Use and limitations
This page is a stable index and citation surface for a source record. ethics.ai did not author the underlying report and has not independently verified every claim. Automatic topics may be imperfect. For consequential use, quote and cite the original publisher.