{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002191106,0.000419064,0.0004422425,0.0001932663,0.0006899423,0.0006217165,0.001744716,0.0004023496,0.0005696763],"category_scores_gemma":[0.0006672453,0.0004679765,0.0006551644,0.0004711596,0.0006108708,0.001750685,0.001059598,0.0006339637,0.00009566436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004480095,"about_ca_system_score_gemma":0.0005714325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005476865,"about_ca_topic_score_gemma":0.00004891428,"domain_scores_codex":[0.9960573,0.000347744,0.001079282,0.0005099871,0.001240545,0.0007651788],"domain_scores_gemma":[0.9958411,0.000978724,0.001585571,0.001059624,0.000185692,0.0003492604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001598602,0.000313839,0.00001785856,0.0001542679,0.0003222938,0.0002510005,0.002086229,0.0002317893,0.001032943,0.9823927,0.006491491,0.005106993],"study_design_scores_gemma":[0.007125124,0.005421069,0.0003168705,0.001494634,0.0006426884,0.002784101,0.002674825,0.1302695,0.4665495,0.2800707,0.1007909,0.001860117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902675,0.0008065588,0.001756086,0.0005571657,0.003306941,0.00006829729,0.00005667115,0.0001147101,0.003066075],"genre_scores_gemma":[0.9962326,0.0001347515,0.001727544,0.0003297525,0.001283811,0.00004690642,0.00002487893,0.0001026802,0.0001170965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.702322,"threshold_uncertainty_score":0.9997772,"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."}}