{"id":"W195053133","doi":"10.1007/978-3-642-21458-5_9","title":"A d-Step Approach for Distinct Squares in Strings","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Alphabet; Conjecture; String (physics); Bounded function; Combinatorics; Constant (computer programming); Computer science; String searching algorithm; Least-squares function approximation; Key (lock); Mathematics; Discrete mathematics; Algorithm; Pattern matching; Artificial intelligence; Mathematical analysis; Statistics","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.0008419692,0.0005273839,0.0005735634,0.0007861741,0.0002052524,0.0004292103,0.004223601,0.000319509,0.000009700848],"category_scores_gemma":[0.00008074515,0.0004470692,0.0001355435,0.0004851106,0.0004020336,0.0007565327,0.002050106,0.0006449029,0.00000943825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002020441,"about_ca_system_score_gemma":0.0003406506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009530116,"about_ca_topic_score_gemma":0.00006697555,"domain_scores_codex":[0.9962199,0.00002592816,0.0004942306,0.001834338,0.0006851183,0.0007404817],"domain_scores_gemma":[0.9975508,0.0003606096,0.0002751524,0.001490711,0.0001583554,0.0001643437],"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.00001773021,0.00008173447,0.000118393,0.00009778254,0.00000661436,0.00004079554,0.0006017423,0.003644278,0.00001858297,0.05778606,0.0001137156,0.9374726],"study_design_scores_gemma":[0.0004761424,0.0002162542,0.0003078066,0.0003112274,0.000005096956,0.00003215572,1.765223e-7,0.8619131,0.0002122225,0.1311467,0.004665195,0.0007138458],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000214603,0.0003846052,0.9947651,0.0001243809,0.0008314894,0.0006956944,0.0000234497,0.0001193255,0.003034466],"genre_scores_gemma":[0.03306986,0.0000206681,0.9657993,0.0003757959,0.0003446732,0.00004875228,0.00002953029,0.00003693052,0.000274433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9367587,"threshold_uncertainty_score":0.9997981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02682696374900411,"score_gpt":0.2449010335685098,"score_spread":0.2180740698195057,"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."}}