HALOWERKDatenvertragswerk
formal context concept lattice
Given 0to5 objects and 0to5 attributes with a complete binary incidence matrix, construct all formal concepts (A,B) where A is exactly the objects sharing every attribute in B and B is exactly the attributes shared by every object in A. Empty-set derivation uses universal/vacuous truth. Return all extent/intent masks and ordered memberships, exact Hasse covers in extent-inclusion order, bottom and top. IDs sort by numeric intent mask; bit i names input index i. No object/attribute relabeling.
POST https://datenvertrag.halowerk.com/v1/formal-context-concept-latticeEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| object_count | integer | Ja | |
| attribute_count | integer | Ja | |
| incidence | Siehe Schema | Ja | |
| claimed_intents | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"object_count",
"attribute_count",
"incidence",
"claimed_intents"
],
"properties": {
"object_count": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"attribute_count": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"incidence": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
}
},
{
"type": "null"
}
]
},
"claimed_intents": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"object_count": 3,
"attribute_count": 3,
"incidence": [
[
1,
0,
0
],
[
0,
1,
0
],
[
0,
0,
1
]
],
"claimed_intents": [
0,
1,
2,
4,
7
]
}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