HALOWERKDatenvertragswerk
stable cartesian tree reconstruction audit
From1..24 supplied integer values construct the unique min-Cartesian tree with priority(value,originalindex), inorder0..n-1. Return every parent/left/right/root, half-open subtree range and inclusive-endpoint range-argmin triangular table. Compare the entire ordered claimed_parent vector; null values or null claim is unknown. Fixed0.003USDC also valid unknown; no external observations.
POST https://datenvertrag.halowerk.com/v1/stable-cartesian-tree-reconstruction-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| values | Siehe Schema | Ja | |
| claimed_parent | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"values",
"claimed_parent"
],
"properties": {
"values": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 24,
"items": {
"type": "integer",
"minimum": -100,
"maximum": 100
}
},
{
"type": "null"
}
]
},
"claimed_parent": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 24,
"items": {
"type": "integer",
"minimum": -1,
"maximum": 23
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"values": [
2,
2,
1,
2
],
"claimed_parent": [
2,
0,
-1,
2
]
}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