{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000427114,0.0002150438,0.0002806229,0.00009908523,0.0001947045,0.0002428035,0.002361343,0.00008573389,0.0001054916],"category_scores_gemma":[0.00005907286,0.0001497708,0.00005882145,0.0004257983,0.00006414927,0.0003949935,0.001012938,0.0003455401,0.001009435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044981,"about_ca_system_score_gemma":0.0001131691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007395827,"about_ca_topic_score_gemma":0.000005684195,"domain_scores_codex":[0.9981167,0.0001617335,0.0002827283,0.0006989538,0.0002779551,0.0004619369],"domain_scores_gemma":[0.9979321,0.0002420919,0.0001315858,0.00137794,0.0001656931,0.0001505554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005695755,0.0001869292,0.01242748,0.00007463849,0.0001214313,0.00009179785,0.002190315,0.0006006654,0.01672821,0.4654878,0.01797762,0.4840561],"study_design_scores_gemma":[0.002547003,0.001472289,0.1201403,0.0004789353,0.00004117515,0.0004328317,0.0001908435,0.3805847,0.01241384,0.01259757,0.4670385,0.00206195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02596517,0.0001314695,0.9616758,0.002945682,0.00100595,0.0005111687,0.00001174031,0.0002114161,0.007541653],"genre_scores_gemma":[0.9314102,0.00003657052,0.065483,0.002147439,0.0001802058,0.00003297775,0.00001490518,0.00001252235,0.0006821816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.905445,"threshold_uncertainty_score":0.9997684,"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."}}