HALOWERKDatenvertragswerk
exact univariate kmeans audit
Own rational intervalDP for sorted suppliedintegerpoints n<=12 and exactlyknonemptycontiguousindexclusters. Full minimumSSE,optimalpartitioncount,lexleastendvector,exactcenters/perclustersse and labels. Equal-valuedobservations remain distinctorderedindices; no silentlysortinginput. No heuristic/R/Rcpp/libraryexecution or realclusterqualityclaim. Missingpoint/k/claim unknown; invalidprofile native400 before settlement. Fixed0.003USDC also for schema-valid unknown. Input16KiB/data32KiB.
POST https://datenvertrag.halowerk.com/v1/exact-univariate-kmeans-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed | Siehe Schema | Ja | |
| k | Siehe Schema | Ja | |
| values | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"ends": {
"items": {
"maximum": 12,
"minimum": 1,
"type": "integer"
},
"maxItems": 12,
"type": "array"
},
"optimal_partition_count": {
"maximum": 2048,
"minimum": 1,
"type": "integer"
},
"sse": {
"additionalProperties": false,
"properties": {
"denominator": {
"pattern": "^[1-9][0-9]{0,29}$",
"type": "string"
},
"numerator": {
"pattern": "^(0|[1-9][0-9]{0,29})$",
"type": "string"
}
},
"required": [
"numerator",
"denominator"
],
"type": "object"
}
},
"required": [
"sse",
"optimal_partition_count",
"ends"
],
"type": "object"
},
{
"type": "null"
}
]
},
"k": {
"anyOf": [
{
"maximum": 12,
"minimum": 1,
"type": "integer"
},
{
"type": "null"
}
]
},
"values": {
"items": {
"anyOf": [
{
"maximum": 1000,
"minimum": -1000,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 12,
"minItems": 1,
"type": "array"
}
},
"required": [
"values",
"k",
"claimed"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed": {
"ends": [
1,
4
],
"optimal_partition_count": 3,
"sse": {
"denominator": "1",
"numerator": "0"
}
},
"k": 2,
"values": [
0,
0,
0,
0
]
}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