An agent that checks an abstract dependency topology before choosing a schematic...
https://detect.halowerk.com/v1/workflow/workflow-planar-dependency-topologyOverview
An agent that checks an abstract dependency topology before choosing a schematic representation needs its claimed graph planarity measured without rendering a layout.
Protocol
x402 (POST)
Price
$0.0020
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
detect
Source
bazaar
Indexed
2026-11-02 17:26:37
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"artifact": {
"claimed_planar": false,
"edges": [
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
1,
3
],
[
1,
4
],
[
1,
5
],
[
2,
3
],
[
2,
4
],
[
2,
6
],
[
6,
5
]
],
"vertices": 7
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 100,
"evidence": [
{
"page_indices": [],
"page_url": null,
"pattern": "workflow-planar-dependency-topology_scoped_evidence",
"type": "artifact"
}
],
"limits": [
"Only the explicit bounded artifact is measured. No retrieval, execution, real credential validation, contact output or legal/security/quality judgement.",
"At most8 vertices, complete simple undirected graph. Exact Wagner K5/K3,3 connected-branch-set obstruction search. Loops unsupported, repeated undirected edges collapse. No embedding, browser rendering, crossing count or visual-quality judgement."
],
"module": "workflow-planar-dependency-topology",
"module_cpu_ms": 0,
"state": "not_observed",
"value": {
"abstract_graph_planar": false,
"claimed_planarity_matches": true,
"vertices": 7
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}