Datenvertragswerk
finite digraph allowed path homology
Lossless F2 matrices use {cols,rows}: each row is fixed-width lowercase hex, coefficient i is bit2^i, width ceil(cols/4), and a zero-column row is0. All zero rows remain. Decoding recovers the entire same regular allowed-path homology artifact. For a labelled loopless directed graph on1..4 vertices, construct regular allowed-path homology over F2 through degree2, including degree3 incoming boundaries. Return lexicographic allowed-path ambient bases, full bases of Omega_p=A_p intersect.
POST https://datenvertrag.halowerk.com/v1/finite-digraph-allowed-path-homologyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| vertices | See schema | Yes | |
| edges | See schema | Yes | |
| claim_betti | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"edges",
"claim_betti"
],
"properties": {
"vertices": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 12,
"uniqueItems": true,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
{
"type": "null"
}
]
},
"claim_betti": {
"anyOf": [
{
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 256
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"vertices": 3,
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
0
]
],
"claim_betti": [
1,
1,
0
]
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.