{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009233248,0.0002060677,0.0002082138,0.00007544567,0.0005756526,0.00009923466,0.0002133308,0.0001103843,0.001535847],"category_scores_gemma":[0.00004040417,0.0001749502,0.00007542969,0.0002272603,0.0001035456,0.000127274,0.00005741225,0.0001664589,0.003180244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000340812,"about_ca_system_score_gemma":0.00002009438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007591136,"about_ca_topic_score_gemma":0.000005428341,"domain_scores_codex":[0.9988822,0.00003466193,0.0002743888,0.0003756995,0.0001921137,0.0002409705],"domain_scores_gemma":[0.9985538,0.0004800493,0.000122887,0.000547146,0.0001129764,0.0001831213],"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.000008871603,0.0002510058,0.00007952619,0.00003088689,0.00003448529,2.252183e-7,0.0002183211,0.000002938679,0.01908584,0.9519672,0.02676626,0.001554364],"study_design_scores_gemma":[0.001077875,0.00006453389,0.002644416,0.00004648227,0.0001035086,0.00003636068,0.0002270206,0.001192157,0.03975173,0.7380159,0.216169,0.0006710612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8517954,0.0004651156,0.04775129,0.02121951,0.0001230777,0.005282363,0.0003128495,0.0009968955,0.0720535],"genre_scores_gemma":[0.9844462,0.00008969755,0.004806718,0.001551194,0.0001760657,0.001649804,0.0001055928,0.00005057317,0.007124181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2139514,"threshold_uncertainty_score":0.9993769,"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."}}