HALOWERKDatenvertragswerk
graph6 record audit
Decode a supplied graph6 record of order0..16 into every labeled undirected edge, degree vector, exact upper-triangle bitstream and zero-padding width, and compare the complete supplied graph claim. Optional graph6 header accepted; record excludes line terminators. Missing record or claim returns explicit unknown while preserving any decoded graph. Nonzero pad bits, wrong payload length and malformed/non-profile records native400 before settlement. Canonical record means header removal only,.
POST https://datenvertrag.halowerk.com/v1/graph6-record-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| graph6 | Siehe Schema | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"graph6": {
"anyOf": [
{
"type": "string",
"minLength": 1,
"maxLength": 31
},
{
"type": "null"
}
]
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"order": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"edges": {
"type": "array",
"maxItems": 120,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
}
},
"required": [
"order",
"edges"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"graph6",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"graph6": "DQc",
"claimed": {
"order": 5,
"edges": [
[
0,
2
],
[
0,
4
],
[
1,
3
],
[
3,
4
]
]
}
}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