{"id":"W4413333548","doi":"10.1007/s00224-025-10234-x","title":"The Reflection Complexity of Sequences Over Finite Alphabets","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.003028559,0.0001212764,0.0002881246,0.0001069834,0.000272345,0.00008575463,0.001066104,0.00005019531,0.000001904682],"category_scores_gemma":[0.0001244676,0.00008507517,0.00008943545,0.0004823098,0.000406671,0.0001200131,0.0002571665,0.0001044934,0.000003064758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003224462,"about_ca_system_score_gemma":0.00006815171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007532656,"about_ca_topic_score_gemma":0.00000361463,"domain_scores_codex":[0.9981481,0.0006491776,0.0005247826,0.0002229611,0.0002447049,0.0002102104],"domain_scores_gemma":[0.9968977,0.001923191,0.0004026598,0.0006264178,0.0001257509,0.00002429503],"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.00001419521,0.00002145875,0.0001900502,0.0001018258,0.00004756423,6.993185e-7,0.0006446639,0.001372632,0.001996415,0.98257,0.0001653607,0.01287515],"study_design_scores_gemma":[0.0004116635,0.0001191638,0.006153491,0.0009011631,0.00002073686,0.00001388677,0.0007229432,0.4142495,0.009865217,0.5662314,0.001102533,0.000208337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3100579,0.001559814,0.6766846,0.0001604994,0.001961933,0.0002279538,0.000003037056,0.0001831443,0.009161109],"genre_scores_gemma":[0.9985254,0.000008906618,0.001062371,0.00005548788,0.00004999519,0.000002266053,7.24384e-7,0.000004607763,0.0002902838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6884674,"threshold_uncertainty_score":0.3469265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03375936000535939,"score_gpt":0.2939227793797924,"score_spread":0.260163419374433,"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."}}