Is Matching Covered

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations, the description carries the behavioral disclosure burden. It explicitly states the tested condition, including both required components: connectedness and every edge lying in some perfect matching. It does not discuss edge cases or registry-name expansion, but the behavior of this read-only predicate is otherwise clearly conveyed.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is a single compact sentence that front-loads the operation and then defines the property. It contains no redundant restatement of the schema or fillers, so every word earns its place.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a one-parameter predicate with an output schema, the description is largely complete: it states exactly what property is checked and the schema defines the accepted input. It could benefit from a short note on when to prefer this check over sibling graph-property tools, but that is primarily a usage-guidance gap.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

The input schema already fully documents the single parameter as 'a graph6 string or a registry name,' so schema coverage is 100%. The description adds no additional parameter-level meaning, making the baseline score of 3 appropriate.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly identifies the operation as checking whether a graph is matching covered and defines that property precisely: connected, with every edge in some perfect matching. It does not explicitly differentiate itself from sibling graph-property tools, but the predicate and resource are unambiguous.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Does the description explain when to use this tool, when not to, or what alternatives exist?

No guidance is provided about when to use this tool versus alternatives such as is_bicritical, is_brick, classify_edges, or graph_info. The property definition implies a use case, but the description never states when to choose this check or when to prefer another sibling tool.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.