{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153024,0.0006741671,0.001040573,0.000772196,0.0007670467,0.00227529,0.001344807,0.0007451547,0.006163448],"category_scores_gemma":[0.005587813,0.000551113,0.0007108689,0.002113586,0.0008142755,0.004637886,0.002817126,0.001040299,0.003299656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009792276,"about_ca_system_score_gemma":0.001743897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008018348,"about_ca_topic_score_gemma":0.001691389,"domain_scores_codex":[0.9979681,0.0004341305,0.0002619329,0.0003689534,0.0007068333,0.0002600319],"domain_scores_gemma":[0.9967902,0.001317902,0.000317875,0.0009986593,0.00047126,0.0001040655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00176094,0.000328565,0.003474245,0.001170719,0.0001059372,0.0006268581,0.001277043,0.04044965,0.09911543,0.162816,0.03317843,0.6556962],"study_design_scores_gemma":[0.0003828421,0.0006633207,0.001379649,0.0002801544,0.0001055597,0.0008659327,0.0008905762,0.4493823,0.1882517,0.2850384,0.07256387,0.000195559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07221072,0.0007789743,0.899787,0.0006690919,0.0001704645,0.0002366065,0.00131931,0.0128081,0.01201973],"genre_scores_gemma":[0.3268853,0.0003946534,0.6575688,0.0003425487,0.00007748688,0.0006480591,0.004443419,0.0008751201,0.008764515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006163448,"threshold_uncertainty_score":0.0206188,"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."}}