{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; Pure mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0004102688,0.0001040771,0.0001973205,0.00009114642,0.0001371105,0.0001054729,0.0007709799,0.00003010888,0.00002280854],"category_scores_gemma":[0.00005813143,0.0000532591,0.0001623643,0.0003854126,0.0001317153,0.0002904693,0.0001162145,0.0001753669,0.00001652636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003862498,"about_ca_system_score_gemma":0.00009972056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006374175,"about_ca_topic_score_gemma":0.000002967516,"domain_scores_codex":[0.9985676,0.0002178915,0.0005281632,0.0001065004,0.0004448037,0.0001350465],"domain_scores_gemma":[0.9984328,0.0002702275,0.0007111525,0.0002012599,0.0003340994,0.00005047831],"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.00003428792,0.0003421118,0.0003731811,0.00004131619,0.0001305631,0.000002727587,0.00449102,0.04050757,0.009175975,0.7666699,0.01826059,0.1599708],"study_design_scores_gemma":[0.0007391523,0.000202729,0.06841884,0.0001043933,0.00001549451,0.00006598722,0.00004465551,0.2350729,0.00284083,0.6921653,0.0002094197,0.0001202953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7919084,0.00004684626,0.1917768,0.0149485,0.0004932842,0.0002713638,6.656947e-7,0.00001474045,0.0005393491],"genre_scores_gemma":[0.9896519,0.000002856498,0.009543744,0.0006412314,0.0001152661,0.000003657365,3.673686e-7,0.000004686955,0.00003624659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1977435,"threshold_uncertainty_score":0.2171843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03037903373116636,"score_gpt":0.2429758271014958,"score_spread":0.2125967933703294,"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."}}