{"id":"W1597806222","doi":"10.1007/3-540-45655-4_35","title":"Repetition Complexity of Words","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Iterated function; Computational complexity theory; Morphism; Logarithm; Time complexity; Complexity class; Combinatorics on words; Combinatorics; Discrete mathematics; Mathematics; Prefix; Computer science; Arithmetic; Algorithm","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.0005732679,0.0003942224,0.0005309542,0.0006261498,0.000179375,0.0002223566,0.003172092,0.0002538889,0.0001083166],"category_scores_gemma":[0.0000516234,0.0003512579,0.0001295984,0.0005297489,0.001125282,0.000686737,0.001851464,0.0005860697,0.00004019685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001545051,"about_ca_system_score_gemma":0.0001798859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003738396,"about_ca_topic_score_gemma":0.00001759778,"domain_scores_codex":[0.9966159,0.0000317182,0.0005785495,0.00124825,0.001075634,0.0004498792],"domain_scores_gemma":[0.9971585,0.0002062199,0.0004110197,0.001850031,0.0002363632,0.0001378499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000511745,0.00006495323,0.00003086249,0.00006109763,0.00000878969,0.00006432018,0.0004361019,0.004148151,0.0001490263,0.1267178,0.000127009,0.8681867],"study_design_scores_gemma":[0.0002423368,0.0001782753,0.0002170738,0.0006284655,0.00000566271,0.00006130454,6.517307e-8,0.6432409,0.001403089,0.3500201,0.003465746,0.0005370088],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002859643,0.0003361599,0.9907117,0.0004532327,0.001253772,0.000221471,0.00001754571,0.0001140599,0.006863413],"genre_scores_gemma":[0.05287969,0.0001236799,0.9453717,0.0005753277,0.0004467712,0.000004932674,0.00001894072,0.00002920681,0.0005497317],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8676497,"threshold_uncertainty_score":0.999894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03567448271604842,"score_gpt":0.2534903773255783,"score_spread":0.2178158946095299,"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."}}