{"id":"W2982393288","doi":"10.4230/lipics.ccc.2020.12","title":"Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Invariant (physics); Invariant theory; Conjecture; Mathematics; Computational complexity theory; Algebraic number; Proof complexity; Polynomial ring; Algebra over a field; Discrete mathematics; Theoretical computer science; Polynomial; Pure mathematics; Computer science; Algorithm; Mathematical proof","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617527,0.0003293445,0.0005883867,0.0002977946,0.000234888,0.0003353381,0.001316,0.0001401746,0.000009178654],"category_scores_gemma":[0.00009629143,0.0003155464,0.0001800549,0.0006675742,0.0002753475,0.001237537,0.0009626257,0.0003385307,0.000007708535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004835286,"about_ca_system_score_gemma":0.0001097771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000506192,"about_ca_topic_score_gemma":0.00004487762,"domain_scores_codex":[0.9973487,0.00004775948,0.001108119,0.0003839315,0.0004409993,0.0006705116],"domain_scores_gemma":[0.9985294,0.0001652522,0.0002929265,0.0004876679,0.0002529582,0.0002717414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003071368,0.0011647,0.05188864,0.01055418,0.0004688634,0.00001483668,0.1105573,0.001557093,0.0009602077,0.7657853,0.004577898,0.05216381],"study_design_scores_gemma":[0.006380743,0.0008974944,0.003736745,0.000322446,0.00002677109,0.00004337611,0.001068762,0.9404,0.006061665,0.02668887,0.01350763,0.0008654775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3357936,0.00009952407,0.6583152,0.00188822,0.0004759438,0.002332438,0.0005414812,0.0001539693,0.0003996366],"genre_scores_gemma":[0.8201808,0.00003604076,0.1778346,0.001473535,0.0001114291,0.0001713365,0.0001409116,0.00003511286,0.00001620343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9388429,"threshold_uncertainty_score":0.9999297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06788203052079886,"score_gpt":0.2681875824002677,"score_spread":0.2003055518794688,"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."}}