HALOWERKDatenvertragswerk
subsequence deck word reconstruction family
Given original length n in0..8, k in0..n and a full k-deck as distinct binaryword/count entries, reconstruct EVERY binary n-word whose multiset of all length-k subsequences equals that deck exactly. Subsequences preserve order and allow gaps; multiplicities count index selections, not just distinct spellings. Return canonical sorted deck, entire lexicographic sourcewordfamily, count, uniqueness and total C(n,k). Inconsistent but well-formed decks have a known empty family. Deckentry order is.
POST https://datenvertrag.halowerk.com/v1/subsequence-deck-word-reconstruction-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| length | Siehe Schema | Ja | |
| subsequence_length | Siehe Schema | Ja | |
| deck | Siehe Schema | Ja | |
| claimed_words | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"length",
"subsequence_length",
"deck",
"claimed_words"
],
"properties": {
"length": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"subsequence_length": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"deck": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"word",
"count"
],
"properties": {
"word": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 8
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 70
}
}
}
},
{
"type": "null"
}
]
},
"claimed_words": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 8
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"length": 4,
"subsequence_length": 2,
"deck": [
{
"word": "00",
"count": 1
},
{
"word": "01",
"count": 2
},
{
"word": "10",
"count": 2
},
{
"word": "11",
"count": 1
}
],
"claimed_words": [
"0110",
"1001"
]
}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