{"paper":{"title":"On Kruskal's theorem that every 3 x 3 x 3 array has rank at most 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Jiaxiong Hu, Murray R. Bremner","submitted_at":"2012-09-06T19:54:53Z","abstract_excerpt":"In the first part of this paper, we consider 3 x 3 x 3 arrays with complex entries, and provide a complete self-contained proof of Kruskal's theorem that the maximum rank is 5. In the second part, we provide a complete classification of the canonical forms of 3 x 3 x 3 arrays over F_2; in particular, we obtain explicit examples of such arrays with rank 6."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1553","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}