{"id":"W2084532813","doi":"10.1016/j.ic.2009.03.004","title":"Variants of codes and indecomposable languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Catenation; Extension (predicate logic); Indecomposable module; Computer science; Prefix code; Regular language; Code (set theory); Prime (order theory); Decomposition; Mathematics; Programming language; Discrete mathematics; Algebra over a field; Pure mathematics; Automaton; Combinatorics; Theoretical computer science; Algorithm; Decoding methods; Linear code; Set (abstract data type)","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.0001227146,0.00003832192,0.00005851315,0.00006895199,0.00003776573,0.00008843259,0.0000597375,0.00001967818,0.000001477111],"category_scores_gemma":[0.000008430462,0.00003421433,0.000006646528,0.0000842286,0.00001242132,0.00108533,0.00002196172,0.0000217992,0.00000313686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003064232,"about_ca_system_score_gemma":0.000008298304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007607128,"about_ca_topic_score_gemma":3.020089e-7,"domain_scores_codex":[0.9996895,0.00001317578,0.0001360886,0.00004284968,0.00007010207,0.00004832384],"domain_scores_gemma":[0.9997876,0.00002914662,0.00007663869,0.00005087086,0.00003397057,0.00002180283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003867475,0.00001216555,0.00020087,0.00001641729,0.000003461218,3.22359e-7,0.002503406,0.0003789977,0.0002604195,0.1726035,0.0001596238,0.8238569],"study_design_scores_gemma":[0.0005219078,0.0001262804,0.1828406,0.00002952953,0.000003028562,0.00002940296,0.0003595251,0.7708479,0.0009381083,0.04382916,0.000366495,0.0001080305],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3571956,0.00008023336,0.6396942,0.0003279958,0.0000300649,0.00005370289,0.000001780414,0.00006202335,0.002554434],"genre_scores_gemma":[0.9847401,0.00001638695,0.01479978,0.0004257582,0.000004779459,4.83381e-7,0.000008005588,5.01074e-7,0.000004195832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8237489,"threshold_uncertainty_score":0.139522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005621339309925413,"score_gpt":0.243609034690517,"score_spread":0.2379876953805916,"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."}}