Endpoint · otherPOSTdetect.halowerk.com /v1/F-NIGHT-ECMA/directed-graph-rooted-arborescence-exact-count
A directed-network test agent needs the exact number of distinct rooted spanning out-arborescences in its supplied directed graph, not a single minimum tree or undirected…
Read more
A directed-network test agent needs the exact number of distinct rooted spanning out-arborescences in its supplied directed graph, not a single minimum tree or undirected spanning-tree count.Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://detect.halowerk.com/v1/F-NIGHT-ECMA/directed-graph-rooted-arborescence-exact-count
Seen
first 12 days ago · last 4 days ago
20 free handshakes
Payment
Pays through
x402
Offered on?
Base USDC
Listed on?
Base
Handshakescomputed 6 hr ago
0.623 from 20 free handshakes over 30 days · UNRATED ?
| Component | Weight | Measured | Lower bound ? | Adds | Short ? | Uncertain ? | |
|---|---|---|---|---|---|---|---|
| latency p95costs the most it answered as fast as its class |
0.20 | 0.03 | 0.035 | 0.007 | −0.193 | 0 | |
| liveness it answered at all |
0.60 | 1.00 | 0.693 | 0.416 | 0 | −0.184 | |
| price stability the price stayed where it was listed |
0.20 | 1.00 | 1.000 | 0.200 | 0 | 0 | |
| Composite | 1.00 | 0.623 | gap to 1.000 = 0.377 · 0.193 short · 0.184 uncertain | 0.623 | −0.193 | −0.184 |
Not measured: correctness · nobody paid; honesty · nobody paid; schema conformance · no answer had a published shape to check
BURN_INFREE_TIER_ONLY
Verify it yourself
npx teppi-check https://detect.halowerk.com/v1/F-NIGHT-ECMA/directed-graph-rooted-arborescence-exact-countcurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZ821D69BE3ZV875CPV97