HALOWERKDatenvertragswerk
exact simplex projection audit
Own rational sorting/threshold projection for <=12coordinates y_i=integercoordinate_i/commonscale. Return whole fittedvector,threshold,strictpositive activeindices,dualnonnegative slacks,squaredEuclideandistance and wholevectorclaimcheck. This solves sum(x)=1,x>=0 leastsquares; not normalization/clipping/isotonicfit or realprobabilityestimation. NoSciPy/solver/sourcecode execution. Missingcoordinate/scale/claim unknown; invalid profile native400 before settlement. Fixed0.003USDC also for.
POST https://datenvertrag.halowerk.com/v1/exact-simplex-projection-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_fitted | Siehe Schema | Ja | |
| coordinates | array | Ja | |
| scale | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_fitted": {
"anyOf": [
{
"items": {
"additionalProperties": false,
"properties": {
"denominator": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
"numerator": {
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
}
},
"required": [
"numerator",
"denominator"
],
"type": "object"
},
"maxItems": 12,
"type": "array"
},
{
"type": "null"
}
]
},
"coordinates": {
"items": {
"anyOf": [
{
"maximum": 1000,
"minimum": -1000,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 12,
"minItems": 1,
"type": "array"
},
"scale": {
"anyOf": [
{
"maximum": 1000,
"minimum": 1,
"type": "integer"
},
{
"type": "null"
}
]
}
},
"required": [
"coordinates",
"scale",
"claimed_fitted"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_fitted": [
{
"denominator": 4,
"numerator": 3
},
{
"denominator": 4,
"numerator": 1
},
{
"denominator": 1,
"numerator": 0
}
],
"coordinates": [
3,
1,
-2
],
"scale": 4
}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