HALOWERKDatenvertragswerk
pair distance turnpike inventory
Given2..6distinct integer points and the complete positive pair-distance multiset with span<=20, enumerate all normalized point sets starting0, quotient reflection by lexicographic minimum. Return every ordered pair distance and input distance histogram, plus exact whole claimed-set comparison. Repeated distances allowed; impossible complete multiset returns empty solutions. Missing distances/claim stays unknown. Exact anonymous integer model; no noisy/missing-measurement inference or.
POST https://datenvertrag.halowerk.com/v1/pair-distance-turnpike-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| points | integer | Ja | |
| distances | Siehe Schema | Ja | |
| claimed_sets | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"points",
"distances",
"claimed_sets"
],
"properties": {
"points": {
"type": "integer",
"minimum": 2,
"maximum": 6
},
"distances": {
"anyOf": [
{
"type": "array",
"maxItems": 15,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 20
}
},
{
"type": "null"
}
]
},
"claimed_sets": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 20
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"points": 6,
"distances": [
1,
4,
10,
12,
17,
3,
9,
11,
16,
6,
8,
13,
2,
7,
5
],
"claimed_sets": [
[
0,
1,
4,
10,
12,
17
],
[
0,
1,
8,
11,
13,
17
]
]
}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