{"id":"W2990480882","doi":"","title":"Algorithms to Compute the Lyndon Array Revisited.","year":2019,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Computer science; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002939961,0.0009892541,0.001155585,0.002292596,0.001418374,0.004048849,0.00299333,0.001894941,0.01017502],"category_scores_gemma":[0.01990851,0.0006639286,0.0008353704,0.004302778,0.002127386,0.008710042,0.004347364,0.005502804,0.005012662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547819,"about_ca_system_score_gemma":0.002218134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002288089,"about_ca_topic_score_gemma":0.003878886,"domain_scores_codex":[0.9978751,0.0006293071,0.0001963221,0.0003725603,0.0006814173,0.0002453528],"domain_scores_gemma":[0.9942849,0.002937849,0.0002287582,0.001425271,0.0009316389,0.0001915481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004399254,0.0001001859,0.0009027697,0.0002387673,0.00005569231,0.0001236934,0.0003400454,0.01673221,0.002922548,0.654159,0.02608332,0.2979019],"study_design_scores_gemma":[0.00006044024,0.0000578289,0.0001945923,0.0001052828,0.00002635442,0.0001855983,0.0001245197,0.1215099,0.004201655,0.8521444,0.02134804,0.00004139085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009099554,0.002876745,0.9657529,0.001772544,0.0007540711,0.00006957907,0.0002055394,0.001901954,0.01756711],"genre_scores_gemma":[0.1781351,0.002464641,0.7875015,0.001495215,0.0008495806,0.0004126007,0.0009723239,0.0008796367,0.02728953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01017502,"threshold_uncertainty_score":0.03403884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01897337519445805,"score_gpt":0.2576895166637349,"score_spread":0.2387161414692768,"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."}}