HALOWERKDatenvertragswerk
poisson binomial distribution audit
Own bounded BigInt polynomial convolution for <=12supplied Bernoulli marginals, denominators<=100; output reduced exact rational PMF/CDF and expectation; compare whole supplied PMF by rational equality. Independence must be explicitly supplied true, not inferred or observed. No realdata estimation, random sampling, causal claim, SciPy/handler/program execution. Missing/false independence leaves PMF/CDF unknown; expectation remains derivable from complete marginals without independence..
POST https://datenvertrag.halowerk.com/v1/poisson-binomial-distribution-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_pmf | Siehe Schema | Ja | |
| independent | boolean, null | Ja | |
| trials | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_pmf": {
"anyOf": [
{
"items": {
"additionalProperties": false,
"properties": {
"denominator": {
"pattern": "^[1-9][0-9]{0,27}$",
"type": "string"
},
"numerator": {
"pattern": "^(0|[1-9][0-9]{0,27})$",
"type": "string"
}
},
"required": [
"numerator",
"denominator"
],
"type": "object"
},
"maxItems": 13,
"type": "array"
},
{
"type": "null"
}
]
},
"independent": {
"type": [
"boolean",
"null"
]
},
"trials": {
"items": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"denominator": {
"maximum": 100,
"minimum": 1,
"type": "integer"
},
"numerator": {
"maximum": 100,
"minimum": 0,
"type": "integer"
}
},
"required": [
"numerator",
"denominator"
],
"type": "object"
},
{
"type": "null"
}
]
},
"maxItems": 12,
"type": "array"
}
},
"required": [
"independent",
"trials",
"claimed_pmf"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_pmf": [
{
"denominator": "3",
"numerator": "1"
},
{
"denominator": "2",
"numerator": "1"
},
{
"denominator": "6",
"numerator": "1"
}
],
"independent": true,
"trials": [
{
"denominator": 2,
"numerator": 1
},
{
"denominator": 3,
"numerator": 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