{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","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.001646239,0.001283491,0.0007974678,0.0007116178,0.002453503,0.002061903,0.001321046,0.001354873,0.04713961],"category_scores_gemma":[0.006122123,0.0008209007,0.002700454,0.0007416133,0.002835738,0.006208493,0.004886511,0.003278025,0.0145945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00099844,"about_ca_system_score_gemma":0.001951743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001493605,"about_ca_topic_score_gemma":0.003245684,"domain_scores_codex":[0.9983991,0.0002484345,0.0001568591,0.0005393938,0.0004700461,0.0001862283],"domain_scores_gemma":[0.9949552,0.002151518,0.0003417972,0.0008536972,0.001356051,0.0003416476],"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.0005666144,0.0003766718,0.001699476,0.001475648,0.0001986085,0.001785485,0.002551634,0.001389036,0.05913178,0.6622698,0.1519082,0.1166469],"study_design_scores_gemma":[0.0001769597,0.000278991,0.002156111,0.0002492419,0.0001616904,0.002475864,0.000649762,0.004255858,0.02847569,0.7575288,0.2034468,0.000144224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03068328,0.0008606575,0.7210879,0.01238762,0.004600397,0.000904555,0.003352564,0.003687001,0.2224359],"genre_scores_gemma":[0.4544552,0.001040955,0.3638878,0.00836513,0.002069672,0.00104051,0.003583799,0.001360967,0.1641959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04713961,"threshold_uncertainty_score":0.1576977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01523654024083817,"score_gpt":0.2316709412900469,"score_spread":0.2164344010492087,"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."}}