{"id":"W2244935559","doi":"10.1016/j.dam.2016.03.010","title":"Initial non-repetitive complexity of infinite words","year":2016,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Repetition (rhetorical device); Word (group theory); Function (biology); Mathematics; Word length; Combinatorics; Computer science; Linguistics; Natural language processing; Biology; Philosophy; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005654711,0.0004893671,0.0009037731,0.0001869444,0.00008366218,0.00014455,0.002192704,0.00031157,0.00007961944],"category_scores_gemma":[0.0000530175,0.0003800172,0.000258513,0.0001988908,0.0005049448,0.0001288759,0.003577229,0.0004500206,0.0001129237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005389552,"about_ca_system_score_gemma":0.0001690774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008078678,"about_ca_topic_score_gemma":0.000002024823,"domain_scores_codex":[0.9974238,0.00003562442,0.0008596467,0.0006727853,0.0005811673,0.0004269862],"domain_scores_gemma":[0.9964898,0.0003841762,0.0008922507,0.001984812,0.0001193439,0.0001296347],"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.00000966723,0.000108328,0.000002937007,0.0006814717,0.00009998699,0.000007527788,0.004100405,0.00001397634,0.001829826,0.9888238,0.000184742,0.004137336],"study_design_scores_gemma":[0.0004221323,0.0000324575,0.00007774681,0.000741495,0.0000450824,0.000006056662,0.0002795269,0.01118816,0.01577624,0.9707334,0.0001506693,0.00054703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01346757,0.00003791741,0.8876546,0.0001922204,0.0003914557,0.000629734,0.0002207387,0.0002523006,0.09715348],"genre_scores_gemma":[0.7653641,0.00002312012,0.2340038,0.0001173556,0.0001902252,0.0001281554,0.00004257485,0.00005046127,0.00008015193],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7518966,"threshold_uncertainty_score":0.9998652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03674040037245721,"score_gpt":0.2879595770724118,"score_spread":0.2512191766999546,"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."}}