{"id":"W2076953942","doi":"10.1142/s0129054112400199","title":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix; Time complexity; Extension (predicate logic); Suffix array; Factorization; Suffix tree; Parallel algorithm; Compressed suffix array; Running time; Mathematics; Data structure","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":[],"consensus_categories":[],"category_scores_codex":[0.001531015,0.000134055,0.0002208083,0.0007248781,0.0002595344,0.0004383457,0.003491195,0.00003546491,0.0000297786],"category_scores_gemma":[0.000149655,0.0001177187,0.0001403252,0.000854994,0.0003147587,0.004672316,0.0009614854,0.000198788,0.00001826594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001294167,"about_ca_system_score_gemma":0.0003573482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001016034,"about_ca_topic_score_gemma":2.148637e-7,"domain_scores_codex":[0.9972554,0.00005129747,0.0007737878,0.0002317846,0.001390413,0.0002973591],"domain_scores_gemma":[0.9959214,0.0001883107,0.0008549725,0.0004854568,0.002333938,0.0002159282],"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.000007522628,0.0005714102,0.00165884,0.000009540127,0.00009149204,0.00002039968,0.001347263,0.0009979589,0.00326253,0.119471,0.00214536,0.8704167],"study_design_scores_gemma":[0.001718338,0.0004315377,0.05116097,0.0009370505,0.00004796808,0.002950476,0.0001055454,0.8677851,0.01444151,0.01083184,0.04883277,0.0007568771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00619703,0.0001780582,0.9884154,0.0007942127,0.003744386,0.00005871828,0.00001005569,0.00003035423,0.0005717873],"genre_scores_gemma":[0.3791568,0.0000315863,0.6198748,0.0001599511,0.0007567853,4.740422e-7,0.00000474736,0.000004002335,0.00001083468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8696598,"threshold_uncertainty_score":0.6487566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01584525680787859,"score_gpt":0.3125886062766008,"score_spread":0.2967433494687223,"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."}}