{"id":"W2003022262","doi":"10.1142/s0129054108005620","title":"AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; String (physics); Combinatorics; Mathematics; Sequence (biology); Function (biology); Discrete mathematics; Mathematical analysis; Mathematical physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0008497873,0.00007998155,0.0001516336,0.0003260975,0.0001594882,0.0001696562,0.003305587,0.00002088483,0.00001114736],"category_scores_gemma":[0.00008335526,0.00005827185,0.00008774636,0.0004706735,0.0003788169,0.002450601,0.0002982221,0.0001067095,0.00000150951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006944196,"about_ca_system_score_gemma":0.0005416101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003902504,"about_ca_topic_score_gemma":0.000005983216,"domain_scores_codex":[0.9982067,0.00002395522,0.0005693358,0.0001754637,0.0008775294,0.000147042],"domain_scores_gemma":[0.9974739,0.0002942868,0.0004989747,0.000345438,0.001326766,0.00006061243],"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.0003335642,0.003227313,0.04174154,0.0000359115,0.000280249,0.0001408959,0.006785622,0.1005708,0.01774543,0.3593196,0.001027226,0.4687918],"study_design_scores_gemma":[0.001259965,0.0004122091,0.1327558,0.0001690234,0.000009202214,0.0007805848,0.00003397172,0.8490372,0.003230651,0.01087137,0.001271628,0.0001684084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905637,0.0000186478,0.7077126,0.0003577486,0.001242159,0.0000612688,0.00000441381,0.000004032458,0.00003546493],"genre_scores_gemma":[0.7682745,0.00001784958,0.2315165,0.00004458202,0.0001368825,0.000001467297,8.651991e-7,0.000002429668,0.000004867499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7484664,"threshold_uncertainty_score":0.6142657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02601152134161641,"score_gpt":0.3290096093632813,"score_spread":0.3029980880216649,"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."}}