{"id":"W2987134948","doi":"10.4230/lipics.icalp.2020.14","title":"Space Efficient Construction of Lyndon Arrays in Linear Time","year":2019,"lang":"en","type":"preprint","venue":"Repository KITopen (Karlsruhe Institute of Technology)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Space (punctuation); String (physics); Linear space; Order (exchange); Construct (python library); Mathematics; Combinatorics; Algorithm; Time complexity; Discrete mathematics; Computer science","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"],"consensus_categories":[],"category_scores_codex":[0.000371263,0.0004165938,0.001010864,0.001068188,0.00008795407,0.00005911072,0.002961962,0.0009872727,0.000005831788],"category_scores_gemma":[0.00008669918,0.0004000248,0.0001934836,0.0007986918,0.0005275108,0.0003675816,0.004358639,0.001026376,0.00003457196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881445,"about_ca_system_score_gemma":0.0006241664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003145379,"about_ca_topic_score_gemma":0.00000350178,"domain_scores_codex":[0.9969226,0.00006454103,0.001062488,0.001050499,0.0005378018,0.000362093],"domain_scores_gemma":[0.9957122,0.00003712949,0.001152928,0.002741569,0.0002880577,0.00006814492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003015519,0.002507762,0.01032134,0.003251743,0.0006543064,0.0008526593,0.0009316215,0.4642273,0.3254131,0.08453169,0.00408167,0.1029252],"study_design_scores_gemma":[0.001663356,0.0003773384,0.00145859,0.004243318,0.00009147549,0.0003707169,0.00007049736,0.4870386,0.4811069,0.002977852,0.01936214,0.001239171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6830275,0.001344084,0.2916616,0.0009105923,0.01289801,0.00188803,0.00005365698,0.0005893451,0.007627179],"genre_scores_gemma":[0.5644789,0.0001376441,0.4345516,0.00001360614,0.0001755902,0.00005938269,0.00004059763,0.00003619664,0.0005064409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1556938,"threshold_uncertainty_score":0.9998451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008274238450181059,"score_gpt":0.2334200377918403,"score_spread":0.2251457993416593,"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."}}