{"id":"W3125798661","doi":"10.20944/preprints202009.0557.v1","title":"Computing Maximal Lyndon Substrings of a String","year":2020,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Suffix array; Suffix tree; Generalized suffix tree; String (physics); Algorithm; Time complexity; Suffix; Compressed suffix array; Mathematics; Combinatorics; String searching algorithm; Sorting; Computer science; Discrete mathematics; Data structure; Pattern matching; Artificial intelligence","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006369083,0.000431549,0.0007029193,0.0001831258,0.000127236,0.00009137118,0.00360867,0.0002861457,0.00008556429],"category_scores_gemma":[0.0001799451,0.0004510335,0.0002749031,0.0003400492,0.00007646556,0.0003298623,0.01998302,0.001164686,0.0002457844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009312412,"about_ca_system_score_gemma":0.0002351283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003324833,"about_ca_topic_score_gemma":0.00000180237,"domain_scores_codex":[0.9963133,0.0001333123,0.0008441209,0.001568111,0.0006754936,0.0004656165],"domain_scores_gemma":[0.996506,0.0001265212,0.0007578685,0.00218717,0.0001869126,0.0002355489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002077601,0.0009825064,0.7450166,0.003263615,0.000754288,0.00047381,0.01108651,0.01319711,0.07917053,0.04625914,0.0007422277,0.0988459],"study_design_scores_gemma":[0.001172594,0.00007736318,0.4673449,0.001563603,0.00007041648,0.00004024263,0.00008474896,0.342091,0.170107,0.01257315,0.003445334,0.001429697],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.629617,0.0001577133,0.3660388,0.0003972924,0.0008655062,0.0004226011,0.00002724967,0.000441217,0.002032557],"genre_scores_gemma":[0.9665965,0.00004955319,0.03293155,0.00007696053,0.0002228287,0.00001367851,0.00003494561,0.00002992731,0.00004400147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3369795,"threshold_uncertainty_score":0.9997941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1394014060639709,"score_gpt":0.3351850256452111,"score_spread":0.1957836195812402,"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."}}