{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176647,0.0003279546,0.000677466,0.001830169,0.002158193,0.002404946,0.0007627735,0.0009035609,0.002132369],"category_scores_gemma":[0.004814308,0.0004854563,0.0008471456,0.001183973,0.003322188,0.002790781,0.002249935,0.001153911,0.0003329844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001536745,"about_ca_system_score_gemma":0.0009968869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001105652,"about_ca_topic_score_gemma":0.0007538879,"domain_scores_codex":[0.9988081,0.0002039502,0.0001274643,0.0004571038,0.000221097,0.0001821863],"domain_scores_gemma":[0.994023,0.003372456,0.0006873687,0.0005786734,0.0008532614,0.000485121],"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.0001399519,0.00003627156,0.005265134,0.0001204893,0.00003456379,0.0004534637,0.001782618,0.001584113,0.01128626,0.9601467,0.0003985044,0.01875184],"study_design_scores_gemma":[0.00003470498,0.0001217384,0.003466095,0.00005821708,0.00007843684,0.001101233,0.0007070456,0.00753012,0.01707015,0.9612942,0.008486498,0.00005160336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8722931,0.001115288,0.1121805,0.0002996645,0.00004356773,0.00006465994,0.0002365223,0.0002827,0.01348401],"genre_scores_gemma":[0.9633909,0.0002734762,0.03171849,0.0001106553,0.00005059404,0.000100625,0.0002206717,0.00004500326,0.004089558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002404946,"threshold_uncertainty_score":0.01114988,"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."}}