{"id":"W3000349095","doi":"10.37236/909","title":"For each $\\alpha > 2$ there is an Infinite Binary Word with Critical Exponent $\\alpha$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Alpha (finance); Combinatorics; Word (group theory); Binary number; Critical exponent; Discrete mathematics; Arithmetic; Statistics; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855296,0.0008763261,0.0006967856,0.001087916,0.001571532,0.002459873,0.0005409525,0.0009042929,0.008086525],"category_scores_gemma":[0.001871198,0.0004177614,0.0005172737,0.0008448416,0.00228586,0.004067187,0.001580459,0.001969466,0.001783743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008463548,"about_ca_system_score_gemma":0.0004494005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005015762,"about_ca_topic_score_gemma":0.000556855,"domain_scores_codex":[0.9995937,0.00003994716,0.00002972624,0.0001350871,0.00008037292,0.0001212767],"domain_scores_gemma":[0.9983296,0.0007943963,0.0002130572,0.0001220314,0.0003040364,0.0002369455],"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.0007909245,0.0001181986,0.003124896,0.0004387022,0.00004125301,0.002525192,0.002401185,0.0007547425,0.07177786,0.866151,0.009069729,0.04280636],"study_design_scores_gemma":[0.00008944086,0.0001160907,0.003876403,0.0001638327,0.00006022743,0.002627097,0.00101504,0.005534885,0.02759278,0.8994023,0.05944038,0.00008141213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6824678,0.002361831,0.1684583,0.004360822,0.001098846,0.0001600779,0.001279746,0.0009509507,0.1388616],"genre_scores_gemma":[0.9041,0.0009517844,0.05678061,0.0006407632,0.0006132209,0.0002037591,0.0007522473,0.0004058697,0.03555172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008086525,"threshold_uncertainty_score":0.02705216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01976207644731753,"score_gpt":0.2554423161073348,"score_spread":0.2356802396600172,"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."}}