HALOWERKDatenvertragswerk
minimal absent subsequence family
For an original binary word of length0..7 over the FIXED alphabet{0,1}, construct EVERY minimal absent SUBSEQUENCE: the whole word does not embed with increasing source positions, but every proper subsequence does. Equivalently every single-character deletion embeds. Return the whole word family in shortlex(length then0<1) order; for each output word and each deletion position left-to-right return the lexicographically earliest complete zero-based source-index tuple embedding that deletion;.
POST https://datenvertrag.halowerk.com/v1/minimal-absent-subsequence-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| word | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"word",
"claim"
],
"properties": {
"word": {
"anyOf": [
{
"type": "string",
"pattern": "^[01]*$",
"maxLength": 7
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"words",
"deletion_witnesses",
"length_histogram",
"count"
],
"properties": {
"words": {
"type": "array",
"items": {
"type": "string",
"pattern": "^[01]+$",
"minLength": 1,
"maxLength": 8
},
"minItems": 0,
"maxItems": 128
},
"deletion_witnesses": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 0,
"maxItems": 7
},
"minItems": 1,
"maxItems": 8
},
"minItems": 0,
"maxItems": 128
},
"length_histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 128
},
"minItems": 9,
"maxItems": 9
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 128
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"word": "",
"claim": {
"words": [
"0",
"1"
],
"deletion_witnesses": [
[
[]
],
[
[]
]
],
"length_histogram": [
0,
2,
0,
0,
0,
0,
0,
0,
0
],
"count": 2
}
}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