{"id":"W2964285749","doi":"10.1016/j.laa.2013.03.021","title":"On Kruskal’s theorem that every 3 × 3 × 3 array has rank at most 5","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Rank (graph theory); Kruskal's algorithm; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Spanning tree","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348164,0.001194328,0.001083678,0.00186559,0.002230652,0.002850171,0.001123371,0.001307871,0.02174146],"category_scores_gemma":[0.006424689,0.0006565177,0.001249635,0.002063466,0.004693424,0.00921528,0.003995683,0.003997503,0.006403117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086994,"about_ca_system_score_gemma":0.001023624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420512,"about_ca_topic_score_gemma":0.001691646,"domain_scores_codex":[0.9981571,0.0003005375,0.00009153158,0.0005843371,0.0005449993,0.0003215981],"domain_scores_gemma":[0.9967746,0.001243879,0.0002853398,0.0007387325,0.0007140391,0.0002434762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001545783,0.00004541716,0.0003782049,0.0001187863,0.00003044143,0.0001016862,0.0003910133,0.001226116,0.00202208,0.9206302,0.03889233,0.03600918],"study_design_scores_gemma":[0.00001793964,0.00002694343,0.0003260583,0.00003433645,0.00001959203,0.0001657351,0.0001051612,0.001941643,0.001013511,0.9656641,0.0306509,0.00003408259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08888374,0.002842313,0.3717393,0.01208725,0.004141893,0.0001993197,0.002004613,0.001576506,0.516525],"genre_scores_gemma":[0.6450026,0.00237482,0.1447441,0.009010149,0.004989795,0.000410806,0.002086272,0.001023547,0.1903579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02174146,"threshold_uncertainty_score":0.07273239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03849920406538472,"score_gpt":0.2814283604182563,"score_spread":0.2429291563528715,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}