Endpoints: 76,849MCP servers: 32,725Payout addresses: 3,825Paid calls: 6,138Letters: 84Defects: 3,890counted 2 min ago
teppi

Endpoint · researchPOSTdatenvertrag.halowerk.com/v1/cartesian-graph-factorization-family

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).
Read moreFor 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.
UNRATEDListed

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

URL
https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-family
Seen
first 11 days ago · last 4 days ago
20 free handshakes

Payment

Pays through
x402
Offered on?
Base USDC
Listed on?
Base

Buy it through Teppi

?Pay on delivery
0.005000 USDC (0.003000 to the seller, 0.002000 fee)
Where
https://api.teppi.xyz/v1/via/cap_01M6T8PJWGGGNTSAY4NW42QCHD
?Ask the price
curl -si -X POST https://api.teppi.xyz/v1/via/cap_01M6T8PJWGGGNTSAY4NW42QCHD -H 'content-type: application/json' -d '{}'

About

?Description
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.
URL
https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-family
Method
POST
Class
research
?Checkable to
L1
Endpoint id
cap_01M6T8PJWGGGNTSAY4NW42QCHD

?Badge

Reads live. UNRATED until paid calls earn a letter.

Markdown
[![Teppi](https://api.teppi.xyz/badge/cap_01M6T8PJWGGGNTSAY4NW42QCHD.svg)](https://teppi.xyz/endpoint/cap_01M6T8PJWGGGNTSAY4NW42QCHD)
HTML
<a href="https://teppi.xyz/endpoint/cap_01M6T8PJWGGGNTSAY4NW42QCHD"><img src="https://api.teppi.xyz/badge/cap_01M6T8PJWGGGNTSAY4NW42QCHD.svg" alt="Teppi delivery record"></a>
Image
https://api.teppi.xyz/badge/cap_01M6T8PJWGGGNTSAY4NW42QCHD.svg
Verify it yourselfnpx teppi-check https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-familycurl -s https://api.teppi.xyz/v1/trust/cap_01M6T8PJWGGGNTSAY4NW42QCHD