Datenvertragswerk
bipartite poset diametral extension family
For six original labels0..5 partitioned into bottoms0..2 and tops3..5, precedence_mask bit(3*i+j) requires bottom i before top3+j. These nine possible relations and reflexivity define the entire captured poset; no other precedence inferred. Generate every legal permutation of0..5 in lexicographic order as extensions. Return diameter (maximum number of unordered labelpairs reversed between two legal orders), ALL unordered maximizing index pairs[i,j] with i<j into extensions, lexicographically.
POST https://datenvertrag.halowerk.com/v1/bipartite-poset-diametral-extension-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| precedence_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"precedence_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 511
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"extensions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 6,
"maxItems": 6
},
"minItems": 36,
"maxItems": 720
},
"diameter": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"pairs": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 719
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 360
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 360
}
},
"required": [
"extensions",
"diameter",
"pairs",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"precedence_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"precedence_mask": 511,
"claim": {
"extensions": [
[
0,
1,
2,
3,
4,
5
],
[
0,
1,
2,
3,
5,
4
],
[
0,
1,
2,
4,
3,
5
],
[
0,
1,
2,
4,
5,
3
],
[
0,
1,
2,
5,
3,
4
],
[
0,
1,
2,
5,
4,
3
],
[
0,
2,
1,
3,
4,
5
],
[
0,
2,
1,
3,
5,
4
],
[
0,
2,
1,
4,
3,
5
],
[
0,
2,
1,
4,
5,
3
],
[
0,
2,
1,
5,
3,
4
],
[
0,
2,
1,
5,
4,
3
],
[
1,
0,
2,
3,
4,
5
],
[
1,
0,
2,
3,
5,
4
],
[
1,
0,
2,
4,
3,
5
],
[
1,
0,
2,
4,
5,
3
],
[
1,
0,
2,
5,
3,
4
],
[
1,
0,
2,
5,
4,
3
],
[
1,
2,
0,
3,
4,
5
],
[
1,
2,
0,
3,
5,
4
],
[
1,
2,
0,
4,
3,
5
],
[
1,
2,
0,
4,
5,
3
],
[
1,
2,
0,
5,
3,
4
],
[
1,
2,
0,
5,
4,
3
],
[
2,
0,
1,
3,
4,
5
],
[
2,
0,
1,
3,
5,
4
],
[
2,
0,
1,
4,
3,
5
],
[
2,
0,
1,
4,
5,
3
],
[
2,
0,
1,
5,
3,
4
],
[
2,
0,
1,
5,
4,
3
],
[
2,
1,
0,
3,
4,
5
],
[
2,
1,
0,
3,
5,
4
],
[
2,
1,
0,
4,
3,
5
],
[
2,
1,
0,
4,
5,
3
],
[
2,
1,
0,
5,
3,
4
],
[
2,
1,
0,
5,
4,
3
]
],
"diameter": 6,
"pairs": [
[
0,
35
],
[
1,
33
],
[
2,
34
],
[
3,
31
],
[
4,
32
],
[
5,
30
],
[
6,
23
],
[
7,
21
],
[
8,
22
],
[
9,
19
],
[
10,
20
],
[
11,
18
],
[
12,
29
],
[
13,
27
],
[
14,
28
],
[
15,
25
],
[
16,
26
],
[
17,
24
]
],
"count": 18
}
}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.