Datenvertragswerk
finite tensor identifiability certificate
Exact CP tensor identifiability over F2 for a complete 2x2x2 tensor, flattened by index 4i+2j+k. Returns the minimum rank and the complete family of minimal rank-one decompositions as sorted subsets of a catalog of all 27 ordered factor triples, encoded losslessly as a lower-hex bitmask over the lexicographic r-subsets of 0..26; every factor vector and atom tensor is included. Not a sufficient Kruskal test, one fitting decomposition or a numerical approximation.
POST https://datenvertrag.halowerk.com/v1/finite-tensor-identifiability-certificateInputs
| Field | Type | Required | Description |
|---|---|---|---|
| tensor | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"tensor": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"field": {
"const": 2
},
"shape": {
"const": [
2,
2,
2
]
},
"tensor_entries": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"identifiable": {
"type": "boolean"
},
"equivalence": {
"const": "term_permutation"
},
"atom_catalog": {
"type": "array",
"items": {
"type": "object",
"properties": {
"factors": {
"type": "array",
"items": {
"enum": [
[
1,
0
],
[
0,
1
],
[
1,
1
]
]
},
"minItems": 3,
"maxItems": 3
},
"tensor_entries": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
}
},
"required": [
"factors",
"tensor_entries"
],
"additionalProperties": false
},
"minItems": 27,
"maxItems": 27
},
"family_universe_size": {
"type": "integer",
"minimum": 1,
"maximum": 17550
},
"minimal_family_mask": {
"type": "string",
"pattern": "^0x[0-9a-f]+$",
"minLength": 3,
"maxLength": 4390
},
"decomposition_count": {
"type": "integer",
"minimum": 1,
"maximum": 17550
},
"rank0_to4_counts": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 17550
},
"minItems": 5,
"maxItems": 5
},
"witnesses": {
"type": "array",
"items": {
"type": "object",
"properties": {
"atom_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 26
},
"minItems": 0,
"maxItems": 4
},
"factors": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
[
1,
0
],
[
0,
1
],
[
1,
1
]
]
},
"minItems": 3,
"maxItems": 3
},
"minItems": 0,
"maxItems": 4
},
"reconstructed_entries": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
}
},
"required": [
"atom_indices",
"factors",
"reconstructed_entries"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 2
},
"complete_family": {
"const": true
}
},
"required": [
"field",
"shape",
"tensor_entries",
"rank",
"identifiable",
"equivalence",
"atom_catalog",
"family_universe_size",
"minimal_family_mask",
"decomposition_count",
"rank0_to4_counts",
"witnesses",
"complete_family"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"tensor",
"claim"
],
"additionalProperties": false
}Published input example
{
"tensor": [
1,
1,
1,
1,
1,
1,
1,
1
],
"claim": null
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.