{"id":"W2100901057","doi":"10.1109/ismvl.2011.36","title":"Maximal Centralizing Monoids and their Relation to Minimal Clones","year":2011,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Monoid; Unary operation; Mathematics; Set (abstract data type); Relation (database); Free monoid; Syntactic monoid; Combinatorics; Constant (computer programming); Element (criminal law); Discrete mathematics; Maximal element; Focus (optics); Pure mathematics; Algebra over a field; Computer science","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.0001371745,0.00007430124,0.0000680435,0.00004567632,0.0000586719,0.00005674559,0.0002279813,0.00002937222,0.00003785085],"category_scores_gemma":[0.000007817927,0.00005433297,0.00001936458,0.0001035521,0.00001530335,0.0003531905,0.0001574453,0.00003518031,0.00003698758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006961159,"about_ca_system_score_gemma":0.000006497196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004643936,"about_ca_topic_score_gemma":0.000002909785,"domain_scores_codex":[0.9994695,0.0000210714,0.00009764421,0.0001980243,0.00005171147,0.0001620871],"domain_scores_gemma":[0.9996668,0.00002621784,0.00002021382,0.0001970328,0.00001320728,0.0000766037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001935686,0.00005227149,0.008181174,0.00000754249,0.00001251824,0.000008110744,0.01367119,0.000002974375,0.01063699,0.8418525,0.0007029123,0.1248524],"study_design_scores_gemma":[0.0005979715,0.0004246214,0.7188082,0.00004923177,0.000007850972,0.00008527441,0.001391886,0.09123237,0.0886443,0.09270249,0.005312644,0.0007431675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6847064,0.00006126505,0.3073862,0.0002715143,0.0001124527,0.00006074374,5.454671e-7,0.0001571059,0.007243762],"genre_scores_gemma":[0.925125,0.00000462165,0.07433844,0.0003444867,0.00002272212,0.000002889788,3.616471e-7,0.000003930966,0.0001575611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.74915,"threshold_uncertainty_score":0.2215634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02763024359216009,"score_gpt":0.2109895034669891,"score_spread":0.183359259874829,"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."}}