{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006673026,0.002279333,0.002355898,0.00340741,0.00191231,0.00347441,0.004404855,0.002882236,0.01300124],"category_scores_gemma":[0.04451863,0.0009149052,0.001750043,0.00270633,0.004327225,0.01225664,0.00454299,0.006902838,0.004085361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0036527,"about_ca_system_score_gemma":0.002456286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006689685,"about_ca_topic_score_gemma":0.0008828785,"domain_scores_codex":[0.994495,0.001183569,0.0002948063,0.001208449,0.001777297,0.001040813],"domain_scores_gemma":[0.9535819,0.03500751,0.001523044,0.005095503,0.003054695,0.001737393],"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.001740812,0.0004216231,0.00561612,0.001218277,0.0001634039,0.0005809314,0.0006165107,0.08621162,0.03604279,0.6853142,0.02272664,0.159347],"study_design_scores_gemma":[0.00006094921,0.0003773308,0.002165114,0.0004299468,0.0001901479,0.001680241,0.0001537009,0.3551569,0.0236794,0.5932949,0.02266662,0.000144741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07282528,0.007512227,0.8548208,0.004823113,0.0005932392,0.0001412375,0.0008438426,0.003324765,0.05511551],"genre_scores_gemma":[0.6466753,0.005619146,0.3095509,0.003200029,0.002216242,0.001160316,0.002291263,0.002725666,0.02656102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01300124,"threshold_uncertainty_score":0.04349345,"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."}}