{"id":"W7109950510","doi":"10.4230/lipics.icalp.2025.28","title":"Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Deterministic algorithm; Rank (graph theory); Cluster analysis; Time complexity; State (computer science); Randomized algorithm","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.002312469,0.00223357,0.002091051,0.001179973,0.001933817,0.003605639,0.00381679,0.002239982,0.01222344],"category_scores_gemma":[0.008754293,0.0009652007,0.002901248,0.002346622,0.001673398,0.0067519,0.003294625,0.003666005,0.00707254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004591594,"about_ca_system_score_gemma":0.006478971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006731509,"about_ca_topic_score_gemma":0.009508342,"domain_scores_codex":[0.995407,0.0005609412,0.0002976296,0.00151106,0.001144509,0.001078993],"domain_scores_gemma":[0.9917622,0.002805403,0.0005935646,0.003601123,0.0008844496,0.0003532092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002469963,0.00108755,0.004807548,0.001171054,0.0003440953,0.0004887847,0.0005895813,0.1661811,0.04646801,0.1274079,0.1061806,0.5428038],"study_design_scores_gemma":[0.000407038,0.0002080047,0.0007768274,0.00006328522,0.0001719354,0.0005222086,0.0001442664,0.8192951,0.02131608,0.1384175,0.01858574,0.00009204476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03675602,0.000848013,0.9172562,0.002974547,0.0003163294,0.0003853706,0.002240465,0.02386356,0.01535944],"genre_scores_gemma":[0.3120352,0.0003073703,0.6697902,0.001136411,0.0002509916,0.0004937227,0.005048871,0.002113356,0.00882389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01222344,"threshold_uncertainty_score":0.04089141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01588720773416899,"score_gpt":0.2990740121710311,"score_spread":0.2831868044368621,"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."}}