HALOWERKDatenvertragswerk
proposer optimal stable matching audit
For two equally sized sides n1..6 with complete strict preference permutations, independently runs deferred acceptance from each side. Returns both entire left-indexed assignments and each side personal rank vectors, and whether the stable assignment is unique. Audit supplied entire proposer-optimal partners, not merely whether a supplied assignment has a blocking pair. Null preference row or claim yields unknown; every known malformed preference is rejected native400 before missingness and.
POST https://datenvertrag.halowerk.com/v1/proposer-optimal-stable-matching-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left_preferences | array | Ja | |
| right_preferences | array | Ja | |
| claimed_partners | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"left_preferences": {
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"uniqueItems": true
},
{
"type": "null"
}
]
}
},
"right_preferences": {
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"uniqueItems": true
},
{
"type": "null"
}
]
}
},
"claimed_partners": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
},
{
"type": "null"
}
]
}
},
"required": [
"left_preferences",
"right_preferences",
"claimed_partners"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"left_preferences": [
[
0,
1
],
[
1,
0
]
],
"right_preferences": [
[
1,
0
],
[
0,
1
]
],
"claimed_partners": [
0,
1
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden