For a fully captured simple undirected graph on original labels0..n-1,n1..6, edg...
https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-familyOverview
For a fully captured simple undirected graph on original labels0..n-1,n1..6, edge_mask bits are lexicographic unordered pairs(0,1),(0,2),...,(n-2,n-1). Synthesize ALL decompositions G=A square B into TWO connected simple factors with2<=a<=b and a*b=n. Product adjacency holds exactly when one coordinate agrees and the other factor has an edge. Return decompositions records{a,b,mask_a,mask_b,grid},count,decomposable. Factor masks use their own lexicographic unordered pairs.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
datenvertrag
Source
bazaar
Indexed
2026-11-07 02:08:34
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": {
"claim": {
"count": 0,
"decomposable": false,
"decompositions": []
},
"edge_mask": 0,
"n": 1
},
"bodyType": "json",
"method": "POST",
"type": "http"
}