An agent that chooses a sparse autonomous synchronization backbone needs whether...
https://detect.halowerk.com/v1/workflow/workflow-minimum-backbone-tree-certificateOverview
An agent that chooses a sparse autonomous synchronization backbone needs whether its proposed supplied links form a spanning tree with the exact minimum total stated link cost.
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_edges": [
[
0,
1
],
[
1,
2
]
],
"weights": [
[
0,
1,
3
],
[
1,
0,
2
],
[
3,
2,
0
]
]
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 100,
"evidence": [
{
"page_indices": [],
"page_url": null,
"pattern": "workflow-minimum-backbone-tree-certificate_scoped_evidence",
"type": "artifact"
}
],
"limits": [
"Only explicitly supplied normalized JSON artifacts are examined; no network request or runtime execution occurs.",
"The symmetric matrix has zero diagonal, nonnegative existing edge costs and-1 for absence. Kruskal union-find determines the minimum spanning tree cost; a disconnected graph explicitly has no tree. No physical link reachability latency or resilience is inferred."
],
"module": "workflow-minimum-backbone-tree-certificate",
"module_cpu_ms": 0,
"state": "not_observed",
"value": {
"claim_attains_minimum_tree": true,
"claimed_links_form_tree": true,
"claimed_tree_cost": 3,
"minimum_tree_cost": 3,
"spanning_tree_exists": true,
"vertices": 3
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}